java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/regression/open/int/recursive-CallABAB.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:32,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:32,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:32,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:32,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:32,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:32,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:32,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:32,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:32,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:32,125 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:32,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:32,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:32,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:32,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:32,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:32,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:32,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:32,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:32,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:32,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:32,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:32,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:32,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:32,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:32,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:32,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:32,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:32,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:32,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:32,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:32,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:32,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:32,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:32,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:32,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:32,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:32,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:32,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:32,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:32,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:32,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:32,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:32,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:32,207 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:32,207 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:32,208 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/int/recursive-CallABAB.bpl [2019-08-05 11:09:32,208 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/int/recursive-CallABAB.bpl' [2019-08-05 11:09:32,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:32,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:32,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:32,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:32,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:32,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:32,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:32,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:32,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:32,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... [2019-08-05 11:09:32,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:32,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:32,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:32,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:32,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:09:32,375 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funA given in one single declaration [2019-08-05 11:09:32,375 INFO L130 BoogieDeclarations]: Found specification of procedure funA [2019-08-05 11:09:32,375 INFO L138 BoogieDeclarations]: Found implementation of procedure funA [2019-08-05 11:09:32,376 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funB given in one single declaration [2019-08-05 11:09:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure funB [2019-08-05 11:09:32,376 INFO L138 BoogieDeclarations]: Found implementation of procedure funB [2019-08-05 11:09:32,376 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dispatch given in one single declaration [2019-08-05 11:09:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure dispatch [2019-08-05 11:09:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure dispatch [2019-08-05 11:09:32,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:09:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:09:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:09:32,645 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:09:32,646 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:32,647 INFO L202 PluginConnector]: Adding new model recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:32 BoogieIcfgContainer [2019-08-05 11:09:32,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:32,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:32,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:32,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:32,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:32" (1/2) ... [2019-08-05 11:09:32,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b4faf4 and model type recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:32, skipping insertion in model container [2019-08-05 11:09:32,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:32" (2/2) ... [2019-08-05 11:09:32,655 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-CallABAB.bpl [2019-08-05 11:09:32,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:32,672 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:32,688 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:32,714 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:32,715 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:32,715 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:32,715 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:32,715 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:32,715 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:32,716 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:32,716 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:32,716 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-08-05 11:09:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:09:32,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:32,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:09:32,750 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 55606330, now seen corresponding path program 1 times [2019-08-05 11:09:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:32,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:32,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:32,907 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:09:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:32,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:32,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:32,944 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2019-08-05 11:09:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,109 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 11:09:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:33,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:09:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,121 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:09:33,121 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:09:33,123 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:09:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:09:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:09:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:09:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 11:09:33,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2019-08-05 11:09:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,167 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 11:09:33,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 11:09:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:09:33,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,170 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:33,170 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash -711412134, now seen corresponding path program 1 times [2019-08-05 11:09:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:33,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:33,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:33,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:33,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:33,249 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2019-08-05 11:09:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,399 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:09:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:33,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 11:09:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,401 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:09:33,401 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:09:33,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:09:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:09:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:09:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:09:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-08-05 11:09:33,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2019-08-05 11:09:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,410 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-08-05 11:09:33,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-08-05 11:09:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:09:33,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,411 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:33,412 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1461102629, now seen corresponding path program 1 times [2019-08-05 11:09:33,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:33,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:33,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:33,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:33,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:33,674 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-08-05 11:09:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,777 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-05 11:09:33,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:33,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-08-05 11:09:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,779 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:09:33,780 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:09:33,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:09:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:09:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:09:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 11:09:33,798 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2019-08-05 11:09:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,799 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 11:09:33,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 11:09:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:09:33,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,801 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:33,802 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 369205243, now seen corresponding path program 1 times [2019-08-05 11:09:33,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:09:34,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:09:34,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:09:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:09:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:09:34,116 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 8 states. [2019-08-05 11:09:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,429 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-08-05 11:09:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:09:34,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-08-05 11:09:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,432 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:09:34,432 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:09:34,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:09:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-08-05 11:09:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:09:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 11:09:34,441 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2019-08-05 11:09:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,442 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 11:09:34,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:09:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 11:09:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:09:34,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,444 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:34,444 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1523345156, now seen corresponding path program 2 times [2019-08-05 11:09:34,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:09:34,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:34,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:34,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:34,664 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2019-08-05 11:09:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:34,778 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-08-05 11:09:34,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:34,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-08-05 11:09:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:34,780 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:09:34,780 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:09:34,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:09:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-08-05 11:09:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:09:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 11:09:34,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2019-08-05 11:09:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:34,789 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 11:09:34,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 11:09:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:09:34,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:34,794 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:34,795 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:34,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:34,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1337370907, now seen corresponding path program 2 times [2019-08-05 11:09:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:34,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:09:34,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:09:35,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:09:35,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:09:35,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:09:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:35,068 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 10 states. [2019-08-05 11:09:35,357 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:09:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,484 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-08-05 11:09:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:09:35,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 11:09:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,487 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:09:35,487 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:35,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-08-05 11:09:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:09:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 11:09:35,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2019-08-05 11:09:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,503 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 11:09:35,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:09:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 11:09:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:09:35,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,507 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,507 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash 895938332, now seen corresponding path program 3 times [2019-08-05 11:09:35,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:09:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:09:35,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:35,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:35,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:35,621 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-08-05 11:09:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:35,711 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 11:09:35,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:35,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 11:09:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:35,714 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:35,715 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:35,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-08-05 11:09:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:09:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-08-05 11:09:35,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2019-08-05 11:09:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:35,725 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-08-05 11:09:35,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-08-05 11:09:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:09:35,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:35,726 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:35,727 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1823327844, now seen corresponding path program 4 times [2019-08-05 11:09:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:35,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:09:35,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 11:09:35,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:35,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:09:35,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:09:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:09:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:35,948 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 10 states. [2019-08-05 11:09:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,131 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-08-05 11:09:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:09:36,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 11:09:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,134 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:09:36,134 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:36,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-08-05 11:09:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:09:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-08-05 11:09:36,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 29 [2019-08-05 11:09:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,144 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-08-05 11:09:36,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:09:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-08-05 11:09:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:36,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,146 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:36,146 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash -201869123, now seen corresponding path program 5 times [2019-08-05 11:09:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:09:36,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:36,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:36,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:36,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:36,357 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 12 states. [2019-08-05 11:09:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,533 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2019-08-05 11:09:36,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:36,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:09:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,535 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:36,535 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:09:36,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:09:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-08-05 11:09:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-08-05 11:09:36,545 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 37 [2019-08-05 11:09:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,545 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-08-05 11:09:36,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-08-05 11:09:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:36,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:36,547 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:36,547 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1949541572, now seen corresponding path program 6 times [2019-08-05 11:09:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:36,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:36,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:36,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:36,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:36,736 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 12 states. [2019-08-05 11:09:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:36,968 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-08-05 11:09:36,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:36,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:09:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:36,970 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:09:36,971 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:09:36,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:09:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2019-08-05 11:09:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-08-05 11:09:36,997 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 37 [2019-08-05 11:09:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:36,998 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-08-05 11:09:36,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-08-05 11:09:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:36,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:37,000 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:37,000 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1721830597, now seen corresponding path program 7 times [2019-08-05 11:09:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:37,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:37,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 11:09:37,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:37,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:37,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:37,257 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 12 states. [2019-08-05 11:09:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:37,561 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-08-05 11:09:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:37,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:09:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:37,564 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:09:37,564 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:09:37,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:09:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2019-08-05 11:09:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-08-05 11:09:37,573 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2019-08-05 11:09:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:37,574 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-08-05 11:09:37,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-08-05 11:09:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:37,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:37,575 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:37,576 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:37,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash 25841852, now seen corresponding path program 8 times [2019-08-05 11:09:37,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:37,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:37,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:09:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:37,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:37,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:37,744 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 12 states. [2019-08-05 11:09:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:37,860 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-08-05 11:09:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:37,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 11:09:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:37,863 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:09:37,863 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:09:37,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:09:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-08-05 11:09:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-08-05 11:09:37,881 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2019-08-05 11:09:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:37,888 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-08-05 11:09:37,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-08-05 11:09:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:37,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:37,889 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:37,889 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1167621596, now seen corresponding path program 9 times [2019-08-05 11:09:37,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:37,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:09:37,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:38,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:38,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:38,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:38,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:38,175 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 14 states. [2019-08-05 11:09:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,334 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-08-05 11:09:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:38,337 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:09:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,339 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:09:38,339 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:09:38,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:09:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 45. [2019-08-05 11:09:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2019-08-05 11:09:38,347 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 45 [2019-08-05 11:09:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,348 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-08-05 11:09:38,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2019-08-05 11:09:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:38,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,349 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:38,350 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1607030691, now seen corresponding path program 10 times [2019-08-05 11:09:38,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 11:09:38,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:38,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:38,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:38,519 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 14 states. [2019-08-05 11:09:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,793 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2019-08-05 11:09:38,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:38,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:09:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,795 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:09:38,795 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:09:38,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:09:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-08-05 11:09:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-08-05 11:09:38,803 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 45 [2019-08-05 11:09:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,803 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-08-05 11:09:38,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-08-05 11:09:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:38,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,805 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:38,805 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 545611102, now seen corresponding path program 11 times [2019-08-05 11:09:38,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:09:38,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:38,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:38,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:38,912 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 7 states. [2019-08-05 11:09:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,050 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-08-05 11:09:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:39,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-08-05 11:09:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,052 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:39,052 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:39,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:09:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-08-05 11:09:39,061 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 45 [2019-08-05 11:09:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,061 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-08-05 11:09:39,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-08-05 11:09:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:39,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,062 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:39,066 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1743716773, now seen corresponding path program 12 times [2019-08-05 11:09:39,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:09:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:39,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:39,354 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 14 states. [2019-08-05 11:09:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,678 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-08-05 11:09:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:39,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:09:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,684 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:09:39,684 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:09:39,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:09:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2019-08-05 11:09:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:09:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-08-05 11:09:39,692 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 45 [2019-08-05 11:09:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,692 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-08-05 11:09:39,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-08-05 11:09:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:39,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,694 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:39,694 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 408925020, now seen corresponding path program 13 times [2019-08-05 11:09:39,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-08-05 11:09:40,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:40,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:40,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:40,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:40,011 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 15 states. [2019-08-05 11:09:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,342 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-08-05 11:09:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:40,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-08-05 11:09:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,344 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:09:40,344 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:09:40,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:09:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2019-08-05 11:09:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:09:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-08-05 11:09:40,349 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 45 [2019-08-05 11:09:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,350 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-08-05 11:09:40,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-08-05 11:09:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:40,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,351 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:40,351 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash -223401764, now seen corresponding path program 14 times [2019-08-05 11:09:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 11:09:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:40,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:40,504 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 14 states. [2019-08-05 11:09:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,627 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-08-05 11:09:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:40,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-08-05 11:09:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,629 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:09:40,629 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:09:40,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:09:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2019-08-05 11:09:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:09:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:09:40,635 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 45 [2019-08-05 11:09:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,636 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:09:40,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:09:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:40,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,637 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:40,637 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash 158146940, now seen corresponding path program 15 times [2019-08-05 11:09:40,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-08-05 11:09:40,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:40,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:40,906 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 16 states. [2019-08-05 11:09:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,272 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-08-05 11:09:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:41,272 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:09:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,273 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:09:41,273 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:09:41,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:09:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-08-05 11:09:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-08-05 11:09:41,279 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 53 [2019-08-05 11:09:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,280 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-08-05 11:09:41,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-08-05 11:09:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:41,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,281 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:41,282 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1006642045, now seen corresponding path program 16 times [2019-08-05 11:09:41,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-08-05 11:09:41,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:41,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:09:41,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:09:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:09:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:41,738 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 17 states. [2019-08-05 11:09:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,974 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2019-08-05 11:09:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:09:41,974 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-08-05 11:09:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,976 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:41,976 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:09:41,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:09:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-08-05 11:09:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-08-05 11:09:41,982 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 53 [2019-08-05 11:09:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,982 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-08-05 11:09:41,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:09:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-08-05 11:09:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:41,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,984 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:41,984 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1855907587, now seen corresponding path program 17 times [2019-08-05 11:09:41,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:42,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:42,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:42,173 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 16 states. [2019-08-05 11:09:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,339 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-08-05 11:09:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:42,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:09:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,343 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:09:42,343 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:09:42,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:09:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2019-08-05 11:09:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:09:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-08-05 11:09:42,353 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 53 [2019-08-05 11:09:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,354 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-08-05 11:09:42,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-08-05 11:09:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:42,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,355 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:42,356 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1701736835, now seen corresponding path program 18 times [2019-08-05 11:09:42,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 11:09:42,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:42,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:42,654 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 16 states. [2019-08-05 11:09:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,800 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2019-08-05 11:09:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:42,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:09:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,805 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:09:42,805 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:42,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2019-08-05 11:09:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:09:42,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 53 [2019-08-05 11:09:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,812 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:09:42,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:09:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:42,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,813 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:42,813 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash 312317692, now seen corresponding path program 19 times [2019-08-05 11:09:42,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:09:43,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:09:43,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:09:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:09:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:43,055 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 17 states. [2019-08-05 11:09:43,442 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-08-05 11:09:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,631 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-08-05 11:09:43,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:09:43,631 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-08-05 11:09:43,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,633 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:09:43,633 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:43,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2019-08-05 11:09:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-08-05 11:09:43,639 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 53 [2019-08-05 11:09:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,639 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-08-05 11:09:43,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:09:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-08-05 11:09:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:43,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,641 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:43,641 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1523168132, now seen corresponding path program 20 times [2019-08-05 11:09:43,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:43,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:43,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:09:43,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:09:43,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:09:43,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:09:43,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:43,827 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 17 states. [2019-08-05 11:09:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,018 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2019-08-05 11:09:44,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:09:44,019 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-08-05 11:09:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,020 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:44,021 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:44,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2019-08-05 11:09:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:09:44,027 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 53 [2019-08-05 11:09:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,027 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:09:44,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:09:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:09:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:44,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,028 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:44,028 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1923304059, now seen corresponding path program 21 times [2019-08-05 11:09:44,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-08-05 11:09:44,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:44,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:44,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:44,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:44,165 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 16 states. [2019-08-05 11:09:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,320 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2019-08-05 11:09:44,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:44,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:09:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,322 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:44,323 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:09:44,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:09:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2019-08-05 11:09:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:09:44,327 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 53 [2019-08-05 11:09:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,328 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:09:44,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:09:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:09:44,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,329 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:44,329 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -90750468, now seen corresponding path program 22 times [2019-08-05 11:09:44,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 58 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-08-05 11:09:44,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:44,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:44,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:44,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:44,558 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 16 states. [2019-08-05 11:09:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,716 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-08-05 11:09:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:44,717 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-08-05 11:09:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,718 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:09:44,719 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:44,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:09:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 61. [2019-08-05 11:09:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-08-05 11:09:44,724 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 53 [2019-08-05 11:09:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,724 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-08-05 11:09:44,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-08-05 11:09:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:44,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,725 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:44,726 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash -63069154, now seen corresponding path program 23 times [2019-08-05 11:09:44,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 74 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 11:09:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:44,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:44,957 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 18 states. [2019-08-05 11:09:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,102 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2019-08-05 11:09:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:45,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:09:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,105 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:45,105 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:45,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2019-08-05 11:09:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-08-05 11:09:45,112 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 61 [2019-08-05 11:09:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,112 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-08-05 11:09:45,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-08-05 11:09:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:45,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,114 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:45,114 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1626284131, now seen corresponding path program 24 times [2019-08-05 11:09:45,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 3 proven. 77 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:09:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:45,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:45,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:45,353 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 19 states. [2019-08-05 11:09:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,698 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-08-05 11:09:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:45,698 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,699 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:45,699 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:45,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2019-08-05 11:09:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-08-05 11:09:45,704 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 61 [2019-08-05 11:09:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,705 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-08-05 11:09:45,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-08-05 11:09:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:45,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,706 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:45,706 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -939846371, now seen corresponding path program 25 times [2019-08-05 11:09:45,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:09:45,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:45,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:45,945 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 19 states. [2019-08-05 11:09:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,614 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-08-05 11:09:46,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:46,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,615 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:09:46,616 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:46,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2019-08-05 11:09:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-08-05 11:09:46,622 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 61 [2019-08-05 11:09:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,623 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-08-05 11:09:46,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-08-05 11:09:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:46,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,624 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:46,624 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 787319453, now seen corresponding path program 26 times [2019-08-05 11:09:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:09:46,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:46,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:46,976 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 18 states. [2019-08-05 11:09:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,157 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2019-08-05 11:09:47,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:47,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:09:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,164 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:47,164 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:47,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:09:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2019-08-05 11:09:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-08-05 11:09:47,169 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 61 [2019-08-05 11:09:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,169 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-08-05 11:09:47,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-08-05 11:09:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:47,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,171 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:47,171 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,171 INFO L82 PathProgramCache]: Analyzing trace with hash -775895524, now seen corresponding path program 27 times [2019-08-05 11:09:47,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-08-05 11:09:47,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:47,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:47,689 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 18 states. [2019-08-05 11:09:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,891 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-08-05 11:09:47,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:47,892 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:09:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,894 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:47,894 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:47,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2019-08-05 11:09:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:09:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-08-05 11:09:47,899 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 61 [2019-08-05 11:09:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,900 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-08-05 11:09:47,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-08-05 11:09:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:47,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,901 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:47,901 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash -240363621, now seen corresponding path program 28 times [2019-08-05 11:09:47,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-08-05 11:09:48,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:48,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:48,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:48,093 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 18 states. [2019-08-05 11:09:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,270 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2019-08-05 11:09:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:48,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:09:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,272 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:09:48,272 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:09:48,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:09:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:09:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-08-05 11:09:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:09:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2019-08-05 11:09:48,277 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 61 [2019-08-05 11:09:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,277 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2019-08-05 11:09:48,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2019-08-05 11:09:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:48,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,278 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:48,278 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1322851356, now seen corresponding path program 29 times [2019-08-05 11:09:48,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 81 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-08-05 11:09:48,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:48,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:48,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:48,485 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand 18 states. [2019-08-05 11:09:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,672 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2019-08-05 11:09:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:48,678 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:09:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,679 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:48,679 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:48,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:09:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-08-05 11:09:48,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 61 [2019-08-05 11:09:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,686 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-08-05 11:09:48,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-08-05 11:09:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:48,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,687 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:48,687 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash 821349021, now seen corresponding path program 30 times [2019-08-05 11:09:48,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 3 proven. 77 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:09:49,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:49,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:49,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:49,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:49,077 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 19 states. [2019-08-05 11:09:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,319 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2019-08-05 11:09:49,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:49,319 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,321 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:49,321 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:49,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:09:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2019-08-05 11:09:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:09:49,326 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 61 [2019-08-05 11:09:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,326 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:09:49,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:09:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:49,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,327 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:49,328 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -404314468, now seen corresponding path program 31 times [2019-08-05 11:09:49,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:09:49,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:49,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:49,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:49,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:49,479 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 19 states. [2019-08-05 11:09:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,723 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2019-08-05 11:09:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:49,725 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,726 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:09:49,726 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:09:49,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:09:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 77. [2019-08-05 11:09:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:09:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:09:49,731 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 61 [2019-08-05 11:09:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,732 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:09:49,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:09:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:49,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,733 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:49,733 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1090752228, now seen corresponding path program 32 times [2019-08-05 11:09:49,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 82 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:09:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:49,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:49,896 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 19 states. [2019-08-05 11:09:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,118 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-08-05 11:09:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:50,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,120 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:09:50,121 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:09:50,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:09:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2019-08-05 11:09:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-08-05 11:09:50,126 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 61 [2019-08-05 11:09:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,127 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-08-05 11:09:50,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-08-05 11:09:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:50,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,128 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:50,128 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,128 INFO L82 PathProgramCache]: Analyzing trace with hash 472462749, now seen corresponding path program 33 times [2019-08-05 11:09:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:09:50,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:09:50,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:50,471 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 18 states. [2019-08-05 11:09:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,652 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2019-08-05 11:09:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:50,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2019-08-05 11:09:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,654 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:50,654 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:50,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:09:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 73. [2019-08-05 11:09:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-08-05 11:09:50,663 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 61 [2019-08-05 11:09:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,663 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-08-05 11:09:50,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-08-05 11:09:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:50,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,664 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:50,664 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash 985299868, now seen corresponding path program 34 times [2019-08-05 11:09:50,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:50,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:50,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:09:50,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:50,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:50,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:50,989 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 19 states. [2019-08-05 11:09:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:51,330 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2019-08-05 11:09:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:51,331 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:51,332 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:51,332 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:51,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2019-08-05 11:09:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:09:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-08-05 11:09:51,337 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 61 [2019-08-05 11:09:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:51,338 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-08-05 11:09:51,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-08-05 11:09:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:09:51,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:51,339 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:51,339 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1746452451, now seen corresponding path program 35 times [2019-08-05 11:09:51,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:51,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:51,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 5 proven. 75 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-08-05 11:09:52,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:52,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:09:52,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:52,449 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 19 states. [2019-08-05 11:09:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,723 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2019-08-05 11:09:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:52,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-08-05 11:09:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,724 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:52,725 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:52,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:09:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2019-08-05 11:09:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-08-05 11:09:52,730 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 61 [2019-08-05 11:09:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,730 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-08-05 11:09:52,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-08-05 11:09:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:52,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,731 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:09:52,732 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 801372350, now seen corresponding path program 36 times [2019-08-05 11:09:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 100 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:09:52,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:52,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:52,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:52,943 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 21 states. [2019-08-05 11:09:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:53,241 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2019-08-05 11:09:53,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:53,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:09:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:53,251 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:09:53,251 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:09:53,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:09:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:09:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2019-08-05 11:09:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-08-05 11:09:53,256 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 69 [2019-08-05 11:09:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:53,257 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-08-05 11:09:53,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-08-05 11:09:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:53,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:53,258 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:09:53,258 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1094193602, now seen corresponding path program 37 times [2019-08-05 11:09:53,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:53,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:09:53,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 5 proven. 98 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:09:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:54,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:54,299 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 21 states. [2019-08-05 11:09:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:54,629 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2019-08-05 11:09:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:54,629 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:09:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:54,630 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:09:54,631 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:09:54,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:09:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:09:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2019-08-05 11:09:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-08-05 11:09:54,636 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 69 [2019-08-05 11:09:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:54,637 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-08-05 11:09:54,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-08-05 11:09:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:54,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:54,638 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:54,638 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2004835517, now seen corresponding path program 38 times [2019-08-05 11:09:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:54,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:09:54,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:09:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:54,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:54,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:54,824 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 21 states. [2019-08-05 11:09:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:55,101 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2019-08-05 11:09:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:55,101 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:09:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:55,103 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:09:55,103 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:09:55,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:09:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 73. [2019-08-05 11:09:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-08-05 11:09:55,108 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 69 [2019-08-05 11:09:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:55,108 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-08-05 11:09:55,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-08-05 11:09:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:55,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:55,109 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:09:55,110 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:55,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1419469758, now seen corresponding path program 39 times [2019-08-05 11:09:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 97 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:09:55,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:55,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:09:55,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:09:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:09:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:55,982 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 20 states. [2019-08-05 11:09:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,159 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-08-05 11:09:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:56,161 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:09:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,162 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:09:56,162 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:56,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:09:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 85. [2019-08-05 11:09:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-08-05 11:09:56,167 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 69 [2019-08-05 11:09:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,167 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-08-05 11:09:56,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:09:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-08-05 11:09:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:56,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:56,169 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:09:56,169 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:56,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1791617980, now seen corresponding path program 40 times [2019-08-05 11:09:56,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:56,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:56,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:09:56,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:09:56,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:09:56,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:09:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:56,565 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 20 states. [2019-08-05 11:09:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,744 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2019-08-05 11:09:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:56,744 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:09:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,746 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:09:56,746 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:09:56,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:09:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:09:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 93. [2019-08-05 11:09:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:09:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-08-05 11:09:56,751 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 69 [2019-08-05 11:09:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,752 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-08-05 11:09:56,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:09:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-08-05 11:09:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:56,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:56,753 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:56,753 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:56,754 INFO L82 PathProgramCache]: Analyzing trace with hash 223531581, now seen corresponding path program 41 times [2019-08-05 11:09:56,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:56,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:09:56,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:09:57,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:57,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:57,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:57,132 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 21 states. [2019-08-05 11:09:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:57,392 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2019-08-05 11:09:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:57,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:09:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:57,394 INFO L225 Difference]: With dead ends: 125 [2019-08-05 11:09:57,394 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:09:57,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:09:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-08-05 11:09:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-08-05 11:09:57,399 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 69 [2019-08-05 11:09:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:57,399 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-08-05 11:09:57,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-08-05 11:09:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:57,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:57,401 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:57,401 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 588154813, now seen corresponding path program 42 times [2019-08-05 11:09:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:57,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:09:57,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 104 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:09:58,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:58,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:09:58,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:09:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:09:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:58,982 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 21 states. [2019-08-05 11:09:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:59,288 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2019-08-05 11:09:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:59,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:09:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:59,290 INFO L225 Difference]: With dead ends: 129 [2019-08-05 11:09:59,290 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 11:09:59,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:09:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 11:09:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2019-08-05 11:09:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:09:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-08-05 11:09:59,295 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 69 [2019-08-05 11:09:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:59,296 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-08-05 11:09:59,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:09:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-08-05 11:09:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:59,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,297 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:09:59,297 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1307411139, now seen corresponding path program 43 times [2019-08-05 11:09:59,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:59,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:59,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 1 proven. 101 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:09:59,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:09:59,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:09:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:09:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:59,550 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 20 states. [2019-08-05 11:09:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:59,765 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2019-08-05 11:09:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:59,766 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:09:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:59,767 INFO L225 Difference]: With dead ends: 133 [2019-08-05 11:09:59,767 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:09:59,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:09:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:09:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 69. [2019-08-05 11:09:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-08-05 11:09:59,773 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 69 [2019-08-05 11:09:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:59,773 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-08-05 11:09:59,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:09:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2019-08-05 11:09:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:09:59,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:59,774 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:59,775 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:59,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1618827845, now seen corresponding path program 44 times [2019-08-05 11:09:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:59,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:59,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-08-05 11:09:59,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:09:59,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:09:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:09:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:59,970 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 20 states. [2019-08-05 11:10:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:00,499 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2019-08-05 11:10:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:10:00,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:10:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:00,500 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:10:00,500 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:10:00,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:10:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:10:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2019-08-05 11:10:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:10:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2019-08-05 11:10:00,506 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 69 [2019-08-05 11:10:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:00,506 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2019-08-05 11:10:00,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:10:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2019-08-05 11:10:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:00,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:00,507 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:00,507 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1765910210, now seen corresponding path program 45 times [2019-08-05 11:10:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:00,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:10:00,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:10:00,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:00,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:10:00,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:10:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:10:00,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:10:00,794 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 20 states. [2019-08-05 11:10:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,026 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2019-08-05 11:10:01,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:10:01,027 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:10:01,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,028 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:01,028 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:01,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 105. [2019-08-05 11:10:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:10:01,034 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 69 [2019-08-05 11:10:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,034 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:10:01,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:10:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:10:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:01,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,035 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:01,036 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1333118909, now seen corresponding path program 46 times [2019-08-05 11:10:01,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:10:01,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:01,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:01,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:01,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:01,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:01,831 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 21 states. [2019-08-05 11:10:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,091 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2019-08-05 11:10:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:02,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,093 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:02,093 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:02,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:10:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2019-08-05 11:10:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-08-05 11:10:02,099 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 69 [2019-08-05 11:10:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,099 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-08-05 11:10:02,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-08-05 11:10:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:02,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,100 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:02,101 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash -422889668, now seen corresponding path program 47 times [2019-08-05 11:10:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 1 proven. 108 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-08-05 11:10:02,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:10:02,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:10:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:10:02,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:10:02,268 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 20 states. [2019-08-05 11:10:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:02,523 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2019-08-05 11:10:02,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:10:02,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:10:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:02,526 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:02,526 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:02,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:10:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2019-08-05 11:10:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:10:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-08-05 11:10:02,531 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 69 [2019-08-05 11:10:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:02,531 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-08-05 11:10:02,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:10:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-08-05 11:10:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:02,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:02,533 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:02,533 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1697742141, now seen corresponding path program 48 times [2019-08-05 11:10:02,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:02,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:02,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:10:03,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:03,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:03,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:03,177 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 21 states. [2019-08-05 11:10:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:03,598 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2019-08-05 11:10:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:03,599 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:03,600 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:03,601 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:03,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 97. [2019-08-05 11:10:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-08-05 11:10:03,606 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 69 [2019-08-05 11:10:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:03,606 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-08-05 11:10:03,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-08-05 11:10:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:03,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:03,607 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:03,607 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1472676284, now seen corresponding path program 49 times [2019-08-05 11:10:03,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:03,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:03,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 111 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:10:03,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:03,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:03,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:03,798 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 21 states. [2019-08-05 11:10:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,044 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2019-08-05 11:10:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:04,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,046 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:04,047 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:04,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2019-08-05 11:10:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:10:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-08-05 11:10:04,052 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 69 [2019-08-05 11:10:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,053 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-08-05 11:10:04,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-08-05 11:10:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:04,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,054 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:04,054 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash -197823811, now seen corresponding path program 50 times [2019-08-05 11:10:04,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 6 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:10:04,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:04,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:04,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:04,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:04,529 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 21 states. [2019-08-05 11:10:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,845 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2019-08-05 11:10:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:04,846 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,847 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:10:04,847 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:10:04,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:10:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2019-08-05 11:10:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2019-08-05 11:10:04,851 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 69 [2019-08-05 11:10:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,852 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2019-08-05 11:10:04,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2019-08-05 11:10:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:04,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,853 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:04,853 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1393761988, now seen corresponding path program 51 times [2019-08-05 11:10:04,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:10:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:05,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:05,057 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 21 states. [2019-08-05 11:10:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:05,350 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2019-08-05 11:10:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:05,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:05,352 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:05,352 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:05,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-08-05 11:10:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:10:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2019-08-05 11:10:05,356 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 69 [2019-08-05 11:10:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:05,357 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-08-05 11:10:05,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2019-08-05 11:10:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:05,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:05,358 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:05,358 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1108053052, now seen corresponding path program 52 times [2019-08-05 11:10:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:05,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:05,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 110 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:10:05,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:05,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:05,798 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 21 states. [2019-08-05 11:10:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:06,061 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2019-08-05 11:10:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:06,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:06,063 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:06,064 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:06,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 93. [2019-08-05 11:10:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:10:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:10:06,069 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 69 [2019-08-05 11:10:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:06,069 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:10:06,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:10:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:06,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:06,070 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:06,070 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1990976067, now seen corresponding path program 53 times [2019-08-05 11:10:06,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:06,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:10:06,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:10:06,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:10:06,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:10:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:10:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:10:06,221 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 20 states. [2019-08-05 11:10:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:06,418 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2019-08-05 11:10:06,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:10:06,421 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-08-05 11:10:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:06,423 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:06,423 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:06,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:10:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 81. [2019-08-05 11:10:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:10:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-08-05 11:10:06,428 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 69 [2019-08-05 11:10:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:06,428 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-08-05 11:10:06,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:10:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-08-05 11:10:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:06,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:06,429 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:06,429 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1405610308, now seen corresponding path program 54 times [2019-08-05 11:10:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:06,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:06,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 4 proven. 109 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-08-05 11:10:06,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:06,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:06,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:06,765 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 21 states. [2019-08-05 11:10:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,091 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2019-08-05 11:10:07,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:07,091 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,093 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:10:07,093 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:10:07,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:10:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2019-08-05 11:10:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:10:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:10:07,097 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 69 [2019-08-05 11:10:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,098 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:10:07,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:10:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:07,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,099 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:07,099 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash -209672131, now seen corresponding path program 55 times [2019-08-05 11:10:07,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:10:07,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:07,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:07,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:07,293 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 21 states. [2019-08-05 11:10:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,588 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2019-08-05 11:10:07,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:07,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,590 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:07,590 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:07,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2019-08-05 11:10:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:10:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-08-05 11:10:07,594 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 69 [2019-08-05 11:10:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,595 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-08-05 11:10:07,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-08-05 11:10:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:10:07,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,596 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:07,596 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1685893821, now seen corresponding path program 56 times [2019-08-05 11:10:07,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 3 proven. 103 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:10:07,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:07,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:10:07,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:10:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:10:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:10:07,840 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 21 states. [2019-08-05 11:10:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,132 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2019-08-05 11:10:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:10:08,132 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 11:10:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,133 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:10:08,133 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:10:08,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:10:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:10:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 77. [2019-08-05 11:10:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:10:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-08-05 11:10:08,137 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 69 [2019-08-05 11:10:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,138 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-08-05 11:10:08,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:10:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-08-05 11:10:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:08,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,138 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:08,139 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1257362209, now seen corresponding path program 57 times [2019-08-05 11:10:08,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 3 proven. 122 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-08-05 11:10:08,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:08,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:08,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:08,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:08,466 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 22 states. [2019-08-05 11:10:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:08,619 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2019-08-05 11:10:08,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:08,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:08,621 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:08,621 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:08,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:10:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2019-08-05 11:10:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2019-08-05 11:10:08,625 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 77 [2019-08-05 11:10:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:08,626 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2019-08-05 11:10:08,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2019-08-05 11:10:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:08,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:08,627 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:08,627 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1837165988, now seen corresponding path program 58 times [2019-08-05 11:10:08,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:08,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:08,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-08-05 11:10:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:09,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:09,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:09,006 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 22 states. [2019-08-05 11:10:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:09,211 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2019-08-05 11:10:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:09,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:09,215 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:09,215 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:09,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2019-08-05 11:10:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:10:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:10:09,220 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 77 [2019-08-05 11:10:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:09,221 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:10:09,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:10:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:09,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:09,222 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:09,222 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 29806174, now seen corresponding path program 59 times [2019-08-05 11:10:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:09,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:09,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 4 proven. 127 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:09,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:09,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:09,446 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 23 states. [2019-08-05 11:10:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,032 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2019-08-05 11:10:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:10,033 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,034 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:10,034 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:10,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:10:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:10:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:10:10,039 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 77 [2019-08-05 11:10:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,039 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:10:10,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:10:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:10,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,040 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:10,041 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash -623639586, now seen corresponding path program 60 times [2019-08-05 11:10:10,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 5 proven. 127 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:10:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:10,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:10,287 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 23 states. [2019-08-05 11:10:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:10,620 INFO L93 Difference]: Finished difference Result 157 states and 183 transitions. [2019-08-05 11:10:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:10,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:10,622 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:10,622 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:10,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:10,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 109. [2019-08-05 11:10:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:10:10,626 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:10:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:10,626 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:10:10,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:10:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:10,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:10,627 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:10,628 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 678000990, now seen corresponding path program 61 times [2019-08-05 11:10:10,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:10,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:10,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 6 proven. 125 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:10,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:10,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:10,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:10,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:10,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:10,981 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 23 states. [2019-08-05 11:10:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,286 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2019-08-05 11:10:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:11,287 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,288 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:10:11,288 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:10:11,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:10:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2019-08-05 11:10:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:10:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2019-08-05 11:10:11,293 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 77 [2019-08-05 11:10:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,294 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2019-08-05 11:10:11,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2019-08-05 11:10:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:11,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,295 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:11,295 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1170632925, now seen corresponding path program 62 times [2019-08-05 11:10:11,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 1 proven. 130 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-08-05 11:10:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:11,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:11,547 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 22 states. [2019-08-05 11:10:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,005 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2019-08-05 11:10:12,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:12,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,007 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:12,007 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:12,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 109. [2019-08-05 11:10:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:10:12,013 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:10:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,013 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:10:12,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:10:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:12,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,014 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,014 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash -131007651, now seen corresponding path program 63 times [2019-08-05 11:10:12,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:12,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:12,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:12,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:12,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:12,330 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 23 states. [2019-08-05 11:10:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:12,647 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2019-08-05 11:10:12,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:12,648 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:12,649 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:12,649 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:12,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:10:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:10:12,653 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 77 [2019-08-05 11:10:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:12,653 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:10:12,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:10:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:12,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:12,654 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:12,654 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1965169373, now seen corresponding path program 64 times [2019-08-05 11:10:12,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:12,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:12,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:12,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:12,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:12,907 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 23 states. [2019-08-05 11:10:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:13,205 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2019-08-05 11:10:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:13,205 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:13,206 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:13,207 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:13,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 89. [2019-08-05 11:10:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:10:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-08-05 11:10:13,211 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 77 [2019-08-05 11:10:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:13,211 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-08-05 11:10:13,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-08-05 11:10:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:13,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:13,212 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:13,212 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash 522438109, now seen corresponding path program 65 times [2019-08-05 11:10:13,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:13,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:13,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 3 proven. 133 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:14,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:14,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:14,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:14,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:14,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:14,568 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 23 states. [2019-08-05 11:10:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:14,859 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-08-05 11:10:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:14,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:14,861 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:14,861 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:14,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2019-08-05 11:10:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:10:14,865 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 77 [2019-08-05 11:10:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:14,865 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:10:14,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:10:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:14,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:14,866 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:14,866 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -957302434, now seen corresponding path program 66 times [2019-08-05 11:10:14,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:14,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:14,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 3 proven. 128 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:15,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:15,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:15,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:15,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:15,319 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 23 states. [2019-08-05 11:10:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,633 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2019-08-05 11:10:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:15,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,635 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:15,635 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:15,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2019-08-05 11:10:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:10:15,640 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:10:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,641 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:10:15,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:10:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:15,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,641 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:15,641 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash 344338142, now seen corresponding path program 67 times [2019-08-05 11:10:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 5 proven. 126 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:15,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:15,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:15,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:15,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:15,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:15,996 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 23 states. [2019-08-05 11:10:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,365 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2019-08-05 11:10:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:16,366 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:16,367 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:10:16,367 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:10:16,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:10:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2019-08-05 11:10:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:10:16,372 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 77 [2019-08-05 11:10:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:16,372 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:10:16,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:10:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:16,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:16,374 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:16,374 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1631506525, now seen corresponding path program 68 times [2019-08-05 11:10:16,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:16,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:16,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:16,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:16,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:16,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:16,565 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 23 states. [2019-08-05 11:10:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:16,999 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-08-05 11:10:17,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:17,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:17,000 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:17,001 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:17,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 97. [2019-08-05 11:10:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:10:17,004 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 77 [2019-08-05 11:10:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:17,004 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:10:17,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:10:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:17,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:17,005 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:17,005 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash -764730274, now seen corresponding path program 69 times [2019-08-05 11:10:17,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:17,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:17,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 2 proven. 124 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:10:17,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:17,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:17,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:17,407 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 22 states. [2019-08-05 11:10:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:17,611 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2019-08-05 11:10:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:17,612 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:17,613 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:10:17,613 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:10:17,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:10:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 77. [2019-08-05 11:10:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:10:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-08-05 11:10:17,617 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 77 [2019-08-05 11:10:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:17,618 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-08-05 11:10:17,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-08-05 11:10:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:17,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:17,619 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:17,619 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1415778594, now seen corresponding path program 70 times [2019-08-05 11:10:17,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:17,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:17,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 4 proven. 127 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:18,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:18,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:18,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:18,855 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 23 states. [2019-08-05 11:10:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,179 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2019-08-05 11:10:19,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:19,180 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,181 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:10:19,182 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:10:19,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:10:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2019-08-05 11:10:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:10:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2019-08-05 11:10:19,187 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 77 [2019-08-05 11:10:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,187 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2019-08-05 11:10:19,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2019-08-05 11:10:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:19,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,188 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:19,188 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -398674725, now seen corresponding path program 71 times [2019-08-05 11:10:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:10:19,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:19,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:19,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:19,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:19,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:19,558 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 22 states. [2019-08-05 11:10:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,830 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2019-08-05 11:10:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:19,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,832 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:10:19,832 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:10:19,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:10:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:10:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2019-08-05 11:10:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:10:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-08-05 11:10:19,836 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 77 [2019-08-05 11:10:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,836 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-08-05 11:10:19,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-08-05 11:10:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:19,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,837 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:19,838 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,838 INFO L82 PathProgramCache]: Analyzing trace with hash -114138018, now seen corresponding path program 72 times [2019-08-05 11:10:19,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 6 proven. 125 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:20,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:20,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:20,085 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 23 states. [2019-08-05 11:10:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:20,390 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2019-08-05 11:10:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:20,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:20,392 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:10:20,392 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:10:20,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:10:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2019-08-05 11:10:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:10:20,396 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 77 [2019-08-05 11:10:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:20,397 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:10:20,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:10:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:20,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:20,398 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:20,398 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1173030365, now seen corresponding path program 73 times [2019-08-05 11:10:20,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:20,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:20,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:20,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:20,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:20,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:20,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:20,622 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 23 states. [2019-08-05 11:10:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:21,149 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2019-08-05 11:10:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:21,150 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:21,152 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:10:21,152 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:10:21,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:10:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:10:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2019-08-05 11:10:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:10:21,158 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:10:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:21,158 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:10:21,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:10:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:21,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:21,159 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:21,159 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1685843108, now seen corresponding path program 74 times [2019-08-05 11:10:21,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:21,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 1 proven. 139 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-08-05 11:10:21,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:21,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:21,651 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 22 states. [2019-08-05 11:10:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,157 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2019-08-05 11:10:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:22,157 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,158 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:10:22,158 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:10:22,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:10:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 105. [2019-08-05 11:10:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:10:22,161 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 77 [2019-08-05 11:10:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,161 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:10:22,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:10:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:22,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,162 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:22,162 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1307483612, now seen corresponding path program 75 times [2019-08-05 11:10:22,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 143 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:10:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:22,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:22,415 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 23 states. [2019-08-05 11:10:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,689 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:10:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:22,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,691 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:22,691 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:22,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 101. [2019-08-05 11:10:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:10:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2019-08-05 11:10:22,695 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 77 [2019-08-05 11:10:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,695 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2019-08-05 11:10:22,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2019-08-05 11:10:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:22,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,696 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:22,696 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1223206434, now seen corresponding path program 76 times [2019-08-05 11:10:22,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:22,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:22,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 8 proven. 123 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-08-05 11:10:22,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:22,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:22,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:22,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:22,876 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 23 states. [2019-08-05 11:10:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,159 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2019-08-05 11:10:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:23,159 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,161 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:23,161 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:23,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2019-08-05 11:10:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:10:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:10:23,165 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 77 [2019-08-05 11:10:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,166 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:10:23,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:10:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:23,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,167 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:23,167 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 63961949, now seen corresponding path program 77 times [2019-08-05 11:10:23,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 7 proven. 130 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:10:23,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:23,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:23,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:23,454 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 23 states. [2019-08-05 11:10:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:23,737 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2019-08-05 11:10:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:23,737 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:23,739 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:23,739 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:23,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 105. [2019-08-05 11:10:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:10:23,743 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 77 [2019-08-05 11:10:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:23,743 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:10:23,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:10:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:23,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:23,744 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:23,745 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash -589483811, now seen corresponding path program 78 times [2019-08-05 11:10:23,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 131 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:10:24,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:24,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:24,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:24,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:24,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:24,515 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 23 states. [2019-08-05 11:10:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:24,763 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2019-08-05 11:10:24,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:24,763 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:24,765 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:24,765 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:24,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:10:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:10:24,769 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 77 [2019-08-05 11:10:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:24,769 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:10:24,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:10:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:24,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:24,770 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:24,770 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:24,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1960929372, now seen corresponding path program 79 times [2019-08-05 11:10:24,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:24,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:24,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:10:24,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:24,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:24,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:24,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:24,939 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 23 states. [2019-08-05 11:10:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,198 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2019-08-05 11:10:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:25,198 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,200 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:10:25,200 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:10:25,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:10:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2019-08-05 11:10:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:10:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-08-05 11:10:25,204 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 77 [2019-08-05 11:10:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,204 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-08-05 11:10:25,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-08-05 11:10:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:25,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,205 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:25,206 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 712156765, now seen corresponding path program 80 times [2019-08-05 11:10:25,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 7 proven. 129 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:25,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:25,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:25,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:25,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:25,500 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 23 states. [2019-08-05 11:10:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:25,818 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:10:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:25,819 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:25,820 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:25,820 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:25,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2019-08-05 11:10:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:10:25,824 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 77 [2019-08-05 11:10:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:25,824 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:10:25,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:10:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:25,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:25,825 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:25,825 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1999325148, now seen corresponding path program 81 times [2019-08-05 11:10:25,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:25,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:25,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 6 proven. 139 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:10:26,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:26,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:26,098 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 23 states. [2019-08-05 11:10:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,357 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2019-08-05 11:10:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:26,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,359 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:10:26,359 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:10:26,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:10:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2019-08-05 11:10:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:10:26,364 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:10:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,364 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:10:26,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:10:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:26,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,365 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:26,366 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash 673760989, now seen corresponding path program 82 times [2019-08-05 11:10:26,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 2 proven. 129 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-08-05 11:10:26,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:26,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:26,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:26,535 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 22 states. [2019-08-05 11:10:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,773 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2019-08-05 11:10:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:26,773 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,774 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:10:26,775 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:10:26,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:10:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:10:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 93. [2019-08-05 11:10:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:10:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:10:26,779 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 77 [2019-08-05 11:10:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,779 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:10:26,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:10:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:26,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,780 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:26,780 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash 181129054, now seen corresponding path program 83 times [2019-08-05 11:10:26,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 3 proven. 123 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-08-05 11:10:27,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:10:27,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:10:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:10:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:10:27,148 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 22 states. [2019-08-05 11:10:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:27,434 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2019-08-05 11:10:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:10:27,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-08-05 11:10:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:27,436 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:10:27,436 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:10:27,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:10:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:10:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 109. [2019-08-05 11:10:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-08-05 11:10:27,440 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 77 [2019-08-05 11:10:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:27,440 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-08-05 11:10:27,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:10:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-08-05 11:10:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:27,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:27,441 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:27,441 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1468297437, now seen corresponding path program 84 times [2019-08-05 11:10:27,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:27,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:27,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:27,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:27,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:27,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:27,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:27,621 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 23 states. [2019-08-05 11:10:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,124 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2019-08-05 11:10:28,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:28,136 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,138 INFO L225 Difference]: With dead ends: 181 [2019-08-05 11:10:28,138 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 11:10:28,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:10:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 11:10:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2019-08-05 11:10:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:10:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-08-05 11:10:28,142 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 77 [2019-08-05 11:10:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,142 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-08-05 11:10:28,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-08-05 11:10:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:28,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,143 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:28,143 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 814851677, now seen corresponding path program 85 times [2019-08-05 11:10:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 132 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:10:28,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:28,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:28,390 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 23 states. [2019-08-05 11:10:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:28,901 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2019-08-05 11:10:28,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:28,902 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:28,903 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:28,903 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:28,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:10:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:10:28,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:10:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:28,907 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:10:28,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:10:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:28,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:28,908 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:28,908 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2116492253, now seen corresponding path program 86 times [2019-08-05 11:10:28,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:28,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:28,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:29,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:29,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:29,171 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 23 states. [2019-08-05 11:10:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,475 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2019-08-05 11:10:29,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:29,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,476 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:29,477 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:29,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-08-05 11:10:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:10:29,480 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 77 [2019-08-05 11:10:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,481 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:10:29,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:10:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:29,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,482 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:29,482 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash -891306660, now seen corresponding path program 87 times [2019-08-05 11:10:29,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 5 proven. 140 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:10:29,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:29,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:29,678 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 23 states. [2019-08-05 11:10:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:29,950 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2019-08-05 11:10:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:29,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:29,952 INFO L225 Difference]: With dead ends: 161 [2019-08-05 11:10:29,952 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 11:10:29,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 11:10:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 93. [2019-08-05 11:10:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:10:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-08-05 11:10:29,955 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 77 [2019-08-05 11:10:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:29,956 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-08-05 11:10:29,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-08-05 11:10:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:29,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:29,956 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:29,957 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 481188829, now seen corresponding path program 88 times [2019-08-05 11:10:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:29,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:29,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 3 proven. 133 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:30,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:30,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:30,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:30,325 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 23 states. [2019-08-05 11:10:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,655 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2019-08-05 11:10:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:30,656 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,657 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:30,657 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:30,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 101. [2019-08-05 11:10:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:10:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-08-05 11:10:30,661 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 77 [2019-08-05 11:10:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,661 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-08-05 11:10:30,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-08-05 11:10:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:30,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,662 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:30,662 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1224969508, now seen corresponding path program 89 times [2019-08-05 11:10:30,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 4 proven. 141 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-08-05 11:10:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:31,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:31,080 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 23 states. [2019-08-05 11:10:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,398 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2019-08-05 11:10:31,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:31,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,400 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:31,400 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:31,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 105. [2019-08-05 11:10:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:10:31,404 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 77 [2019-08-05 11:10:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,404 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:10:31,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:10:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:10:31,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,405 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:31,405 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1782829405, now seen corresponding path program 90 times [2019-08-05 11:10:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 5 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-08-05 11:10:31,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:10:31,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:10:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:10:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:10:31,568 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 23 states. [2019-08-05 11:10:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:31,882 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2019-08-05 11:10:31,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:10:31,883 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2019-08-05 11:10:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:31,884 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:31,884 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:31,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 85. [2019-08-05 11:10:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:10:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-08-05 11:10:31,887 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 77 [2019-08-05 11:10:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:31,887 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-08-05 11:10:31,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:10:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-08-05 11:10:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:31,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:31,888 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:31,888 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:31,889 INFO L82 PathProgramCache]: Analyzing trace with hash 412531196, now seen corresponding path program 91 times [2019-08-05 11:10:31,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:31,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:31,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-08-05 11:10:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:32,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:32,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:32,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:32,179 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 24 states. [2019-08-05 11:10:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:32,537 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2019-08-05 11:10:32,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:32,538 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:32,539 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:10:32,539 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:10:32,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:10:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:10:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2019-08-05 11:10:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2019-08-05 11:10:32,543 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 85 [2019-08-05 11:10:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:32,543 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2019-08-05 11:10:32,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2019-08-05 11:10:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:32,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:32,544 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:32,544 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:32,544 INFO L82 PathProgramCache]: Analyzing trace with hash 650110333, now seen corresponding path program 92 times [2019-08-05 11:10:32,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:32,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:32,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 1 proven. 163 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-08-05 11:10:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:32,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:32,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:32,744 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 24 states. [2019-08-05 11:10:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,033 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:10:33,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:33,033 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,035 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:10:33,035 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:10:33,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:10:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 105. [2019-08-05 11:10:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2019-08-05 11:10:33,039 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 85 [2019-08-05 11:10:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,039 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2019-08-05 11:10:33,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2019-08-05 11:10:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:33,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,040 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:33,040 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash 68743165, now seen corresponding path program 93 times [2019-08-05 11:10:33,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 2 proven. 168 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:33,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:33,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:33,281 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 25 states. [2019-08-05 11:10:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,583 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2019-08-05 11:10:33,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:33,583 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,585 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:10:33,585 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:10:33,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:10:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 101. [2019-08-05 11:10:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:10:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2019-08-05 11:10:33,588 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 85 [2019-08-05 11:10:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,589 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2019-08-05 11:10:33,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2019-08-05 11:10:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:33,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,589 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:10:33,589 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -784409857, now seen corresponding path program 94 times [2019-08-05 11:10:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 156 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:10:33,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:33,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:33,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:33,829 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 25 states. [2019-08-05 11:10:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:34,203 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-08-05 11:10:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:10:34,204 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:34,206 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:10:34,206 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:10:34,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:10:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 117. [2019-08-05 11:10:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:10:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:10:34,209 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:10:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:34,210 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:10:34,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:10:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:34,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:34,210 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:34,211 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 289028733, now seen corresponding path program 95 times [2019-08-05 11:10:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:34,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:34,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:34,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:34,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:34,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:34,438 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 25 states. [2019-08-05 11:10:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:34,734 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2019-08-05 11:10:34,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:34,734 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:34,735 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:10:34,736 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:10:34,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:10:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 125. [2019-08-05 11:10:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:10:34,740 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 85 [2019-08-05 11:10:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:34,740 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:10:34,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:10:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:34,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:34,741 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:10:34,741 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:34,741 INFO L82 PathProgramCache]: Analyzing trace with hash -203042689, now seen corresponding path program 96 times [2019-08-05 11:10:34,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:34,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:34,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 6 proven. 154 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:10:35,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:35,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:35,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:35,110 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 25 states. [2019-08-05 11:10:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:35,452 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2019-08-05 11:10:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:35,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:35,465 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:10:35,465 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:10:35,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:10:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 129. [2019-08-05 11:10:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:10:35,470 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 85 [2019-08-05 11:10:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:35,470 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:10:35,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:10:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:35,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:35,471 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:35,471 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:35,471 INFO L82 PathProgramCache]: Analyzing trace with hash -440621826, now seen corresponding path program 97 times [2019-08-05 11:10:35,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:35,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:35,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 158 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:35,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:35,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:35,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:35,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:35,747 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 25 states. [2019-08-05 11:10:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,091 INFO L93 Difference]: Finished difference Result 209 states and 244 transitions. [2019-08-05 11:10:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:36,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,093 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:10:36,093 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:10:36,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:10:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 117. [2019-08-05 11:10:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:10:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:10:36,098 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:10:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,099 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:10:36,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:10:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:36,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,100 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:10:36,100 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1885095423, now seen corresponding path program 98 times [2019-08-05 11:10:36,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 8 proven. 152 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-08-05 11:10:36,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:36,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:36,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:36,329 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 25 states. [2019-08-05 11:10:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:36,654 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:10:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:36,655 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:36,656 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:10:36,657 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:10:36,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:10:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:10:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 129. [2019-08-05 11:10:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:10:36,662 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 85 [2019-08-05 11:10:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:36,662 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:10:36,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:10:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:36,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:36,663 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:36,663 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:36,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1647516286, now seen corresponding path program 99 times [2019-08-05 11:10:36,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:36,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:36,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 7 proven. 158 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:10:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:36,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:36,877 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 25 states. [2019-08-05 11:10:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,174 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2019-08-05 11:10:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:37,175 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,176 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:10:37,176 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:10:37,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:37,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:10:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 121. [2019-08-05 11:10:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:10:37,180 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 85 [2019-08-05 11:10:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,180 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:10:37,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:10:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:37,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,181 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:37,181 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1427230718, now seen corresponding path program 100 times [2019-08-05 11:10:37,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:10:37,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:37,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:37,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:37,699 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 25 states. [2019-08-05 11:10:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,978 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2019-08-05 11:10:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:37,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,980 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:10:37,980 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:10:37,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:10:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 125. [2019-08-05 11:10:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:10:37,984 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:10:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,984 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:10:37,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:10:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:37,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,985 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:37,985 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash 526607870, now seen corresponding path program 101 times [2019-08-05 11:10:37,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 2 proven. 155 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-08-05 11:10:38,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:38,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:38,184 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 24 states. [2019-08-05 11:10:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,416 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:10:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:38,417 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,418 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:10:38,418 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:10:38,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:10:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:10:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 113. [2019-08-05 11:10:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:10:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-08-05 11:10:38,423 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 85 [2019-08-05 11:10:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,424 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-08-05 11:10:38,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-08-05 11:10:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:38,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,425 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:38,425 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1799109379, now seen corresponding path program 102 times [2019-08-05 11:10:38,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 4 proven. 166 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:38,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:38,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:38,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:38,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:38,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:38,646 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 25 states. [2019-08-05 11:10:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:38,963 INFO L93 Difference]: Finished difference Result 197 states and 230 transitions. [2019-08-05 11:10:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:38,964 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:38,965 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:10:38,966 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:10:38,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:10:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 125. [2019-08-05 11:10:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:10:38,969 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:10:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:38,969 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:10:38,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:10:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:38,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:38,970 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:38,970 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2008597886, now seen corresponding path program 103 times [2019-08-05 11:10:38,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:38,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:38,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 7 proven. 156 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:39,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:39,164 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:10:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:39,575 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-08-05 11:10:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:39,576 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:39,577 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:10:39,577 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:10:39,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:10:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2019-08-05 11:10:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:10:39,582 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:10:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:39,582 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:10:39,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:10:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:39,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:39,583 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:39,583 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1561530242, now seen corresponding path program 104 times [2019-08-05 11:10:39,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:39,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:39,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 158 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:39,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:39,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:39,820 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:10:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,170 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2019-08-05 11:10:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:40,170 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,171 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:10:40,171 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:10:40,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:10:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2019-08-05 11:10:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:10:40,175 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:10:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,175 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:10:40,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:10:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:40,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,176 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:40,176 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1771018749, now seen corresponding path program 105 times [2019-08-05 11:10:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 164 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:40,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:40,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:40,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:40,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:40,366 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:10:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:40,667 INFO L93 Difference]: Finished difference Result 193 states and 225 transitions. [2019-08-05 11:10:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:40,668 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:40,669 INFO L225 Difference]: With dead ends: 193 [2019-08-05 11:10:40,669 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 11:10:40,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 11:10:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 105. [2019-08-05 11:10:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:10:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2019-08-05 11:10:40,672 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 85 [2019-08-05 11:10:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:40,673 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2019-08-05 11:10:40,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2019-08-05 11:10:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:40,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:40,673 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:10:40,674 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash -333300865, now seen corresponding path program 106 times [2019-08-05 11:10:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:40,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:40,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 3 proven. 151 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:40,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:40,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:40,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:40,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:40,876 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 24 states. [2019-08-05 11:10:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,078 INFO L93 Difference]: Finished difference Result 177 states and 202 transitions. [2019-08-05 11:10:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:41,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,079 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:41,080 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:41,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:10:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2019-08-05 11:10:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:10:41,083 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 85 [2019-08-05 11:10:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,083 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:10:41,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:10:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:41,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,084 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:41,084 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2142897410, now seen corresponding path program 107 times [2019-08-05 11:10:41,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 3 proven. 160 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:41,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:41,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:41,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:41,311 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 25 states. [2019-08-05 11:10:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,653 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2019-08-05 11:10:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:41,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,655 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:10:41,655 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:10:41,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:10:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 109. [2019-08-05 11:10:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-08-05 11:10:41,658 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 85 [2019-08-05 11:10:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,659 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-08-05 11:10:41,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-08-05 11:10:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:41,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,660 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:41,660 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -570880002, now seen corresponding path program 108 times [2019-08-05 11:10:41,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 159 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:42,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:42,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:42,095 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 25 states. [2019-08-05 11:10:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:42,696 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2019-08-05 11:10:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:42,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:42,697 INFO L225 Difference]: With dead ends: 169 [2019-08-05 11:10:42,697 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 11:10:42,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:10:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 11:10:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2019-08-05 11:10:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:10:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-08-05 11:10:42,700 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 85 [2019-08-05 11:10:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:42,700 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-08-05 11:10:42,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-08-05 11:10:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:42,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:42,701 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:42,701 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash -447377539, now seen corresponding path program 109 times [2019-08-05 11:10:42,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:42,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:42,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:42,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:42,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:42,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:42,931 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 25 states. [2019-08-05 11:10:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,225 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2019-08-05 11:10:43,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:43,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,226 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:10:43,227 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:10:43,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:10:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2019-08-05 11:10:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:10:43,230 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 85 [2019-08-05 11:10:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,230 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:10:43,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:10:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:43,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,231 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:43,231 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash -791165570, now seen corresponding path program 110 times [2019-08-05 11:10:43,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 160 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:10:43,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:43,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:43,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:43,460 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 25 states. [2019-08-05 11:10:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:43,761 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2019-08-05 11:10:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:43,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:43,762 INFO L225 Difference]: With dead ends: 157 [2019-08-05 11:10:43,762 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 11:10:43,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 11:10:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 109. [2019-08-05 11:10:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:10:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:10:43,766 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 85 [2019-08-05 11:10:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:43,767 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:10:43,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:10:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:43,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:43,768 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:43,768 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash -209798402, now seen corresponding path program 111 times [2019-08-05 11:10:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:43,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:43,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 157 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:43,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:43,989 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 25 states. [2019-08-05 11:10:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:44,344 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2019-08-05 11:10:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:44,345 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:44,346 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:10:44,346 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 11:10:44,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 11:10:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 85. [2019-08-05 11:10:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:10:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-08-05 11:10:44,349 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 85 [2019-08-05 11:10:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:44,349 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-08-05 11:10:44,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-08-05 11:10:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:44,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:44,350 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:10:44,350 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1934118657, now seen corresponding path program 112 times [2019-08-05 11:10:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:44,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:44,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 4 proven. 150 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:45,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:45,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:45,359 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 24 states. [2019-08-05 11:10:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,531 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-08-05 11:10:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:45,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,532 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:10:45,533 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:10:45,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:10:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:10:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2019-08-05 11:10:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:10:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-08-05 11:10:45,536 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 85 [2019-08-05 11:10:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,536 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-08-05 11:10:45,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-08-05 11:10:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:45,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,537 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:10:45,537 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash 967902459, now seen corresponding path program 113 times [2019-08-05 11:10:45,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-08-05 11:10:45,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:45,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:45,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:45,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:45,976 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 24 states. [2019-08-05 11:10:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,233 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2019-08-05 11:10:46,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:46,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,235 INFO L225 Difference]: With dead ends: 173 [2019-08-05 11:10:46,235 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 11:10:46,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:10:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 11:10:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 137. [2019-08-05 11:10:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:10:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:10:46,240 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:10:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,240 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:10:46,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:10:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:46,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,241 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:46,242 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2123269502, now seen corresponding path program 114 times [2019-08-05 11:10:46,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 5 proven. 158 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:46,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:46,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:46,441 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 25 states. [2019-08-05 11:10:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:46,828 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2019-08-05 11:10:46,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:10:46,829 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:46,830 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:10:46,830 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:10:46,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:10:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 129. [2019-08-05 11:10:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:10:46,834 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:10:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:46,834 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:10:46,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:10:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:46,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:46,835 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:46,835 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1902983934, now seen corresponding path program 115 times [2019-08-05 11:10:46,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:46,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:46,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 159 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:10:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:47,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:47,031 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:10:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:47,355 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 11:10:47,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:47,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:47,357 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:47,358 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:47,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2019-08-05 11:10:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:10:47,361 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 85 [2019-08-05 11:10:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:47,361 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:10:47,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:10:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:47,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:47,362 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:47,362 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1810616194, now seen corresponding path program 116 times [2019-08-05 11:10:47,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 7 proven. 156 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:47,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:47,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:47,864 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 25 states. [2019-08-05 11:10:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,221 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 11:10:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:48,221 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,222 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:48,222 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:48,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2019-08-05 11:10:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:10:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2019-08-05 11:10:48,227 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 85 [2019-08-05 11:10:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,227 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2019-08-05 11:10:48,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2019-08-05 11:10:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:48,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,228 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:48,229 INFO L418 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1205481596, now seen corresponding path program 117 times [2019-08-05 11:10:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 1 proven. 174 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-08-05 11:10:48,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:48,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:48,388 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 24 states. [2019-08-05 11:10:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:48,691 INFO L93 Difference]: Finished difference Result 205 states and 234 transitions. [2019-08-05 11:10:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:48,692 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:48,693 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:10:48,693 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:10:48,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:10:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2019-08-05 11:10:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:10:48,697 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 85 [2019-08-05 11:10:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:48,697 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:10:48,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:10:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:48,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:48,698 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:48,698 INFO L418 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:48,699 INFO L82 PathProgramCache]: Analyzing trace with hash 624114428, now seen corresponding path program 118 times [2019-08-05 11:10:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:48,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:48,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 2 proven. 179 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:10:48,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:48,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:48,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:48,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:48,990 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 25 states. [2019-08-05 11:10:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,276 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 11:10:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:49,277 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,278 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:49,278 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:49,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 129. [2019-08-05 11:10:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:10:49,282 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:10:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,282 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:10:49,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:10:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:49,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,283 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:49,283 INFO L418 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash 844399996, now seen corresponding path program 119 times [2019-08-05 11:10:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:10:49,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:49,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:49,469 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:10:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,755 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2019-08-05 11:10:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:49,756 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,757 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:10:49,757 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:10:49,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:10:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 137. [2019-08-05 11:10:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:10:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:10:49,760 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:10:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,761 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:10:49,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:10:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:49,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,761 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:49,761 INFO L418 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2048195331, now seen corresponding path program 120 times [2019-08-05 11:10:49,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 164 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:49,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:49,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:49,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:49,957 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 25 states. [2019-08-05 11:10:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,279 INFO L93 Difference]: Finished difference Result 213 states and 247 transitions. [2019-08-05 11:10:50,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:50,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,280 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:10:50,280 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:10:50,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:10:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:10:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 121. [2019-08-05 11:10:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:10:50,284 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 85 [2019-08-05 11:10:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,284 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:10:50,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:10:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:50,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,285 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:50,285 INFO L418 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash 551252094, now seen corresponding path program 121 times [2019-08-05 11:10:50,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 8 proven. 157 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:10:50,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:50,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:50,471 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 25 states. [2019-08-05 11:10:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:50,816 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2019-08-05 11:10:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:50,816 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:50,817 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:10:50,817 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:10:50,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:10:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2019-08-05 11:10:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:10:50,821 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 85 [2019-08-05 11:10:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:50,822 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:10:50,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:10:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:50,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:50,822 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:50,822 INFO L418 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1081979133, now seen corresponding path program 122 times [2019-08-05 11:10:50,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:50,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:10:50,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-08-05 11:10:50,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:10:50,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:10:50,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:10:50,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:10:50,990 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 24 states. [2019-08-05 11:10:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,251 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2019-08-05 11:10:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:10:51,252 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:10:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,253 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:10:51,253 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:10:51,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:10:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 121. [2019-08-05 11:10:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:10:51,256 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 85 [2019-08-05 11:10:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,257 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:10:51,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:10:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:10:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:51,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,257 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:51,257 INFO L418 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1243738116, now seen corresponding path program 123 times [2019-08-05 11:10:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 4 proven. 177 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:10:51,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:51,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:51,501 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 25 states. [2019-08-05 11:10:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:51,891 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2019-08-05 11:10:51,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:51,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:51,893 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:10:51,893 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:10:51,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:10:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 133. [2019-08-05 11:10:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:10:51,896 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 85 [2019-08-05 11:10:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:51,896 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:10:51,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:10:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:51,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:51,897 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:51,897 INFO L418 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1132619262, now seen corresponding path program 124 times [2019-08-05 11:10:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:51,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:51,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 10 proven. 155 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-08-05 11:10:52,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:52,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:52,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:52,091 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 25 states. [2019-08-05 11:10:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:52,447 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2019-08-05 11:10:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:52,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:52,448 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:52,449 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:52,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2019-08-05 11:10:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:10:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:10:52,454 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:10:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:52,454 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:10:52,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:10:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:52,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:52,455 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:52,455 INFO L418 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 895040125, now seen corresponding path program 125 times [2019-08-05 11:10:52,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:52,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:52,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 9 proven. 163 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:10:53,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:53,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:53,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:53,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:53,029 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 25 states. [2019-08-05 11:10:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,305 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2019-08-05 11:10:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:53,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,306 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:53,306 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:53,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 125. [2019-08-05 11:10:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:10:53,310 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:10:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,311 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:10:53,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:10:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:53,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,311 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:53,311 INFO L418 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1074209922, now seen corresponding path program 126 times [2019-08-05 11:10:53,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 154 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:53,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:53,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:53,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:53,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:53,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:53,513 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:10:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,834 INFO L93 Difference]: Finished difference Result 209 states and 239 transitions. [2019-08-05 11:10:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:53,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,836 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:10:53,836 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:10:53,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:10:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:10:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2019-08-05 11:10:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:10:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:10:53,841 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 85 [2019-08-05 11:10:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,841 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:10:53,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:10:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:53,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,842 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:53,842 INFO L418 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1311789059, now seen corresponding path program 127 times [2019-08-05 11:10:53,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 8 proven. 164 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:10:54,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:54,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:54,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:54,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:54,043 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 25 states. [2019-08-05 11:10:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,332 INFO L93 Difference]: Finished difference Result 209 states and 242 transitions. [2019-08-05 11:10:54,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:54,333 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,334 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:10:54,334 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:10:54,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:10:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 129. [2019-08-05 11:10:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:10:54,337 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:10:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,337 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:10:54,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:10:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:54,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,338 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:54,338 INFO L418 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1006158979, now seen corresponding path program 128 times [2019-08-05 11:10:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:54,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:54,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:54,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:54,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:54,526 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:10:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:54,904 INFO L93 Difference]: Finished difference Result 221 states and 252 transitions. [2019-08-05 11:10:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:54,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:54,905 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:10:54,906 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:10:54,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:10:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2019-08-05 11:10:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:10:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:10:54,909 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 85 [2019-08-05 11:10:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:54,909 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:10:54,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:10:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:54,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:54,910 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:54,910 INFO L418 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1532074627, now seen corresponding path program 129 times [2019-08-05 11:10:54,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:54,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:54,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 7 proven. 165 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:10:55,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:55,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:55,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:55,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:55,120 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 25 states. [2019-08-05 11:10:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:55,421 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2019-08-05 11:10:55,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:55,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:55,423 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:10:55,423 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:10:55,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:10:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 129. [2019-08-05 11:10:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:10:55,426 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 85 [2019-08-05 11:10:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:55,427 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:10:55,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:10:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:55,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:55,427 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:55,427 INFO L418 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash -950707459, now seen corresponding path program 130 times [2019-08-05 11:10:55,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:55,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:55,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 8 proven. 162 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:55,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:55,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:55,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:55,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:55,699 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2019-08-05 11:10:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,118 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:10:56,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:56,119 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,120 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:10:56,120 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:10:56,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:10:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2019-08-05 11:10:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:10:56,124 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 85 [2019-08-05 11:10:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,124 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:10:56,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:10:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:56,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,124 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:56,125 INFO L418 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1587526147, now seen corresponding path program 131 times [2019-08-05 11:10:56,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:56,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:56,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:56,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:56,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:56,317 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 25 states. [2019-08-05 11:10:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:56,681 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2019-08-05 11:10:56,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:56,682 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:56,683 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:10:56,683 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:10:56,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:10:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 121. [2019-08-05 11:10:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:10:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:10:56,688 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 85 [2019-08-05 11:10:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:56,689 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:10:56,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:10:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:56,690 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:56,690 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:56,690 INFO L418 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1188286596, now seen corresponding path program 132 times [2019-08-05 11:10:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:56,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:56,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 7 proven. 174 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:10:57,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:57,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:57,045 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 25 states. [2019-08-05 11:10:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:57,402 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2019-08-05 11:10:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:57,402 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:57,403 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:10:57,403 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:10:57,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:10:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 101. [2019-08-05 11:10:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:10:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-08-05 11:10:57,407 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 85 [2019-08-05 11:10:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:57,407 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-08-05 11:10:57,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-08-05 11:10:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:57,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:57,407 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:10:57,408 INFO L418 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 107993724, now seen corresponding path program 133 times [2019-08-05 11:10:57,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:57,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:57,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 5 proven. 176 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:10:57,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:57,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:57,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:57,673 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 25 states. [2019-08-05 11:10:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,170 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2019-08-05 11:10:58,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:58,170 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,171 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:58,171 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:58,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:10:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 117. [2019-08-05 11:10:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:10:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:10:58,175 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:10:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,175 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:10:58,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:10:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:58,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,176 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:58,176 INFO L418 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash 345572861, now seen corresponding path program 134 times [2019-08-05 11:10:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 164 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:10:58,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:58,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:58,392 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 25 states. [2019-08-05 11:10:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:58,729 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2019-08-05 11:10:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:58,729 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:58,731 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:10:58,731 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:10:58,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:10:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 113. [2019-08-05 11:10:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:10:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:10:58,735 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 85 [2019-08-05 11:10:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:58,735 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:10:58,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:10:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:58,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:58,736 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:58,736 INFO L418 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -229038594, now seen corresponding path program 135 times [2019-08-05 11:10:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:58,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:58,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 159 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:58,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:58,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:58,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:58,957 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 25 states. [2019-08-05 11:10:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,330 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2019-08-05 11:10:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:10:59,331 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,332 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:59,332 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:59,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:10:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 129. [2019-08-05 11:10:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:10:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:10:59,336 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 85 [2019-08-05 11:10:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,336 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:10:59,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:10:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:59,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,337 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:10:59,337 INFO L418 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 352328574, now seen corresponding path program 136 times [2019-08-05 11:10:59,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 157 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:10:59,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:10:59,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:10:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:10:59,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:10:59,523 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 25 states. [2019-08-05 11:10:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:59,879 INFO L93 Difference]: Finished difference Result 217 states and 247 transitions. [2019-08-05 11:10:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:10:59,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:10:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:59,880 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:10:59,880 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:10:59,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:10:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:10:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2019-08-05 11:10:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:10:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:10:59,884 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 85 [2019-08-05 11:10:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:59,884 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:10:59,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:10:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:10:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:10:59,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:59,885 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:10:59,885 INFO L418 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash -235794307, now seen corresponding path program 137 times [2019-08-05 11:10:59,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:59,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:10:59,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:11:00,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:00,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:00,077 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 25 states. [2019-08-05 11:11:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,386 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2019-08-05 11:11:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:00,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,388 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:11:00,388 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:11:00,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:11:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:11:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129. [2019-08-05 11:11:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:11:00,392 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 85 [2019-08-05 11:11:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,392 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:11:00,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:11:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:00,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,393 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:00,393 INFO L418 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash -15508739, now seen corresponding path program 138 times [2019-08-05 11:11:00,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 4 proven. 166 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:11:00,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:00,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:00,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:00,584 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 25 states. [2019-08-05 11:11:00,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:00,922 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-08-05 11:11:00,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:00,923 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:00,924 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:11:00,925 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:11:00,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:11:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 137. [2019-08-05 11:11:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2019-08-05 11:11:00,929 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 85 [2019-08-05 11:11:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:00,930 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2019-08-05 11:11:00,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2019-08-05 11:11:00,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:00,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:00,931 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:00,931 INFO L418 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash 222070398, now seen corresponding path program 139 times [2019-08-05 11:11:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:00,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:11:00,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 3 proven. 154 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-08-05 11:11:01,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:11:01,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:11:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:11:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:11:01,239 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 24 states. [2019-08-05 11:11:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,445 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2019-08-05 11:11:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:11:01,446 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2019-08-05 11:11:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,447 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:11:01,447 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:11:01,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:11:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:11:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 117. [2019-08-05 11:11:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-08-05 11:11:01,451 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 85 [2019-08-05 11:11:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,451 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-08-05 11:11:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:11:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-08-05 11:11:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:01,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,451 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:01,452 INFO L418 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,452 INFO L82 PathProgramCache]: Analyzing trace with hash 114749437, now seen corresponding path program 140 times [2019-08-05 11:11:01,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:11:01,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:01,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:01,660 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 25 states. [2019-08-05 11:11:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,983 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2019-08-05 11:11:01,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:01,984 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,985 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:01,985 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:01,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:11:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 105. [2019-08-05 11:11:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:11:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2019-08-05 11:11:01,988 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 85 [2019-08-05 11:11:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,988 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2019-08-05 11:11:01,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2019-08-05 11:11:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:01,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,989 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:01,989 INFO L418 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1968577284, now seen corresponding path program 141 times [2019-08-05 11:11:01,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 6 proven. 175 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-08-05 11:11:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:02,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:02,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:02,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:02,189 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 25 states. [2019-08-05 11:11:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:02,507 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2019-08-05 11:11:02,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:02,508 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:02,509 INFO L225 Difference]: With dead ends: 177 [2019-08-05 11:11:02,509 INFO L226 Difference]: Without dead ends: 177 [2019-08-05 11:11:02,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:11:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-05 11:11:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 117. [2019-08-05 11:11:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:11:02,512 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 85 [2019-08-05 11:11:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:02,512 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:11:02,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:11:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:02,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:02,513 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:02,513 INFO L418 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1730998147, now seen corresponding path program 142 times [2019-08-05 11:11:02,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:02,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:02,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 7 proven. 163 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-08-05 11:11:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:02,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:02,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:02,702 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 25 states. [2019-08-05 11:11:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:03,307 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-08-05 11:11:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:03,308 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:03,309 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:03,309 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:03,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:11:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2019-08-05 11:11:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:11:03,312 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 85 [2019-08-05 11:11:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:03,312 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:11:03,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:11:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:03,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:03,313 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:03,313 INFO L418 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1982601981, now seen corresponding path program 143 times [2019-08-05 11:11:03,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:03,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:03,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 6 proven. 166 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:11:03,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:03,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:03,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:03,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:03,502 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 25 states. [2019-08-05 11:11:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:03,798 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:11:03,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:03,799 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:03,800 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:11:03,800 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:11:03,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:11:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:11:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 109. [2019-08-05 11:11:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2019-08-05 11:11:03,804 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 85 [2019-08-05 11:11:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:03,804 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2019-08-05 11:11:03,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2019-08-05 11:11:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:03,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:03,804 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:03,805 INFO L418 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:03,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2092079747, now seen corresponding path program 144 times [2019-08-05 11:11:03,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:03,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:03,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 7 proven. 165 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-08-05 11:11:03,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:03,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:03,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:03,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:03,998 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand 25 states. [2019-08-05 11:11:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:04,305 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2019-08-05 11:11:04,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:04,306 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:04,307 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:04,307 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:04,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:11:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 117. [2019-08-05 11:11:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2019-08-05 11:11:04,311 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 85 [2019-08-05 11:11:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:04,312 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2019-08-05 11:11:04,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2019-08-05 11:11:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:11:04,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:04,313 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:04,313 INFO L418 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1854500610, now seen corresponding path program 145 times [2019-08-05 11:11:04,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:04,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:04,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 8 proven. 155 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-08-05 11:11:04,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:04,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:11:04,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:11:04,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:11:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:11:04,689 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 25 states. [2019-08-05 11:11:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,015 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2019-08-05 11:11:05,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:11:05,016 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-08-05 11:11:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,017 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:05,017 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:05,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 93. [2019-08-05 11:11:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-08-05 11:11:05,020 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 85 [2019-08-05 11:11:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,021 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-08-05 11:11:05,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:11:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-08-05 11:11:05,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:05,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,022 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:05,022 INFO L418 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash -24681828, now seen corresponding path program 146 times [2019-08-05 11:11:05,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-08-05 11:11:05,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:05,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:05,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:05,643 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 26 states. [2019-08-05 11:11:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:05,898 INFO L93 Difference]: Finished difference Result 185 states and 214 transitions. [2019-08-05 11:11:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:05,898 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:05,900 INFO L225 Difference]: With dead ends: 185 [2019-08-05 11:11:05,900 INFO L226 Difference]: Without dead ends: 185 [2019-08-05 11:11:05,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:11:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-05 11:11:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2019-08-05 11:11:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-08-05 11:11:05,904 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 93 [2019-08-05 11:11:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:05,905 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-08-05 11:11:05,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-08-05 11:11:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:05,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:05,905 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:05,906 INFO L418 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1185987936, now seen corresponding path program 147 times [2019-08-05 11:11:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:05,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:05,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 4 proven. 182 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-08-05 11:11:06,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:06,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:06,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:06,146 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 26 states. [2019-08-05 11:11:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,321 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2019-08-05 11:11:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:06,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,323 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:11:06,323 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:11:06,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:11:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:11:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 145. [2019-08-05 11:11:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:06,328 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,329 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:06,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:06,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,329 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:06,329 INFO L418 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1015719139, now seen corresponding path program 148 times [2019-08-05 11:11:06,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 1 proven. 200 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-08-05 11:11:06,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:06,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:06,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:06,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:06,522 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 26 states. [2019-08-05 11:11:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,839 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2019-08-05 11:11:06,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:06,840 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,841 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:06,841 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:06,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=1298, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:11:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 141. [2019-08-05 11:11:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:11:06,845 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:11:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,845 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:11:06,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:11:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:06,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,846 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:06,846 INFO L418 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash -194950625, now seen corresponding path program 149 times [2019-08-05 11:11:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 5 proven. 189 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:07,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:07,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:07,991 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:11:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:08,734 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2019-08-05 11:11:08,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:11:08,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:08,735 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:08,736 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:08,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 133. [2019-08-05 11:11:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:08,740 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:08,740 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:08,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:08,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:08,741 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:08,741 INFO L418 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash -678330465, now seen corresponding path program 150 times [2019-08-05 11:11:08,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:08,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:08,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 6 proven. 191 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:11:08,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:08,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:08,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:08,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:08,964 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,310 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2019-08-05 11:11:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:09,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,311 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:11:09,311 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:11:09,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=1265, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:11:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:11:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 137. [2019-08-05 11:11:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:09,315 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,316 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:09,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:09,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,316 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:09,316 INFO L418 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1707734303, now seen corresponding path program 151 times [2019-08-05 11:11:09,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 7 proven. 187 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:09,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:09,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:09,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:09,555 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:09,945 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2019-08-05 11:11:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:09,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:09,946 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:11:09,947 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:11:09,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:11:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 141. [2019-08-05 11:11:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:11:09,951 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:11:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:09,951 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:11:09,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:11:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:09,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:09,952 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:09,952 INFO L418 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 893183389, now seen corresponding path program 152 times [2019-08-05 11:11:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:09,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:09,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 2 proven. 206 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:10,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:10,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:10,190 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 27 states. [2019-08-05 11:11:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,513 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2019-08-05 11:11:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:10,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,514 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:11:10,514 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:11:10,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:11:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 137. [2019-08-05 11:11:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:10,518 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,518 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:10,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:10,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,519 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:10,519 INFO L418 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1376563229, now seen corresponding path program 153 times [2019-08-05 11:11:10,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 3 proven. 205 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:10,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:10,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:10,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:10,739 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:11,052 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2019-08-05 11:11:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:11,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:11,053 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:11,053 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:11,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:11:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:11,058 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:11,058 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:11,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:11,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:11,060 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:11,060 INFO L418 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1596195682, now seen corresponding path program 154 times [2019-08-05 11:11:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:11,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:11,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:11,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:11,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:11,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:11,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:11,950 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,314 INFO L93 Difference]: Finished difference Result 245 states and 287 transitions. [2019-08-05 11:11:12,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:12,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,316 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:11:12,316 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:11:12,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:11:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:11:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 129. [2019-08-05 11:11:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:12,320 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,320 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:12,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:12,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,321 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:12,321 INFO L418 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1596902113, now seen corresponding path program 155 times [2019-08-05 11:11:12,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 8 proven. 189 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:11:12,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:12,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:12,548 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:12,945 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2019-08-05 11:11:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:12,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:12,946 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:11:12,947 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:11:12,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:11:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 141. [2019-08-05 11:11:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:11:12,951 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:11:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:12,951 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:11:12,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:11:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:12,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:12,952 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:12,952 INFO L418 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 385525918, now seen corresponding path program 156 times [2019-08-05 11:11:12,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:12,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 2 proven. 190 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:13,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:13,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:13,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:13,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:13,437 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 26 states. [2019-08-05 11:11:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:13,715 INFO L93 Difference]: Finished difference Result 245 states and 280 transitions. [2019-08-05 11:11:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:13,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:13,717 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:11:13,717 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:11:13,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:11:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:11:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 129. [2019-08-05 11:11:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:13,721 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:13,721 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:13,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:13,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:13,721 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:13,722 INFO L418 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash 789162655, now seen corresponding path program 157 times [2019-08-05 11:11:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:13,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:13,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 10 proven. 187 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:11:13,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:13,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:13,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:13,997 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,407 INFO L93 Difference]: Finished difference Result 201 states and 232 transitions. [2019-08-05 11:11:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:14,407 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,408 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:14,408 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:14,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1483, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2019-08-05 11:11:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:14,412 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,412 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:14,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:14,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,412 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:14,413 INFO L418 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1780199966, now seen corresponding path program 158 times [2019-08-05 11:11:14,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 193 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:14,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:14,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:14,637 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,997 INFO L93 Difference]: Finished difference Result 209 states and 244 transitions. [2019-08-05 11:11:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:14,997 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,998 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:14,998 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:14,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:15,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:11:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-08-05 11:11:15,005 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 93 [2019-08-05 11:11:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,005 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-08-05 11:11:15,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-08-05 11:11:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:15,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,006 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:15,006 INFO L418 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2137939937, now seen corresponding path program 159 times [2019-08-05 11:11:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 9 proven. 185 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:15,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:15,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:15,247 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 27 states. [2019-08-05 11:11:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:15,648 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2019-08-05 11:11:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:15,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:15,649 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:11:15,649 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:11:15,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:11:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 133. [2019-08-05 11:11:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:15,653 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:15,653 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:15,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:15,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:15,654 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:15,654 INFO L418 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1146902626, now seen corresponding path program 160 times [2019-08-05 11:11:15,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:15,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:15,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 194 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:15,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:15,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:15,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:15,869 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:16,989 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2019-08-05 11:11:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:16,990 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:16,991 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:11:16,991 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:11:16,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:11:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2019-08-05 11:11:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:11:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:11:16,995 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 93 [2019-08-05 11:11:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:16,995 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:11:16,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:11:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:16,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:16,996 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:16,996 INFO L418 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1630282466, now seen corresponding path program 161 times [2019-08-05 11:11:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:17,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:17,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 195 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:17,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:17,221 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 27 states. [2019-08-05 11:11:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:17,589 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2019-08-05 11:11:17,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:17,590 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:17,590 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:11:17,591 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:11:17,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:11:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 129. [2019-08-05 11:11:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:11:17,594 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 93 [2019-08-05 11:11:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:17,595 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:11:17,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:11:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:17,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:17,595 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:17,595 INFO L418 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash 755782302, now seen corresponding path program 162 times [2019-08-05 11:11:17,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:17,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:17,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 191 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:17,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:17,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:17,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:17,820 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 27 states. [2019-08-05 11:11:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:18,406 INFO L93 Difference]: Finished difference Result 229 states and 265 transitions. [2019-08-05 11:11:18,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:18,407 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:18,407 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:11:18,408 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:11:18,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:18,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:11:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 133. [2019-08-05 11:11:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:11:18,412 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 93 [2019-08-05 11:11:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:18,412 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:11:18,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:11:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:18,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:18,413 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:18,413 INFO L418 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1746819613, now seen corresponding path program 163 times [2019-08-05 11:11:18,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:18,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:18,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 201 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:18,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:18,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:18,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:18,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:18,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:18,758 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 27 states. [2019-08-05 11:11:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,097 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2019-08-05 11:11:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:19,098 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,099 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:11:19,099 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:11:19,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:11:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 109. [2019-08-05 11:11:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:11:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2019-08-05 11:11:19,103 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 93 [2019-08-05 11:11:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,103 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2019-08-05 11:11:19,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2019-08-05 11:11:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:19,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,104 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:19,104 INFO L418 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash 899705503, now seen corresponding path program 164 times [2019-08-05 11:11:19,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 4 proven. 190 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:19,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:19,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:19,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:19,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:19,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:19,349 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand 27 states. [2019-08-05 11:11:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,791 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2019-08-05 11:11:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:11:19,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,792 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:11:19,793 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:11:19,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:11:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 125. [2019-08-05 11:11:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:11:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:11:19,797 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:11:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,797 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:11:19,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:11:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:19,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,798 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:19,798 INFO L418 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 8698525, now seen corresponding path program 165 times [2019-08-05 11:11:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 4 proven. 204 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:20,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:20,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:20,019 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 27 states. [2019-08-05 11:11:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:20,348 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2019-08-05 11:11:20,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:20,348 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:20,349 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:11:20,350 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:11:20,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:11:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 137. [2019-08-05 11:11:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:11:20,353 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:11:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:20,354 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:11:20,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:11:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:20,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:20,354 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:20,355 INFO L418 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:20,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash -982338786, now seen corresponding path program 166 times [2019-08-05 11:11:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:20,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:20,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 194 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:20,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:20,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:20,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:20,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:20,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:20,574 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:11:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,004 INFO L93 Difference]: Finished difference Result 229 states and 263 transitions. [2019-08-05 11:11:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:21,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,006 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:11:21,006 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:11:21,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:11:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 133. [2019-08-05 11:11:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:11:21,010 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 93 [2019-08-05 11:11:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,010 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:11:21,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:11:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:21,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,010 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:21,011 INFO L418 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash 926563742, now seen corresponding path program 167 times [2019-08-05 11:11:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 196 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:21,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:21,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:21,227 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 27 states. [2019-08-05 11:11:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:21,661 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2019-08-05 11:11:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:21,661 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:21,663 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:21,663 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:21,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 121. [2019-08-05 11:11:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:11:21,666 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 93 [2019-08-05 11:11:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:21,667 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:11:21,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:11:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:21,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:21,667 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:21,667 INFO L418 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1009197025, now seen corresponding path program 168 times [2019-08-05 11:11:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:21,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:21,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 6 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:21,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:21,884 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 27 states. [2019-08-05 11:11:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,274 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:11:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:22,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,275 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:11:22,275 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:11:22,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:11:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 125. [2019-08-05 11:11:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:11:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:11:22,278 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:11:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,279 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:11:22,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:11:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:22,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,279 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:22,279 INFO L418 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 927270173, now seen corresponding path program 169 times [2019-08-05 11:11:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 203 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:22,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:22,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:22,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:22,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:22,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:22,541 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 27 states. [2019-08-05 11:11:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:22,853 INFO L93 Difference]: Finished difference Result 229 states and 267 transitions. [2019-08-05 11:11:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:22,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:22,854 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:11:22,854 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:11:22,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:11:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2019-08-05 11:11:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:11:22,858 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:11:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:11:22,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:11:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:22,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:22,859 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:22,859 INFO L418 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash -18159714, now seen corresponding path program 170 times [2019-08-05 11:11:22,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:22,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:22,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 194 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:23,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:23,085 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:11:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:23,720 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2019-08-05 11:11:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:23,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:23,722 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:11:23,722 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:11:23,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:11:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:11:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 129. [2019-08-05 11:11:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:23,726 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:23,726 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:23,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:23,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:23,727 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:23,727 INFO L418 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash -63767138, now seen corresponding path program 171 times [2019-08-05 11:11:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:23,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:23,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:23,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:23,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:23,956 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:24,363 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2019-08-05 11:11:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:24,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:24,364 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:11:24,364 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:11:24,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:11:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 125. [2019-08-05 11:11:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:11:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:11:24,369 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:11:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:24,370 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:11:24,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:11:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:24,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:24,371 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:24,371 INFO L418 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash 358667679, now seen corresponding path program 172 times [2019-08-05 11:11:24,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 8 proven. 186 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:24,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:24,657 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 27 states. [2019-08-05 11:11:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,037 INFO L93 Difference]: Finished difference Result 197 states and 226 transitions. [2019-08-05 11:11:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:25,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,038 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:25,038 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:25,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 137. [2019-08-05 11:11:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:11:25,042 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:11:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,042 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:11:25,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:11:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:25,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,043 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:25,043 INFO L418 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1349704990, now seen corresponding path program 173 times [2019-08-05 11:11:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 195 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:25,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:25,254 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:11:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:25,623 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2019-08-05 11:11:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:25,624 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:25,625 INFO L225 Difference]: With dead ends: 197 [2019-08-05 11:11:25,625 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 11:11:25,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 11:11:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2019-08-05 11:11:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:25,628 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:25,628 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:25,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:25,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:25,629 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:25,629 INFO L418 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash 866325150, now seen corresponding path program 174 times [2019-08-05 11:11:25,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:25,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:25,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:25,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:25,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:25,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:25,929 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,267 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2019-08-05 11:11:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:26,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,268 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:11:26,269 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:11:26,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:11:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2019-08-05 11:11:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:26,272 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,273 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:26,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:26,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,273 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:26,273 INFO L418 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1042577378, now seen corresponding path program 175 times [2019-08-05 11:11:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 192 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:26,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:26,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:26,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:26,478 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:26,900 INFO L93 Difference]: Finished difference Result 213 states and 246 transitions. [2019-08-05 11:11:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:26,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:26,902 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:11:26,902 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:11:26,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:11:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 137. [2019-08-05 11:11:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:26,906 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:26,906 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:26,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:26,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:26,907 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:26,907 INFO L418 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1845135390, now seen corresponding path program 176 times [2019-08-05 11:11:26,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:26,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:26,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 197 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:27,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:27,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:27,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:27,124 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:27,451 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2019-08-05 11:11:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:27,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:27,452 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:11:27,452 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:11:27,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:11:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2019-08-05 11:11:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:27,456 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:27,456 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:27,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:27,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:27,457 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:27,457 INFO L418 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash -51540067, now seen corresponding path program 177 times [2019-08-05 11:11:27,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:27,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:27,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:27,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:27,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:27,683 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,021 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2019-08-05 11:11:28,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:28,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,023 INFO L225 Difference]: With dead ends: 201 [2019-08-05 11:11:28,023 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 11:11:28,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 11:11:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2019-08-05 11:11:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:11:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2019-08-05 11:11:28,027 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 93 [2019-08-05 11:11:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,027 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2019-08-05 11:11:28,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2019-08-05 11:11:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:28,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,028 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:28,028 INFO L418 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1337477919, now seen corresponding path program 178 times [2019-08-05 11:11:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 3 proven. 184 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:28,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:28,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:28,234 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 26 states. [2019-08-05 11:11:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,633 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2019-08-05 11:11:28,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:28,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,638 INFO L225 Difference]: With dead ends: 209 [2019-08-05 11:11:28,638 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 11:11:28,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:11:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 11:11:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 121. [2019-08-05 11:11:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:11:28,642 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 93 [2019-08-05 11:11:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,642 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:11:28,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:11:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:28,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,643 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:28,643 INFO L418 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1966452066, now seen corresponding path program 179 times [2019-08-05 11:11:28,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:28,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:28,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:28,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:28,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:28,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:28,943 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 27 states. [2019-08-05 11:11:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:29,350 INFO L93 Difference]: Finished difference Result 213 states and 247 transitions. [2019-08-05 11:11:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:29,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:29,351 INFO L225 Difference]: With dead ends: 213 [2019-08-05 11:11:29,351 INFO L226 Difference]: Without dead ends: 213 [2019-08-05 11:11:29,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-05 11:11:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 93. [2019-08-05 11:11:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:11:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-08-05 11:11:29,355 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 93 [2019-08-05 11:11:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:29,356 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-08-05 11:11:29,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-08-05 11:11:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:29,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:29,356 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:29,356 INFO L418 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash -75554785, now seen corresponding path program 180 times [2019-08-05 11:11:29,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:29,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:29,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 5 proven. 189 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:29,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:29,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:29,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:29,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:29,663 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 27 states. [2019-08-05 11:11:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,142 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2019-08-05 11:11:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:11:30,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,143 INFO L225 Difference]: With dead ends: 239 [2019-08-05 11:11:30,143 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 11:11:30,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:11:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 11:11:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 121. [2019-08-05 11:11:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:11:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2019-08-05 11:11:30,147 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 93 [2019-08-05 11:11:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,147 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2019-08-05 11:11:30,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2019-08-05 11:11:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:30,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,148 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:11:30,148 INFO L418 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 594941467, now seen corresponding path program 181 times [2019-08-05 11:11:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:11:30,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:30,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:30,344 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 26 states. [2019-08-05 11:11:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:30,702 INFO L93 Difference]: Finished difference Result 189 states and 215 transitions. [2019-08-05 11:11:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:30,702 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:30,703 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:11:30,704 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:11:30,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:11:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:11:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2019-08-05 11:11:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:30,707 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:30,707 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:30,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:30,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:30,707 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:30,708 INFO L418 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:30,708 INFO L82 PathProgramCache]: Analyzing trace with hash -396095844, now seen corresponding path program 182 times [2019-08-05 11:11:30,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:30,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:30,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 1 proven. 213 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-08-05 11:11:30,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:30,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:30,970 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 26 states. [2019-08-05 11:11:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,335 INFO L93 Difference]: Finished difference Result 229 states and 260 transitions. [2019-08-05 11:11:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:31,335 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,336 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:11:31,336 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:11:31,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:11:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 145. [2019-08-05 11:11:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:31,340 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:31,341 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:31,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:31,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:31,341 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:31,341 INFO L418 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1984457313, now seen corresponding path program 183 times [2019-08-05 11:11:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:31,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:31,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 7 proven. 187 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:31,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:31,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:31,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:31,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:31,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:31,557 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:31,994 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2019-08-05 11:11:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:11:31,995 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:31,996 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:31,996 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:31,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=1615, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 149. [2019-08-05 11:11:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:32,000 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,000 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:32,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:32,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,001 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:32,001 INFO L418 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -993420002, now seen corresponding path program 184 times [2019-08-05 11:11:32,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:32,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:32,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:32,233 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:32,636 INFO L93 Difference]: Finished difference Result 253 states and 294 transitions. [2019-08-05 11:11:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:11:32,637 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:32,638 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:32,638 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:32,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1461, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2019-08-05 11:11:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:32,642 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:32,643 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:32,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:32,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:32,643 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:32,643 INFO L418 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash -616592609, now seen corresponding path program 185 times [2019-08-05 11:11:32,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:32,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:32,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 9 proven. 185 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:32,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:32,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:32,858 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:33,262 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2019-08-05 11:11:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:33,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:33,263 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:33,263 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:33,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 149. [2019-08-05 11:11:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:33,268 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:33,268 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:33,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:33,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:33,269 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:33,269 INFO L418 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1512806684, now seen corresponding path program 186 times [2019-08-05 11:11:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:33,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:33,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 2 proven. 219 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:33,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:33,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:33,721 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,153 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2019-08-05 11:11:34,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:34,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,155 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:34,155 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:34,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:11:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:34,160 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,160 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:34,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:34,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,161 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:34,161 INFO L418 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1996186524, now seen corresponding path program 187 times [2019-08-05 11:11:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 3 proven. 218 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:34,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:34,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:34,376 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:34,698 INFO L93 Difference]: Finished difference Result 257 states and 297 transitions. [2019-08-05 11:11:34,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:34,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:34,700 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:11:34,700 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:11:34,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:11:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 153. [2019-08-05 11:11:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:11:34,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 93 [2019-08-05 11:11:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:34,704 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:11:34,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:11:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:34,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:34,705 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:34,705 INFO L418 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 374444702, now seen corresponding path program 188 times [2019-08-05 11:11:34,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:34,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:34,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 194 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:34,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:34,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:34,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:34,924 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 27 states. [2019-08-05 11:11:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,269 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2019-08-05 11:11:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:35,270 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,271 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:35,271 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:35,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:11:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:11:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:35,276 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,276 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:35,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:35,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,277 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:35,277 INFO L418 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash -108935138, now seen corresponding path program 189 times [2019-08-05 11:11:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 195 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:35,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:35,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:35,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:35,494 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:35,839 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2019-08-05 11:11:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:35,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:35,842 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:35,842 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:35,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:11:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 149. [2019-08-05 11:11:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:35,847 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:35,848 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:35,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:35,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:35,849 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:35,849 INFO L418 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2017837666, now seen corresponding path program 190 times [2019-08-05 11:11:35,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:35,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:35,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 191 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:36,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:36,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:36,120 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:36,565 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2019-08-05 11:11:36,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:36,566 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:36,567 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:36,567 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:36,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 153. [2019-08-05 11:11:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-08-05 11:11:36,571 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 93 [2019-08-05 11:11:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:36,571 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-08-05 11:11:36,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-08-05 11:11:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:36,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:36,572 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:36,572 INFO L418 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:36,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1005149213, now seen corresponding path program 191 times [2019-08-05 11:11:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:36,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:36,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 2 proven. 199 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-08-05 11:11:36,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:36,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:36,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:36,777 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 26 states. [2019-08-05 11:11:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,066 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2019-08-05 11:11:37,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:37,066 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,067 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:11:37,067 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:11:37,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:11:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:11:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2019-08-05 11:11:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2019-08-05 11:11:37,071 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 93 [2019-08-05 11:11:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,071 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2019-08-05 11:11:37,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2019-08-05 11:11:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:37,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,072 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:37,072 INFO L418 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash 628321820, now seen corresponding path program 192 times [2019-08-05 11:11:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 4 proven. 217 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:37,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:37,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:37,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:37,290 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 27 states. [2019-08-05 11:11:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:37,630 INFO L93 Difference]: Finished difference Result 257 states and 299 transitions. [2019-08-05 11:11:37,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:37,631 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:37,632 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:11:37,632 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:11:37,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:11:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 153. [2019-08-05 11:11:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-08-05 11:11:37,636 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 93 [2019-08-05 11:11:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:37,636 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-08-05 11:11:37,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-08-05 11:11:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:37,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:37,637 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:37,637 INFO L418 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -362715491, now seen corresponding path program 193 times [2019-08-05 11:11:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:37,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:37,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 203 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:37,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:37,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:37,870 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 27 states. [2019-08-05 11:11:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,265 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2019-08-05 11:11:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:38,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,266 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:11:38,266 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:11:38,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:11:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 149. [2019-08-05 11:11:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:38,270 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,271 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:38,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:38,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,271 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:38,271 INFO L418 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1546187037, now seen corresponding path program 194 times [2019-08-05 11:11:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 3 proven. 205 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:38,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:38,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:38,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:38,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:38,483 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,114 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2019-08-05 11:11:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:39,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,116 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:11:39,116 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:11:39,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:11:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 137. [2019-08-05 11:11:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:39,120 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,120 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:39,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:39,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,121 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:39,121 INFO L418 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1026800355, now seen corresponding path program 195 times [2019-08-05 11:11:39,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 201 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:39,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:39,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:39,391 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:39,752 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2019-08-05 11:11:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:39,753 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:39,753 INFO L225 Difference]: With dead ends: 233 [2019-08-05 11:11:39,754 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 11:11:39,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:11:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 11:11:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 117. [2019-08-05 11:11:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:11:39,757 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 93 [2019-08-05 11:11:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:39,757 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:11:39,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:11:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:39,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:39,758 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:39,758 INFO L418 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:39,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:39,758 INFO L82 PathProgramCache]: Analyzing trace with hash 362217631, now seen corresponding path program 196 times [2019-08-05 11:11:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:39,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:39,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 11 proven. 183 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:39,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:39,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:39,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:39,988 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 27 states. [2019-08-05 11:11:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:40,408 INFO L93 Difference]: Finished difference Result 241 states and 274 transitions. [2019-08-05 11:11:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:40,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:40,410 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:40,410 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:40,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1316, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:11:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 137. [2019-08-05 11:11:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:11:40,414 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:11:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:40,414 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:11:40,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:11:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:40,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:40,415 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:40,415 INFO L418 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1353254942, now seen corresponding path program 197 times [2019-08-05 11:11:40,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:40,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:40,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:40,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:40,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:40,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:40,780 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:11:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,169 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2019-08-05 11:11:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:41,169 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,170 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:41,171 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:41,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 129. [2019-08-05 11:11:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:41,175 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,175 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:41,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:41,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,175 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:41,176 INFO L418 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash 869875102, now seen corresponding path program 198 times [2019-08-05 11:11:41,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 192 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-08-05 11:11:41,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:41,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:41,419 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:41,773 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2019-08-05 11:11:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:41,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:41,774 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:11:41,774 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:11:41,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:11:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 133. [2019-08-05 11:11:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:41,778 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:41,778 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:41,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:41,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:41,779 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:41,779 INFO L418 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:41,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1546893468, now seen corresponding path program 199 times [2019-08-05 11:11:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:41,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:41,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 5 proven. 216 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:41,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:41,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:41,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:41,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:41,990 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,312 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2019-08-05 11:11:42,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:42,313 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,313 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:11:42,314 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:11:42,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:11:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 149. [2019-08-05 11:11:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:42,317 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,317 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:42,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:42,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,318 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:42,318 INFO L418 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1039027426, now seen corresponding path program 200 times [2019-08-05 11:11:42,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 12 proven. 190 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:42,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:42,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:42,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:42,530 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:42,938 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2019-08-05 11:11:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:42,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:42,939 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:42,939 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:42,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:42,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2019-08-05 11:11:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-08-05 11:11:42,943 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 93 [2019-08-05 11:11:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:42,944 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-08-05 11:11:42,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-08-05 11:11:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:42,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:42,944 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:42,944 INFO L418 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -47990115, now seen corresponding path program 201 times [2019-08-05 11:11:42,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:42,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:42,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 11 proven. 200 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:43,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:43,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:43,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:43,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:43,171 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 27 states. [2019-08-05 11:11:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:43,570 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2019-08-05 11:11:43,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:43,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:43,571 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:43,571 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:43,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 137. [2019-08-05 11:11:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:43,575 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:43,576 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:43,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:43,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:43,576 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:43,576 INFO L418 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 555856157, now seen corresponding path program 202 times [2019-08-05 11:11:43,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:43,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:43,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:44,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:44,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:44,132 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:44,573 INFO L93 Difference]: Finished difference Result 253 states and 289 transitions. [2019-08-05 11:11:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:44,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:44,574 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:44,574 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:44,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 133. [2019-08-05 11:11:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:44,578 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:44,578 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:44,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:44,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:44,579 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:44,579 INFO L418 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:44,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:44,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1830208611, now seen corresponding path program 203 times [2019-08-05 11:11:44,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:44,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:44,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 206 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:44,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:44,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:44,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:44,799 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,126 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2019-08-05 11:11:45,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:45,127 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:45,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,127 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:45,128 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:45,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 129. [2019-08-05 11:11:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:45,132 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,132 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:45,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:45,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,133 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:45,133 INFO L418 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1346828771, now seen corresponding path program 204 times [2019-08-05 11:11:45,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 4 proven. 204 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:45,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:45,353 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:45,764 INFO L93 Difference]: Finished difference Result 249 states and 286 transitions. [2019-08-05 11:11:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:45,764 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:45,765 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:45,765 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:45,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 137. [2019-08-05 11:11:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:11:45,769 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:11:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:45,769 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:11:45,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:11:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:45,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:45,770 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:45,770 INFO L418 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1957101214, now seen corresponding path program 205 times [2019-08-05 11:11:45,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:45,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:45,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 189 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:45,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:45,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:45,959 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 26 states. [2019-08-05 11:11:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,216 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2019-08-05 11:11:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:46,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,218 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:46,218 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:46,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:11:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 117. [2019-08-05 11:11:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:11:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 11:11:46,221 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 93 [2019-08-05 11:11:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,222 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 11:11:46,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 11:11:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:46,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,222 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:46,222 INFO L418 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash -48696546, now seen corresponding path program 206 times [2019-08-05 11:11:46,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 193 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:46,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:46,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:46,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:46,441 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 27 states. [2019-08-05 11:11:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:46,838 INFO L93 Difference]: Finished difference Result 229 states and 263 transitions. [2019-08-05 11:11:46,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:46,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:46,839 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:11:46,839 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:11:46,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:11:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 129. [2019-08-05 11:11:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:11:46,843 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 93 [2019-08-05 11:11:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:46,843 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:11:46,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:11:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:46,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:46,844 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:46,844 INFO L418 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash 568083228, now seen corresponding path program 207 times [2019-08-05 11:11:46,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:46,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:46,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 6 proven. 215 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:47,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:47,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:47,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:47,065 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 27 states. [2019-08-05 11:11:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:47,385 INFO L93 Difference]: Finished difference Result 241 states and 279 transitions. [2019-08-05 11:11:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:47,386 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:47,387 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:47,387 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:47,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 149. [2019-08-05 11:11:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:47,390 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:47,390 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:47,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:47,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:47,391 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:47,391 INFO L418 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1957599074, now seen corresponding path program 208 times [2019-08-05 11:11:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:47,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:47,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 11 proven. 191 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:47,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:47,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:47,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:47,603 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,021 INFO L93 Difference]: Finished difference Result 245 states and 282 transitions. [2019-08-05 11:11:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:48,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,023 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:11:48,023 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:11:48,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:11:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 153. [2019-08-05 11:11:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-08-05 11:11:48,027 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 93 [2019-08-05 11:11:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,027 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-08-05 11:11:48,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-08-05 11:11:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:48,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,028 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:48,028 INFO L418 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,029 INFO L82 PathProgramCache]: Analyzing trace with hash -422954083, now seen corresponding path program 209 times [2019-08-05 11:11:48,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 201 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:48,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:48,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:48,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:48,246 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 27 states. [2019-08-05 11:11:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,639 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2019-08-05 11:11:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:48,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,641 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:11:48,641 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:11:48,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:11:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:11:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:48,645 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,645 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:48,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:48,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,646 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:48,646 INFO L418 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash -966561763, now seen corresponding path program 210 times [2019-08-05 11:11:48,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 10 proven. 201 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:49,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:49,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:49,019 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:49,487 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2019-08-05 11:11:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:49,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:49,488 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:49,488 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:49,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 137. [2019-08-05 11:11:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2019-08-05 11:11:49,492 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 93 [2019-08-05 11:11:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:49,493 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2019-08-05 11:11:49,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2019-08-05 11:11:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:49,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:49,493 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:49,493 INFO L418 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1485948445, now seen corresponding path program 211 times [2019-08-05 11:11:49,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:49,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:49,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 205 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:49,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:49,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:49,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:49,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:49,702 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand 27 states. [2019-08-05 11:11:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,029 INFO L93 Difference]: Finished difference Result 261 states and 301 transitions. [2019-08-05 11:11:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:50,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,030 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:11:50,030 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:11:50,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:11:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 133. [2019-08-05 11:11:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:50,034 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,035 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:50,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:50,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,035 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:50,035 INFO L418 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1969328285, now seen corresponding path program 212 times [2019-08-05 11:11:50,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 204 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:50,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:50,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:50,258 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:50,615 INFO L93 Difference]: Finished difference Result 257 states and 297 transitions. [2019-08-05 11:11:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:50,615 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:50,616 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:11:50,616 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:11:50,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:11:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2019-08-05 11:11:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:11:50,620 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 93 [2019-08-05 11:11:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:50,620 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:11:50,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:11:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:50,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:50,621 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:50,621 INFO L418 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:50,621 INFO L82 PathProgramCache]: Analyzing trace with hash -589734370, now seen corresponding path program 213 times [2019-08-05 11:11:50,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:50,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:50,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 10 proven. 189 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:50,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:50,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:50,828 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 27 states. [2019-08-05 11:11:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,217 INFO L93 Difference]: Finished difference Result 253 states and 289 transitions. [2019-08-05 11:11:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:51,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,219 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:51,219 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:51,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 153. [2019-08-05 11:11:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:11:51,223 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 93 [2019-08-05 11:11:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,223 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:11:51,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:11:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:51,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,224 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:51,224 INFO L418 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash 401302941, now seen corresponding path program 214 times [2019-08-05 11:11:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 9 proven. 202 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:51,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:51,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:51,441 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 27 states. [2019-08-05 11:11:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:51,773 INFO L93 Difference]: Finished difference Result 253 states and 293 transitions. [2019-08-05 11:11:51,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:51,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:51,774 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:51,775 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:51,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 145. [2019-08-05 11:11:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:51,778 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:51,779 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:51,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:51,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:51,779 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:51,779 INFO L418 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 978290974, now seen corresponding path program 215 times [2019-08-05 11:11:51,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:51,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:51,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 191 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:51,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:51,994 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,347 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2019-08-05 11:11:52,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:52,347 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,348 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:11:52,349 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:11:52,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:11:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:11:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 133. [2019-08-05 11:11:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:11:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-08-05 11:11:52,352 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 93 [2019-08-05 11:11:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,352 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-08-05 11:11:52,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-08-05 11:11:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:52,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,353 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:52,353 INFO L418 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 601463581, now seen corresponding path program 216 times [2019-08-05 11:11:52,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 5 proven. 203 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:52,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:52,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:52,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:52,572 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 27 states. [2019-08-05 11:11:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:52,967 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2019-08-05 11:11:52,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:52,967 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:52,968 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:11:52,968 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:11:52,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:11:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:11:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 145. [2019-08-05 11:11:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:52,971 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:52,972 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:52,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:52,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:52,972 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:52,972 INFO L418 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash -82076899, now seen corresponding path program 217 times [2019-08-05 11:11:52,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:52,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:52,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 8 proven. 203 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:53,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:53,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:53,197 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:53,519 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2019-08-05 11:11:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:53,520 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:53,521 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:53,521 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:53,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 149. [2019-08-05 11:11:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:53,525 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:53,525 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:53,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:53,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:53,526 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:53,526 INFO L418 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -389573730, now seen corresponding path program 218 times [2019-08-05 11:11:53,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:53,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:53,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:53,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:53,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:53,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:53,765 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:54,493 INFO L93 Difference]: Finished difference Result 273 states and 312 transitions. [2019-08-05 11:11:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:54,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:54,494 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:11:54,494 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:11:54,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:11:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 145. [2019-08-05 11:11:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:11:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:11:54,498 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 93 [2019-08-05 11:11:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:54,498 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:11:54,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:11:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:54,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:54,499 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:54,499 INFO L418 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1990979427, now seen corresponding path program 219 times [2019-08-05 11:11:54,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:54,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:54,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 9 proven. 199 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:54,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:54,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:54,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:54,715 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 27 states. [2019-08-05 11:11:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,124 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2019-08-05 11:11:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:55,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,125 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:11:55,125 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:11:55,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:11:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 149. [2019-08-05 11:11:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:11:55,131 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 93 [2019-08-05 11:11:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,131 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:11:55,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:11:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:55,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,132 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:55,132 INFO L418 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1519328798, now seen corresponding path program 220 times [2019-08-05 11:11:55,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:55,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:55,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:55,363 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 27 states. [2019-08-05 11:11:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:55,848 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2019-08-05 11:11:55,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:11:55,849 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:55,850 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:11:55,850 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:11:55,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1617, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:11:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 129. [2019-08-05 11:11:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:11:55,855 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 93 [2019-08-05 11:11:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:55,856 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:11:55,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:11:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:55,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:55,856 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:55,856 INFO L418 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1928524388, now seen corresponding path program 221 times [2019-08-05 11:11:55,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:55,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:55,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 7 proven. 214 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:56,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:56,070 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 27 states. [2019-08-05 11:11:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:56,408 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2019-08-05 11:11:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:56,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:56,410 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:11:56,410 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:11:56,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:11:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 153. [2019-08-05 11:11:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:11:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2019-08-05 11:11:56,414 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 93 [2019-08-05 11:11:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:56,414 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2019-08-05 11:11:56,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2019-08-05 11:11:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:56,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:56,420 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:56,420 INFO L418 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1375405597, now seen corresponding path program 222 times [2019-08-05 11:11:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:56,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:56,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 8 proven. 200 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:11:56,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:56,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:56,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:56,626 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 27 states. [2019-08-05 11:11:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,062 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2019-08-05 11:11:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:57,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,064 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:57,064 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:57,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:11:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 149. [2019-08-05 11:11:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:11:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2019-08-05 11:11:57,068 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 93 [2019-08-05 11:11:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,068 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2019-08-05 11:11:57,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2019-08-05 11:11:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:57,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,069 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:11:57,069 INFO L418 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash -999942116, now seen corresponding path program 223 times [2019-08-05 11:11:57,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 8 proven. 213 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-08-05 11:11:57,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:57,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:57,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:57,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:57,291 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand 27 states. [2019-08-05 11:11:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:57,629 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2019-08-05 11:11:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:57,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:57,630 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:11:57,630 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:11:57,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:11:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 125. [2019-08-05 11:11:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:11:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2019-08-05 11:11:57,634 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 93 [2019-08-05 11:11:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:57,634 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2019-08-05 11:11:57,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2019-08-05 11:11:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:57,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:57,635 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:11:57,635 INFO L418 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash -566364641, now seen corresponding path program 224 times [2019-08-05 11:11:57,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:57,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:11:57,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 4 proven. 183 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:11:57,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:11:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:11:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:11:57,873 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand 26 states. [2019-08-05 11:11:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,102 INFO L93 Difference]: Finished difference Result 249 states and 283 transitions. [2019-08-05 11:11:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:11:58,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2019-08-05 11:11:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,103 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:11:58,103 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:11:58,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:11:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:11:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 141. [2019-08-05 11:11:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:11:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:11:58,107 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 93 [2019-08-05 11:11:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,108 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:11:58,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:11:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:11:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:58,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,108 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:11:58,108 INFO L418 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1010659171, now seen corresponding path program 225 times [2019-08-05 11:11:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 7 proven. 204 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:11:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:58,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:58,331 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 27 states. [2019-08-05 11:11:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,651 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2019-08-05 11:11:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:11:58,651 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,652 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:11:58,653 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:11:58,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:11:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:11:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2019-08-05 11:11:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:11:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2019-08-05 11:11:58,657 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 93 [2019-08-05 11:11:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,657 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2019-08-05 11:11:58,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2019-08-05 11:11:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:58,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,658 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:58,658 INFO L418 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 424672670, now seen corresponding path program 226 times [2019-08-05 11:11:58,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:58,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:11:58,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 5 proven. 194 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:11:58,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:58,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:58,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:58,912 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 27 states. [2019-08-05 11:11:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:59,443 INFO L93 Difference]: Finished difference Result 245 states and 282 transitions. [2019-08-05 11:11:59,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:11:59,443 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:11:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:59,444 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:11:59,444 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:11:59,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:11:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:11:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 129. [2019-08-05 11:11:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:11:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:11:59,448 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 93 [2019-08-05 11:11:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:59,448 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:11:59,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:11:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:11:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:11:59,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:59,449 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:11:59,449 INFO L418 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash -58707170, now seen corresponding path program 227 times [2019-08-05 11:11:59,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:59,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:11:59,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:11:59,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:59,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:11:59,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:11:59,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:11:59,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:11:59,669 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 27 states. [2019-08-05 11:12:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,029 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2019-08-05 11:12:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:00,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,031 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:12:00,031 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:12:00,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:12:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 133. [2019-08-05 11:12:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:12:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:12:00,035 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 93 [2019-08-05 11:12:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,035 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:12:00,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:12:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:00,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,036 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:00,036 INFO L418 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1967609698, now seen corresponding path program 228 times [2019-08-05 11:12:00,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 7 proven. 192 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:12:00,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:00,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:00,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:00,297 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 27 states. [2019-08-05 11:12:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:00,729 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2019-08-05 11:12:00,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:00,729 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:00,730 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:12:00,731 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:12:00,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1542, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:12:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 137. [2019-08-05 11:12:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:12:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:12:00,735 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 93 [2019-08-05 11:12:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:00,735 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:12:00,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:12:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:00,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:00,736 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:00,736 INFO L418 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash -976572387, now seen corresponding path program 229 times [2019-08-05 11:12:00,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:00,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:00,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-08-05 11:12:01,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:01,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:01,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:01,070 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 27 states. [2019-08-05 11:12:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:01,440 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2019-08-05 11:12:01,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:01,441 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:01,442 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:12:01,442 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:12:01,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:12:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:12:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 121. [2019-08-05 11:12:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:12:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2019-08-05 11:12:01,446 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 93 [2019-08-05 11:12:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:01,446 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2019-08-05 11:12:01,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2019-08-05 11:12:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:01,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:01,446 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:01,447 INFO L418 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash -977278818, now seen corresponding path program 230 times [2019-08-05 11:12:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:01,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:01,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 8 proven. 194 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:12:01,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:01,660 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand 27 states. [2019-08-05 11:12:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,076 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2019-08-05 11:12:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:02,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,078 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:12:02,078 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:12:02,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:12:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 129. [2019-08-05 11:12:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:12:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:12:02,081 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 93 [2019-08-05 11:12:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,082 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:12:02,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:12:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:02,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,082 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:02,082 INFO L418 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1408785950, now seen corresponding path program 231 times [2019-08-05 11:12:02,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-08-05 11:12:02,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:02,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:02,321 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 27 states. [2019-08-05 11:12:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:02,722 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2019-08-05 11:12:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:02,722 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:02,723 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:12:02,724 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:12:02,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:12:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2019-08-05 11:12:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:12:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2019-08-05 11:12:02,727 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 93 [2019-08-05 11:12:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:02,728 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2019-08-05 11:12:02,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2019-08-05 11:12:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:02,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:02,728 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:02,728 INFO L418 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -527279331, now seen corresponding path program 232 times [2019-08-05 11:12:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:02,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:02,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 8 proven. 203 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:12:02,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:02,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:02,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:02,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:02,956 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 27 states. [2019-08-05 11:12:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,264 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2019-08-05 11:12:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:03,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,266 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:12:03,266 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:12:03,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:12:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 141. [2019-08-05 11:12:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:12:03,270 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 93 [2019-08-05 11:12:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,270 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:12:03,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:12:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:03,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,271 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:03,271 INFO L418 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1895144035, now seen corresponding path program 233 times [2019-08-05 11:12:03,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 9 proven. 202 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-08-05 11:12:03,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:03,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:03,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:03,485 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 27 states. [2019-08-05 11:12:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:03,814 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2019-08-05 11:12:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:03,814 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:03,815 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:12:03,815 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:12:03,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:12:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 129. [2019-08-05 11:12:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:12:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:12:03,819 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 93 [2019-08-05 11:12:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:03,819 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:12:03,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:12:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:12:03,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:03,820 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:03,820 INFO L418 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:03,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:03,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1518316642, now seen corresponding path program 234 times [2019-08-05 11:12:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:03,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:03,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 9 proven. 190 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-08-05 11:12:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:04,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:12:04,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:12:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:12:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:04,038 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 27 states. [2019-08-05 11:12:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,618 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2019-08-05 11:12:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:04,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-08-05 11:12:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,619 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:12:04,619 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:12:04,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1465, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:12:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 101. [2019-08-05 11:12:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:12:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-08-05 11:12:04,623 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 93 [2019-08-05 11:12:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,623 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-08-05 11:12:04,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:12:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-08-05 11:12:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:04,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,624 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:04,624 INFO L418 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1752724420, now seen corresponding path program 235 times [2019-08-05 11:12:04,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 257 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-08-05 11:12:04,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:04,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:04,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:04,851 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 28 states. [2019-08-05 11:12:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,154 INFO L93 Difference]: Finished difference Result 205 states and 237 transitions. [2019-08-05 11:12:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:05,155 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,156 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:05,156 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:05,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2019-08-05 11:12:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:12:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2019-08-05 11:12:05,159 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 101 [2019-08-05 11:12:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,159 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2019-08-05 11:12:05,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2019-08-05 11:12:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:05,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,160 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:05,160 INFO L418 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -602058307, now seen corresponding path program 236 times [2019-08-05 11:12:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 1 proven. 241 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-08-05 11:12:05,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:05,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:05,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:05,401 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 28 states. [2019-08-05 11:12:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:05,804 INFO L93 Difference]: Finished difference Result 245 states and 281 transitions. [2019-08-05 11:12:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:05,804 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:05,805 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:12:05,805 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:12:05,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:12:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 129. [2019-08-05 11:12:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:12:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-08-05 11:12:05,810 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 101 [2019-08-05 11:12:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:05,810 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-08-05 11:12:05,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-08-05 11:12:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:05,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:05,811 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:05,811 INFO L418 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -875340739, now seen corresponding path program 237 times [2019-08-05 11:12:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:05,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:05,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 248 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:06,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:06,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:06,065 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 29 states. [2019-08-05 11:12:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:06,477 INFO L93 Difference]: Finished difference Result 253 states and 293 transitions. [2019-08-05 11:12:06,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:06,477 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:06,478 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:06,478 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:06,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 125. [2019-08-05 11:12:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:12:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2019-08-05 11:12:06,482 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 101 [2019-08-05 11:12:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:06,482 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2019-08-05 11:12:06,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2019-08-05 11:12:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:06,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:06,483 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:12:06,483 INFO L418 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:06,483 INFO L82 PathProgramCache]: Analyzing trace with hash -342373824, now seen corresponding path program 238 times [2019-08-05 11:12:06,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:06,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:06,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 224 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:12:06,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:06,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:06,742 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 29 states. [2019-08-05 11:12:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,248 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2019-08-05 11:12:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:12:07,248 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,249 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:12:07,249 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:12:07,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1956, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:12:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:12:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 149. [2019-08-05 11:12:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:07,254 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,254 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:07,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:07,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,255 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:07,255 INFO L418 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1580095811, now seen corresponding path program 239 times [2019-08-05 11:12:07,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 3 proven. 247 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:07,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:07,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:07,501 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:12:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:07,870 INFO L93 Difference]: Finished difference Result 285 states and 331 transitions. [2019-08-05 11:12:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:07,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:07,872 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:12:07,872 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:12:07,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:12:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 157. [2019-08-05 11:12:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:07,876 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:07,877 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:07,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:07,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:07,877 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:12:07,877 INFO L418 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash -69091392, now seen corresponding path program 240 times [2019-08-05 11:12:07,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:07,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:07,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 7 proven. 222 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:12:08,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:08,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:08,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:08,133 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:08,604 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2019-08-05 11:12:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:08,604 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:08,605 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:12:08,605 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:12:08,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1872, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:12:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 161. [2019-08-05 11:12:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:12:08,609 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:12:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:08,610 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:12:08,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:12:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:08,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:08,610 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:08,611 INFO L418 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1219757505, now seen corresponding path program 241 times [2019-08-05 11:12:08,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:08,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:08,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:08,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:08,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:08,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:08,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:08,884 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:12:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:09,340 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2019-08-05 11:12:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:09,340 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:09,341 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:12:09,341 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:12:09,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:12:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 149. [2019-08-05 11:12:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:09,345 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:09,345 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:09,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:09,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:09,346 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:09,346 INFO L418 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -429429698, now seen corresponding path program 242 times [2019-08-05 11:12:09,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:09,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:09,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 2 proven. 229 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-08-05 11:12:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:09,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:09,831 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 28 states. [2019-08-05 11:12:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,181 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2019-08-05 11:12:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:10,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,183 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:10,183 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:10,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 137. [2019-08-05 11:12:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:12:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:12:10,187 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:12:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,188 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:12:10,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:12:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:10,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,188 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:12:10,188 INFO L418 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1191496384, now seen corresponding path program 243 times [2019-08-05 11:12:10,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 220 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:12:10,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:10,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:10,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:10,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:10,439 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:12:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:10,864 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2019-08-05 11:12:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:10,865 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:10,866 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:10,866 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:10,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1629, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:12:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:10,870 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:10,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:10,871 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:10,871 INFO L418 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:10,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1952804799, now seen corresponding path program 244 times [2019-08-05 11:12:10,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:10,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:10,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 228 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:11,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:11,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:11,126 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:12:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:11,534 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2019-08-05 11:12:11,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:11,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:11,535 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:11,535 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:11,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 141. [2019-08-05 11:12:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:12:11,539 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:12:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:11,540 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:12:11,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:12:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:11,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:11,540 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:11,541 INFO L418 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash -457690819, now seen corresponding path program 245 times [2019-08-05 11:12:11,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:11,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:11,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 4 proven. 246 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:11,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:11,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:11,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:11,791 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:12:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,202 INFO L93 Difference]: Finished difference Result 281 states and 328 transitions. [2019-08-05 11:12:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:12,203 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,203 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:12,203 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:12,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 153. [2019-08-05 11:12:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:12:12,207 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:12:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,207 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:12:12,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:12:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:12,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,208 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:12,208 INFO L418 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash 692975294, now seen corresponding path program 246 times [2019-08-05 11:12:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 5 proven. 234 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:12,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:12,457 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:12:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:12,912 INFO L93 Difference]: Finished difference Result 273 states and 314 transitions. [2019-08-05 11:12:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:12,913 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:12,914 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:12:12,914 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:12:12,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:12:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 149. [2019-08-05 11:12:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:12,918 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:12,918 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:12,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:12,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:12,919 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:12,919 INFO L418 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash 419692862, now seen corresponding path program 247 times [2019-08-05 11:12:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:12,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 3 proven. 236 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:13,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:13,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:13,159 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:12:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:13,636 INFO L93 Difference]: Finished difference Result 285 states and 328 transitions. [2019-08-05 11:12:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:13,637 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:13,638 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:12:13,638 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:12:13,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:12:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 137. [2019-08-05 11:12:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:12:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:12:13,643 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:12:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:13,644 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:12:13,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:12:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:13,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:13,644 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:13,644 INFO L418 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:13,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:13,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1637407425, now seen corresponding path program 248 times [2019-08-05 11:12:13,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:13,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:13,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 7 proven. 229 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:13,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:13,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:13,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:13,896 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:12:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:14,283 INFO L93 Difference]: Finished difference Result 253 states and 294 transitions. [2019-08-05 11:12:14,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:14,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:14,285 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:14,285 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:14,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 141. [2019-08-05 11:12:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:12:14,288 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:12:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:14,289 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:12:14,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:12:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:14,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:14,289 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:14,289 INFO L418 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 723975101, now seen corresponding path program 249 times [2019-08-05 11:12:14,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:14,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:14,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 245 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:14,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:14,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:14,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:14,825 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:12:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,229 INFO L93 Difference]: Finished difference Result 277 states and 324 transitions. [2019-08-05 11:12:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:15,229 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,230 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:15,230 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:15,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 157. [2019-08-05 11:12:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:12:15,235 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:12:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,235 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:12:15,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:12:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:15,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,236 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:15,236 INFO L418 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1874641214, now seen corresponding path program 250 times [2019-08-05 11:12:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 233 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:15,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:15,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:15,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:15,544 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:12:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,051 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-08-05 11:12:16,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:16,052 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,053 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:16,053 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:16,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 153. [2019-08-05 11:12:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:12:16,058 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:12:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,058 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:12:16,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:12:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:16,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,059 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:16,059 INFO L418 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1601358782, now seen corresponding path program 251 times [2019-08-05 11:12:16,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 5 proven. 238 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:16,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:16,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:16,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:16,308 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:12:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:16,685 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2019-08-05 11:12:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:16,685 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:16,687 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:12:16,687 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:12:16,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:12:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 149. [2019-08-05 11:12:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:16,691 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:16,691 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:16,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:16,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:16,692 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:16,692 INFO L418 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 896603710, now seen corresponding path program 252 times [2019-08-05 11:12:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:16,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:16,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 4 proven. 235 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:17,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:17,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:17,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:17,020 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:12:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:17,488 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2019-08-05 11:12:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:17,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:17,491 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:17,491 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:17,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 157. [2019-08-05 11:12:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:17,496 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:17,497 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:17,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:17,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:17,498 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:17,498 INFO L418 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:17,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2047269823, now seen corresponding path program 253 times [2019-08-05 11:12:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:17,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:17,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 3 proven. 221 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-08-05 11:12:17,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:17,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:17,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:17,739 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 28 states. [2019-08-05 11:12:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,035 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2019-08-05 11:12:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:18,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,037 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:18,037 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:18,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:12:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 137. [2019-08-05 11:12:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:12:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-08-05 11:12:18,041 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 101 [2019-08-05 11:12:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,042 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-08-05 11:12:18,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-08-05 11:12:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:18,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,042 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:18,042 INFO L418 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 465438269, now seen corresponding path program 254 times [2019-08-05 11:12:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:18,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:18,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:18,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:18,325 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 29 states. [2019-08-05 11:12:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:18,707 INFO L93 Difference]: Finished difference Result 261 states and 305 transitions. [2019-08-05 11:12:18,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:18,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:18,709 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:12:18,709 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:12:18,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:12:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 157. [2019-08-05 11:12:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:12:18,713 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:12:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:18,713 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:12:18,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:12:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:18,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:18,714 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:18,714 INFO L418 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:18,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1616104382, now seen corresponding path program 255 times [2019-08-05 11:12:18,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:18,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:18,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:18,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:18,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:18,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:18,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:18,960 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:12:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:19,435 INFO L93 Difference]: Finished difference Result 269 states and 311 transitions. [2019-08-05 11:12:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:19,435 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:19,437 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:19,437 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:19,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2019-08-05 11:12:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:12:19,441 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:12:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:19,441 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:12:19,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:12:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:19,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:19,442 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:19,442 INFO L418 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1342821950, now seen corresponding path program 256 times [2019-08-05 11:12:19,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:19,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:19,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 237 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:20,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:20,035 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:12:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:20,407 INFO L93 Difference]: Finished difference Result 261 states and 303 transitions. [2019-08-05 11:12:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:20,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:20,408 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:12:20,409 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:12:20,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:12:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 149. [2019-08-05 11:12:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:20,413 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:20,413 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:20,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:20,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:20,414 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:20,414 INFO L418 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash 638066878, now seen corresponding path program 257 times [2019-08-05 11:12:20,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:20,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:20,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 236 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:20,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:20,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:20,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:20,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:20,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:20,676 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:12:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,058 INFO L93 Difference]: Finished difference Result 253 states and 294 transitions. [2019-08-05 11:12:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:21,059 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,060 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:21,060 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:21,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 157. [2019-08-05 11:12:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:21,064 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,065 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:21,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:21,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,065 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:21,065 INFO L418 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1788732991, now seen corresponding path program 258 times [2019-08-05 11:12:21,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:21,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:21,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:21,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:21,330 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:21,747 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2019-08-05 11:12:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:21,747 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:21,748 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:21,748 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:21,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 145. [2019-08-05 11:12:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:12:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:12:21,753 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 101 [2019-08-05 11:12:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:21,753 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:12:21,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:12:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:21,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:21,753 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:21,754 INFO L418 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:21,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:21,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1760471870, now seen corresponding path program 259 times [2019-08-05 11:12:21,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:21,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:21,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 5 proven. 234 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:21,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:21,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:21,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:21,996 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 29 states. [2019-08-05 11:12:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:22,402 INFO L93 Difference]: Finished difference Result 273 states and 318 transitions. [2019-08-05 11:12:22,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:22,402 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:22,403 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:12:22,403 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:12:22,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:12:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 157. [2019-08-05 11:12:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:22,408 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:22,408 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:22,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:22,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:22,409 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:22,409 INFO L418 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1364124993, now seen corresponding path program 260 times [2019-08-05 11:12:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:22,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:22,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:22,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:22,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:22,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:22,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:22,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:22,705 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,205 INFO L93 Difference]: Finished difference Result 281 states and 325 transitions. [2019-08-05 11:12:23,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:23,206 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,207 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:23,207 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:23,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 161. [2019-08-05 11:12:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:12:23,211 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:12:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,211 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:12:23,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:12:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:23,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,212 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:23,212 INFO L418 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1780176190, now seen corresponding path program 261 times [2019-08-05 11:12:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:23,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:23,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:23,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:23,467 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:12:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:23,877 INFO L93 Difference]: Finished difference Result 281 states and 329 transitions. [2019-08-05 11:12:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:23,877 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:23,878 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:23,878 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:23,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 141. [2019-08-05 11:12:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:12:23,883 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 101 [2019-08-05 11:12:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:23,883 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:12:23,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:12:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:23,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:23,883 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:12:23,884 INFO L418 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash -932959552, now seen corresponding path program 262 times [2019-08-05 11:12:23,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:23,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:23,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 218 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-08-05 11:12:24,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:24,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:24,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:24,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:24,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:24,126 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 29 states. [2019-08-05 11:12:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:24,566 INFO L93 Difference]: Finished difference Result 253 states and 289 transitions. [2019-08-05 11:12:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:24,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:24,567 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:24,567 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:24,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 161. [2019-08-05 11:12:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 185 transitions. [2019-08-05 11:12:24,572 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 185 transitions. Word has length 101 [2019-08-05 11:12:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:24,572 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 185 transitions. [2019-08-05 11:12:24,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 185 transitions. [2019-08-05 11:12:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:24,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:24,573 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:24,573 INFO L418 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1383829313, now seen corresponding path program 263 times [2019-08-05 11:12:24,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:24,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:24,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:25,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:25,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:25,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:25,114 INFO L87 Difference]: Start difference. First operand 161 states and 185 transitions. Second operand 29 states. [2019-08-05 11:12:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:25,594 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2019-08-05 11:12:25,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:25,595 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:25,596 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:25,596 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:25,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 157. [2019-08-05 11:12:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2019-08-05 11:12:25,601 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 101 [2019-08-05 11:12:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:25,602 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2019-08-05 11:12:25,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2019-08-05 11:12:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:25,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:25,602 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:25,603 INFO L418 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1657111745, now seen corresponding path program 264 times [2019-08-05 11:12:25,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:25,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:25,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 4 proven. 228 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:25,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:25,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:25,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:25,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:25,905 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 29 states. [2019-08-05 11:12:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:26,395 INFO L93 Difference]: Finished difference Result 281 states and 323 transitions. [2019-08-05 11:12:26,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:26,395 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:26,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:26,396 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:26,397 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:26,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 137. [2019-08-05 11:12:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:12:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2019-08-05 11:12:26,401 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 101 [2019-08-05 11:12:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:26,401 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2019-08-05 11:12:26,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2019-08-05 11:12:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:26,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:26,402 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:26,402 INFO L418 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1830637757, now seen corresponding path program 265 times [2019-08-05 11:12:26,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:26,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:26,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 243 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:26,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:26,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:26,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:26,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:26,665 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 29 states. [2019-08-05 11:12:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,077 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2019-08-05 11:12:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:27,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,078 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:12:27,078 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:12:27,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:12:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 161. [2019-08-05 11:12:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:12:27,083 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:12:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,084 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:12:27,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:12:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:27,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,085 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:27,085 INFO L418 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1313663426, now seen corresponding path program 266 times [2019-08-05 11:12:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 231 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:27,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:27,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:27,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:27,431 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:12:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:27,889 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2019-08-05 11:12:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:27,889 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:27,890 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:12:27,890 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:12:27,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:12:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2019-08-05 11:12:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:27,894 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:27,894 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:27,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:27,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:27,895 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:27,896 INFO L418 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1586945858, now seen corresponding path program 267 times [2019-08-05 11:12:27,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:27,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:27,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 236 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:28,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:28,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:28,144 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,513 INFO L93 Difference]: Finished difference Result 253 states and 293 transitions. [2019-08-05 11:12:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:28,514 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,515 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:28,515 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:28,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 153. [2019-08-05 11:12:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:28,519 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,519 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:28,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:28,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,520 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:28,520 INFO L418 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2083625665, now seen corresponding path program 268 times [2019-08-05 11:12:28,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:28,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:28,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:28,778 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,230 INFO L93 Difference]: Finished difference Result 249 states and 289 transitions. [2019-08-05 11:12:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:29,231 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,232 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:12:29,232 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:12:29,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:12:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:12:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 145. [2019-08-05 11:12:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:12:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:12:29,236 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 101 [2019-08-05 11:12:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,236 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:12:29,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:12:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:29,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,237 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:29,237 INFO L418 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2003266366, now seen corresponding path program 269 times [2019-08-05 11:12:29,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:29,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:29,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:29,501 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 29 states. [2019-08-05 11:12:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,996 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2019-08-05 11:12:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:29,996 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,997 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:12:29,997 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:12:29,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:12:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 153. [2019-08-05 11:12:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:30,001 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,001 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:30,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:30,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,002 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:30,002 INFO L418 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1141034817, now seen corresponding path program 270 times [2019-08-05 11:12:30,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 223 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:30,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:30,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:30,461 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,878 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2019-08-05 11:12:30,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:30,879 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,880 INFO L225 Difference]: With dead ends: 241 [2019-08-05 11:12:30,880 INFO L226 Difference]: Without dead ends: 241 [2019-08-05 11:12:30,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-05 11:12:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 141. [2019-08-05 11:12:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:12:30,883 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 101 [2019-08-05 11:12:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,884 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:12:30,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:12:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:30,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,884 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:30,884 INFO L418 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1169295938, now seen corresponding path program 271 times [2019-08-05 11:12:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:31,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:31,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:31,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:31,136 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 29 states. [2019-08-05 11:12:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,546 INFO L93 Difference]: Finished difference Result 229 states and 266 transitions. [2019-08-05 11:12:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:31,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,548 INFO L225 Difference]: With dead ends: 229 [2019-08-05 11:12:31,548 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 11:12:31,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 11:12:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 153. [2019-08-05 11:12:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:31,552 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,552 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:31,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:31,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,553 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:31,553 INFO L418 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash -18629825, now seen corresponding path program 272 times [2019-08-05 11:12:31,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:31,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:31,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:31,825 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:32,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,283 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2019-08-05 11:12:32,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:32,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,285 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:12:32,285 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:12:32,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:12:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2019-08-05 11:12:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2019-08-05 11:12:32,289 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 101 [2019-08-05 11:12:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,289 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2019-08-05 11:12:32,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2019-08-05 11:12:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:32,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,289 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:32,290 INFO L418 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1378870593, now seen corresponding path program 273 times [2019-08-05 11:12:32,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:32,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:32,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:32,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:32,538 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 29 states. [2019-08-05 11:12:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,909 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2019-08-05 11:12:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:32,910 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,911 INFO L225 Difference]: With dead ends: 237 [2019-08-05 11:12:32,911 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 11:12:32,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 11:12:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 153. [2019-08-05 11:12:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:32,915 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,915 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:32,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:32,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,916 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:32,916 INFO L418 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1105588161, now seen corresponding path program 274 times [2019-08-05 11:12:32,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 12 proven. 224 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:33,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:33,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:33,164 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,675 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2019-08-05 11:12:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:33,675 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,676 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:12:33,676 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:12:33,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:12:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 157. [2019-08-05 11:12:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:33,680 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,680 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:33,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:33,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,681 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:33,681 INFO L418 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2038713022, now seen corresponding path program 275 times [2019-08-05 11:12:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 11 proven. 232 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:33,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:33,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:33,921 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,303 INFO L93 Difference]: Finished difference Result 249 states and 290 transitions. [2019-08-05 11:12:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:34,304 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,305 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:12:34,305 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:12:34,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:12:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 141. [2019-08-05 11:12:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:12:34,309 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 101 [2019-08-05 11:12:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,309 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:12:34,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:12:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:34,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,309 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:34,310 INFO L418 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash -291912257, now seen corresponding path program 276 times [2019-08-05 11:12:34,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 228 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:34,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:34,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:34,553 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 29 states. [2019-08-05 11:12:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,128 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2019-08-05 11:12:35,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:35,129 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,129 INFO L225 Difference]: With dead ends: 225 [2019-08-05 11:12:35,130 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 11:12:35,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 11:12:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 129. [2019-08-05 11:12:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:12:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-08-05 11:12:35,134 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 101 [2019-08-05 11:12:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,134 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-08-05 11:12:35,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-08-05 11:12:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:35,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,135 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:35,135 INFO L418 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1734430783, now seen corresponding path program 277 times [2019-08-05 11:12:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:35,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:35,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:35,520 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 29 states. [2019-08-05 11:12:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,963 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2019-08-05 11:12:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:35,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,965 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:12:35,965 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:12:35,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:12:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 141. [2019-08-05 11:12:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:12:35,969 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 101 [2019-08-05 11:12:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,970 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:12:35,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:12:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:35,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,970 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:35,970 INFO L418 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash 12369982, now seen corresponding path program 278 times [2019-08-05 11:12:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 233 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:36,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:36,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:36,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:36,245 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 29 states. [2019-08-05 11:12:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,682 INFO L93 Difference]: Finished difference Result 257 states and 300 transitions. [2019-08-05 11:12:36,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:36,683 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,684 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:12:36,684 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:12:36,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:12:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2019-08-05 11:12:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:36,689 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,689 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:36,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:36,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,689 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:36,690 INFO L418 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1163036095, now seen corresponding path program 279 times [2019-08-05 11:12:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 7 proven. 225 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:36,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:36,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:36,939 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,389 INFO L93 Difference]: Finished difference Result 249 states and 287 transitions. [2019-08-05 11:12:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:37,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,391 INFO L225 Difference]: With dead ends: 249 [2019-08-05 11:12:37,391 INFO L226 Difference]: Without dead ends: 249 [2019-08-05 11:12:37,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=281, Invalid=1789, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-05 11:12:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2019-08-05 11:12:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:37,396 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,396 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:37,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:37,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,397 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:37,397 INFO L418 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2007713215, now seen corresponding path program 280 times [2019-08-05 11:12:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:37,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:37,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:37,836 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,297 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2019-08-05 11:12:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:38,298 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,299 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:12:38,300 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:12:38,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1783, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:12:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2019-08-05 11:12:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:12:38,305 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:12:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,305 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:12:38,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:12:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:38,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,306 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:38,306 INFO L418 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash 889753663, now seen corresponding path program 281 times [2019-08-05 11:12:38,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 230 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:38,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:38,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:38,566 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:12:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,967 INFO L93 Difference]: Finished difference Result 257 states and 297 transitions. [2019-08-05 11:12:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:38,967 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,968 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:12:38,969 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:12:38,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1544, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:12:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 153. [2019-08-05 11:12:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:38,973 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,973 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:38,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:38,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,974 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:38,974 INFO L418 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 857047102, now seen corresponding path program 282 times [2019-08-05 11:12:38,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:39,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:39,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:39,255 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,641 INFO L93 Difference]: Finished difference Result 261 states and 304 transitions. [2019-08-05 11:12:39,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:39,642 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,643 INFO L225 Difference]: With dead ends: 261 [2019-08-05 11:12:39,643 INFO L226 Difference]: Without dead ends: 261 [2019-08-05 11:12:39,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-08-05 11:12:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 141. [2019-08-05 11:12:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2019-08-05 11:12:39,650 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 101 [2019-08-05 11:12:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,650 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2019-08-05 11:12:39,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2019-08-05 11:12:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:39,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,651 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:39,651 INFO L418 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash 885308223, now seen corresponding path program 283 times [2019-08-05 11:12:39,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:39,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:39,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 222 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:39,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:39,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:39,897 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand 29 states. [2019-08-05 11:12:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:40,637 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2019-08-05 11:12:40,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:40,638 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:40,639 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:40,639 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:40,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2019-08-05 11:12:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2019-08-05 11:12:40,643 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 101 [2019-08-05 11:12:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:40,644 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2019-08-05 11:12:40,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2019-08-05 11:12:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:40,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:40,644 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:40,644 INFO L418 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -265357890, now seen corresponding path program 284 times [2019-08-05 11:12:40,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:40,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:40,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:40,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:40,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:40,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:40,906 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand 29 states. [2019-08-05 11:12:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,255 INFO L93 Difference]: Finished difference Result 269 states and 313 transitions. [2019-08-05 11:12:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:41,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,256 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:41,256 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:41,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 145. [2019-08-05 11:12:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:12:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2019-08-05 11:12:41,260 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 101 [2019-08-05 11:12:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,260 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2019-08-05 11:12:41,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2019-08-05 11:12:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:41,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,261 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:41,261 INFO L418 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash 439397182, now seen corresponding path program 285 times [2019-08-05 11:12:41,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:41,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:41,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:41,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:41,516 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand 29 states. [2019-08-05 11:12:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:41,942 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2019-08-05 11:12:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:41,943 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:41,944 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:41,944 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:41,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 149. [2019-08-05 11:12:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:12:41,948 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:12:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:41,948 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:12:41,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:12:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:41,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:41,949 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:41,949 INFO L418 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash 712679614, now seen corresponding path program 286 times [2019-08-05 11:12:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:41,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:41,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 230 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:42,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:42,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:42,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:42,198 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:12:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:42,686 INFO L93 Difference]: Finished difference Result 269 states and 310 transitions. [2019-08-05 11:12:42,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:42,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:42,688 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:12:42,688 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:12:42,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:12:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2019-08-05 11:12:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:12:42,692 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:12:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:42,692 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:12:42,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:12:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:42,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:42,693 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:42,693 INFO L418 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash 184998591, now seen corresponding path program 287 times [2019-08-05 11:12:42,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:42,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:42,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 5 proven. 227 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:42,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:42,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:42,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:42,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:42,942 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:12:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:43,466 INFO L93 Difference]: Finished difference Result 265 states and 308 transitions. [2019-08-05 11:12:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:43,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:43,467 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:12:43,468 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:12:43,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:12:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 161. [2019-08-05 11:12:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:12:43,471 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:12:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:43,472 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:12:43,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:12:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:43,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:43,472 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:43,472 INFO L418 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash -437986499, now seen corresponding path program 288 times [2019-08-05 11:12:43,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:43,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:43,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 8 proven. 242 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:43,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:43,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:43,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:43,725 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:12:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,142 INFO L93 Difference]: Finished difference Result 253 states and 294 transitions. [2019-08-05 11:12:44,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:44,142 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,143 INFO L225 Difference]: With dead ends: 253 [2019-08-05 11:12:44,144 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 11:12:44,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 11:12:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 133. [2019-08-05 11:12:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 11:12:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2019-08-05 11:12:44,148 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 101 [2019-08-05 11:12:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,148 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2019-08-05 11:12:44,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2019-08-05 11:12:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:44,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,149 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:12:44,149 INFO L418 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1335664704, now seen corresponding path program 289 times [2019-08-05 11:12:44,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 4 proven. 217 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-08-05 11:12:44,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:44,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:44,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:44,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:44,381 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 28 states. [2019-08-05 11:12:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:44,631 INFO L93 Difference]: Finished difference Result 221 states and 251 transitions. [2019-08-05 11:12:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:44,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:44,632 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:12:44,632 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:12:44,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:12:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 101. [2019-08-05 11:12:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:12:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2019-08-05 11:12:44,636 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 101 [2019-08-05 11:12:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:44,636 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2019-08-05 11:12:44,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2019-08-05 11:12:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:44,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:44,637 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:12:44,637 INFO L418 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash -198928960, now seen corresponding path program 290 times [2019-08-05 11:12:44,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:44,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:44,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 216 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-08-05 11:12:44,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:44,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:44,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:44,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:44,885 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 28 states. [2019-08-05 11:12:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:45,087 INFO L93 Difference]: Finished difference Result 265 states and 300 transitions. [2019-08-05 11:12:45,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:45,087 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:45,088 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:12:45,088 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:12:45,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:12:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:12:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 137. [2019-08-05 11:12:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:12:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2019-08-05 11:12:45,093 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 101 [2019-08-05 11:12:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:45,093 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2019-08-05 11:12:45,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2019-08-05 11:12:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:45,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:45,093 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:45,093 INFO L418 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1349595073, now seen corresponding path program 291 times [2019-08-05 11:12:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:45,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:45,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 6 proven. 226 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:45,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:45,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:45,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:45,599 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 29 states. [2019-08-05 11:12:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,121 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-08-05 11:12:46,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:12:46,122 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,123 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:46,123 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:46,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=2101, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:12:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 129. [2019-08-05 11:12:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:12:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2019-08-05 11:12:46,127 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 101 [2019-08-05 11:12:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,127 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2019-08-05 11:12:46,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2019-08-05 11:12:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:46,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,128 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:12:46,128 INFO L418 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1994549307, now seen corresponding path program 292 times [2019-08-05 11:12:46,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-08-05 11:12:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:46,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:46,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:46,352 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 28 states. [2019-08-05 11:12:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:46,675 INFO L93 Difference]: Finished difference Result 205 states and 233 transitions. [2019-08-05 11:12:46,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:46,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:46,676 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:12:46,676 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:12:46,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:12:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2019-08-05 11:12:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:12:46,680 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:12:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:46,680 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:12:46,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:12:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:46,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:46,681 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:46,681 INFO L418 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash -644840001, now seen corresponding path program 293 times [2019-08-05 11:12:46,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:46,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:46,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 7 proven. 229 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:46,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:46,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:46,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:46,942 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:12:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:47,388 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2019-08-05 11:12:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:47,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:47,390 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:12:47,390 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:12:47,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=1684, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:12:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 165. [2019-08-05 11:12:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:12:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:12:47,394 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:12:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:47,394 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:12:47,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:12:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:47,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:47,395 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:47,395 INFO L418 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1149751876, now seen corresponding path program 294 times [2019-08-05 11:12:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:47,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:47,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 1 proven. 256 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-08-05 11:12:47,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:47,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:47,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:47,615 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 28 states. [2019-08-05 11:12:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,046 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2019-08-05 11:12:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:48,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,048 INFO L225 Difference]: With dead ends: 257 [2019-08-05 11:12:48,048 INFO L226 Difference]: Without dead ends: 257 [2019-08-05 11:12:48,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-08-05 11:12:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 161. [2019-08-05 11:12:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:12:48,052 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:12:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,052 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:12:48,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:12:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:48,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,053 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:48,053 INFO L418 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1423034308, now seen corresponding path program 295 times [2019-08-05 11:12:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 2 proven. 263 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:12:48,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:48,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:48,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:48,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:48,322 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:12:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,687 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2019-08-05 11:12:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:48,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,688 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:48,688 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:48,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 157. [2019-08-05 11:12:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:12:48,694 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:12:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,694 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:12:48,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:12:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:48,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,695 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:48,695 INFO L418 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -371557569, now seen corresponding path program 296 times [2019-08-05 11:12:48,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 8 proven. 224 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:49,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:49,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:49,022 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:12:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:49,482 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2019-08-05 11:12:49,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:49,483 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:49,484 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:12:49,484 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:12:49,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1932, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:12:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:12:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 161. [2019-08-05 11:12:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:12:49,488 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:12:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:49,488 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:12:49,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:12:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:49,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:49,489 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:49,489 INFO L418 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:49,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:49,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2127789380, now seen corresponding path program 297 times [2019-08-05 11:12:49,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:49,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:49,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 3 proven. 262 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:12:49,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:49,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:49,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:49,723 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:12:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:50,105 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2019-08-05 11:12:50,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:50,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:50,107 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:12:50,107 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:12:50,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:12:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 169. [2019-08-05 11:12:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:12:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:12:50,111 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:12:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:50,112 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:12:50,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:12:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:50,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:50,112 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:50,112 INFO L418 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:50,113 INFO L82 PathProgramCache]: Analyzing trace with hash -977123267, now seen corresponding path program 298 times [2019-08-05 11:12:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:50,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:12:50,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 2 proven. 240 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-08-05 11:12:50,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:50,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:12:50,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:12:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:12:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:12:50,587 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 28 states. [2019-08-05 11:12:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,021 INFO L93 Difference]: Finished difference Result 293 states and 333 transitions. [2019-08-05 11:12:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:12:51,022 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:12:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,023 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:12:51,023 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:12:51,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:12:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:12:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 157. [2019-08-05 11:12:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:12:51,026 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:12:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,027 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:12:51,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:12:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:12:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:51,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,027 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:51,028 INFO L418 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1522223682, now seen corresponding path program 299 times [2019-08-05 11:12:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:51,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:51,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:51,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:51,274 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:12:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:51,723 INFO L93 Difference]: Finished difference Result 281 states and 327 transitions. [2019-08-05 11:12:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:51,723 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:51,725 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:51,725 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:51,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=1678, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 141. [2019-08-05 11:12:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:12:51,729 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:12:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:51,729 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:12:51,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:12:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:51,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:51,730 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:51,730 INFO L418 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1826505921, now seen corresponding path program 300 times [2019-08-05 11:12:51,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:51,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:51,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 9 proven. 227 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:51,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:51,981 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:12:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:52,460 INFO L93 Difference]: Finished difference Result 281 states and 322 transitions. [2019-08-05 11:12:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:52,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:52,462 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:52,462 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:52,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 153. [2019-08-05 11:12:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:12:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:12:52,466 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:12:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:52,467 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:12:52,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:12:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:52,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:52,467 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:52,467 INFO L418 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1553223489, now seen corresponding path program 301 times [2019-08-05 11:12:52,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:52,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:52,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:12:52,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:52,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:52,741 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:12:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,148 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2019-08-05 11:12:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:53,149 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,150 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:53,150 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:53,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1772, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:12:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 157. [2019-08-05 11:12:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:12:53,154 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:12:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,154 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:12:53,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:12:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:53,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,155 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:53,155 INFO L418 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1591077694, now seen corresponding path program 302 times [2019-08-05 11:12:53,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:53,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:53,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:53,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:53,431 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:12:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:53,824 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2019-08-05 11:12:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:53,825 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:53,826 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:12:53,826 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:12:53,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:12:53,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 145. [2019-08-05 11:12:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:12:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:12:53,830 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:12:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:53,831 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:12:53,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:12:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:53,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:53,831 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:12:53,831 INFO L418 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1619338815, now seen corresponding path program 303 times [2019-08-05 11:12:53,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:53,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:53,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 10 proven. 222 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:12:54,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:54,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:54,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:54,080 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:12:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:54,514 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2019-08-05 11:12:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:54,514 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:54,516 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:12:54,516 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:12:54,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:12:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:12:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 157. [2019-08-05 11:12:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:12:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:12:54,521 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:12:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:54,521 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:12:54,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:12:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:54,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:54,522 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:54,522 INFO L418 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:54,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:54,523 INFO L82 PathProgramCache]: Analyzing trace with hash 468672702, now seen corresponding path program 304 times [2019-08-05 11:12:54,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:54,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:54,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 234 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:54,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:54,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:54,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:54,797 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:12:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:55,187 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2019-08-05 11:12:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:55,188 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:55,189 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:55,189 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:55,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 149. [2019-08-05 11:12:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:12:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2019-08-05 11:12:55,193 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 101 [2019-08-05 11:12:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:55,193 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2019-08-05 11:12:55,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2019-08-05 11:12:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:55,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:55,194 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:55,194 INFO L418 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1005384388, now seen corresponding path program 305 times [2019-08-05 11:12:55,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:55,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:55,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 4 proven. 261 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:12:55,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:55,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:55,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:55,564 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 29 states. [2019-08-05 11:12:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,077 INFO L93 Difference]: Finished difference Result 289 states and 336 transitions. [2019-08-05 11:12:56,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:56,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,079 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:12:56,079 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:12:56,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:12:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:12:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 161. [2019-08-05 11:12:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:12:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:12:56,083 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:12:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,083 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:12:56,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:12:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:56,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,084 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:56,084 INFO L418 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1173427774, now seen corresponding path program 306 times [2019-08-05 11:12:56,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:12:56,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:56,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:56,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:56,355 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:12:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:56,771 INFO L93 Difference]: Finished difference Result 293 states and 339 transitions. [2019-08-05 11:12:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:56,772 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:56,773 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:12:56,773 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:12:56,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:12:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 165. [2019-08-05 11:12:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:12:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:12:56,777 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:12:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:56,777 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:12:56,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:12:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:56,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:56,778 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:12:56,778 INFO L418 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1446710206, now seen corresponding path program 307 times [2019-08-05 11:12:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:56,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:56,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 230 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:12:57,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:57,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:57,027 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 29 states. [2019-08-05 11:12:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:57,508 INFO L93 Difference]: Finished difference Result 289 states and 333 transitions. [2019-08-05 11:12:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:57,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:57,509 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:12:57,510 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:12:57,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:12:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 169. [2019-08-05 11:12:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:12:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2019-08-05 11:12:57,514 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 101 [2019-08-05 11:12:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:57,515 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2019-08-05 11:12:57,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2019-08-05 11:12:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:57,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:57,515 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:57,515 INFO L418 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 296044093, now seen corresponding path program 308 times [2019-08-05 11:12:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:57,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:57,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 8 proven. 242 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:57,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:57,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:57,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:57,768 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand 29 states. [2019-08-05 11:12:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,144 INFO L93 Difference]: Finished difference Result 273 states and 318 transitions. [2019-08-05 11:12:58,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:58,145 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,146 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:12:58,146 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:12:58,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1436, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:12:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:12:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 145. [2019-08-05 11:12:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:12:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:12:58,150 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:12:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,150 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:12:58,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:12:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:58,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,150 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:58,151 INFO L418 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 145281725, now seen corresponding path program 309 times [2019-08-05 11:12:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 245 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:58,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:58,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:58,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:58,403 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:12:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:58,894 INFO L93 Difference]: Finished difference Result 285 states and 325 transitions. [2019-08-05 11:12:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:58,895 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:58,896 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:12:58,896 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:12:58,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:12:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:12:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 141. [2019-08-05 11:12:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:12:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:12:58,902 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:12:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:58,903 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:12:58,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:12:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:58,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:58,911 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:12:58,911 INFO L418 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash -128000707, now seen corresponding path program 310 times [2019-08-05 11:12:58,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:58,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:58,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 3 proven. 247 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:12:59,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:59,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:59,180 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:12:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:59,646 INFO L93 Difference]: Finished difference Result 281 states and 321 transitions. [2019-08-05 11:12:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:59,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:12:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:59,648 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:12:59,648 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:12:59,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1826, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:12:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:12:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 129. [2019-08-05 11:12:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 11:12:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2019-08-05 11:12:59,652 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 101 [2019-08-05 11:12:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:59,652 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 149 transitions. [2019-08-05 11:12:59,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:12:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions. [2019-08-05 11:12:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:12:59,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:59,653 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:12:59,653 INFO L418 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 176281532, now seen corresponding path program 311 times [2019-08-05 11:12:59,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:59,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:12:59,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 5 proven. 260 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:12:59,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:12:59,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:12:59,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:12:59,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:59,926 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand 29 states. [2019-08-05 11:13:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:00,300 INFO L93 Difference]: Finished difference Result 273 states and 317 transitions. [2019-08-05 11:13:00,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:00,300 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:00,301 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:13:00,301 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:13:00,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:13:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 145. [2019-08-05 11:13:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:13:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:13:00,305 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:13:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:00,306 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:13:00,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:13:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:00,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:00,306 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:00,306 INFO L418 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:00,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:00,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1103261887, now seen corresponding path program 312 times [2019-08-05 11:13:00,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:00,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:00,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 11 proven. 225 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:13:00,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:00,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:00,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:00,707 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:13:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:01,257 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2019-08-05 11:13:01,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:13:01,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:01,259 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:13:01,259 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:13:01,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:13:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 165. [2019-08-05 11:13:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:13:01,263 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:13:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:01,263 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:13:01,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:13:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:01,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:01,264 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:01,264 INFO L418 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1326947645, now seen corresponding path program 313 times [2019-08-05 11:13:01,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:01,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:01,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:13:01,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:01,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:01,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:01,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:01,514 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:13:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,019 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2019-08-05 11:13:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:02,019 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,020 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:13:02,021 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:13:02,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:13:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 161. [2019-08-05 11:13:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:13:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:13:02,026 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:13:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,026 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:13:02,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:13:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:02,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,027 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:02,027 INFO L418 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1053665213, now seen corresponding path program 314 times [2019-08-05 11:13:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 249 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:02,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:02,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:02,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:02,328 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:13:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:02,685 INFO L93 Difference]: Finished difference Result 305 states and 350 transitions. [2019-08-05 11:13:02,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:02,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:02,687 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:13:02,687 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:13:02,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:13:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 157. [2019-08-05 11:13:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:13:02,691 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:13:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:02,691 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:13:02,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:13:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:02,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:02,692 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:02,692 INFO L418 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:02,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1376544319, now seen corresponding path program 315 times [2019-08-05 11:13:02,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:02,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:02,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 13 proven. 223 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:13:02,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:02,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:02,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:02,935 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:13:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:03,384 INFO L93 Difference]: Finished difference Result 281 states and 321 transitions. [2019-08-05 11:13:03,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:03,385 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:03,386 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:13:03,386 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:13:03,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1772, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:13:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 161. [2019-08-05 11:13:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:13:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:13:03,390 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:13:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:03,390 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:13:03,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:13:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:03,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:03,391 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:03,391 INFO L418 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash 225878206, now seen corresponding path program 316 times [2019-08-05 11:13:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:03,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:03,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 12 proven. 231 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:03,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:03,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:03,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:03,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:03,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:03,648 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:13:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,095 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2019-08-05 11:13:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:04,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,096 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:13:04,096 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:13:04,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:13:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:13:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 149. [2019-08-05 11:13:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:13:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:13:04,101 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:13:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,101 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:13:04,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:13:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:04,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,102 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:04,102 INFO L418 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash 348910141, now seen corresponding path program 317 times [2019-08-05 11:13:04,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 4 proven. 246 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:13:04,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:04,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:04,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:04,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:04,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:04,364 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:13:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:04,845 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2019-08-05 11:13:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:04,845 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:04,846 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:13:04,846 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:13:04,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:13:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 157. [2019-08-05 11:13:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:13:04,850 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 101 [2019-08-05 11:13:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:04,850 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:13:04,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:13:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:04,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:04,851 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:04,851 INFO L418 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 254139327, now seen corresponding path program 318 times [2019-08-05 11:13:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:04,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:04,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 15 proven. 221 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-08-05 11:13:05,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:05,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:05,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:05,090 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 29 states. [2019-08-05 11:13:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:05,593 INFO L93 Difference]: Finished difference Result 285 states and 325 transitions. [2019-08-05 11:13:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:05,593 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:05,594 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:13:05,595 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:13:05,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1689, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:13:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:13:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 169. [2019-08-05 11:13:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2019-08-05 11:13:05,599 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 101 [2019-08-05 11:13:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:05,599 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2019-08-05 11:13:05,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2019-08-05 11:13:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:05,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:05,600 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:05,600 INFO L418 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1499576254, now seen corresponding path program 319 times [2019-08-05 11:13:05,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:05,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:13:05,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 3 proven. 228 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-08-05 11:13:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:13:06,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:13:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:13:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:13:06,109 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 28 states. [2019-08-05 11:13:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:06,440 INFO L93 Difference]: Finished difference Result 305 states and 346 transitions. [2019-08-05 11:13:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:13:06,440 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-08-05 11:13:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:06,441 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:13:06,441 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:13:06,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1300, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:13:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:13:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 149. [2019-08-05 11:13:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 11:13:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2019-08-05 11:13:06,445 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 101 [2019-08-05 11:13:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:06,445 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2019-08-05 11:13:06,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:13:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2019-08-05 11:13:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:06,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:06,446 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:06,446 INFO L418 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash -896526786, now seen corresponding path program 320 times [2019-08-05 11:13:06,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:06,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:13:06,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 12 proven. 231 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:06,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:06,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:06,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:06,694 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 29 states. [2019-08-05 11:13:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,077 INFO L93 Difference]: Finished difference Result 269 states and 311 transitions. [2019-08-05 11:13:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:07,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,078 INFO L225 Difference]: With dead ends: 269 [2019-08-05 11:13:07,078 INFO L226 Difference]: Without dead ends: 269 [2019-08-05 11:13:07,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-08-05 11:13:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 141. [2019-08-05 11:13:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:13:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:13:07,081 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:13:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,082 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:13:07,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:13:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:07,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,082 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:07,082 INFO L418 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,083 INFO L82 PathProgramCache]: Analyzing trace with hash -191771714, now seen corresponding path program 321 times [2019-08-05 11:13:07,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 11 proven. 232 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:07,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:07,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:07,351 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:13:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:07,713 INFO L93 Difference]: Finished difference Result 265 states and 306 transitions. [2019-08-05 11:13:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:07,714 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:07,715 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:13:07,715 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:13:07,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:13:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 145. [2019-08-05 11:13:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:13:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:13:07,719 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:13:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:07,719 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:13:07,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:13:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:07,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:07,720 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:07,720 INFO L418 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash -82255300, now seen corresponding path program 322 times [2019-08-05 11:13:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:07,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:07,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 6 proven. 259 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:13:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:07,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:07,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:07,959 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:13:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:08,344 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2019-08-05 11:13:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:08,345 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:08,346 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:13:08,346 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:13:08,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:13:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 165. [2019-08-05 11:13:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:13:08,350 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:13:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:08,351 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:13:08,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:13:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:08,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:08,352 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:08,352 INFO L418 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1068410813, now seen corresponding path program 323 times [2019-08-05 11:13:08,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:08,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:08,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 243 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:13:08,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:08,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:08,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:08,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:08,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:08,594 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 29 states. [2019-08-05 11:13:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,093 INFO L93 Difference]: Finished difference Result 297 states and 341 transitions. [2019-08-05 11:13:09,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:09,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,095 INFO L225 Difference]: With dead ends: 297 [2019-08-05 11:13:09,095 INFO L226 Difference]: Without dead ends: 297 [2019-08-05 11:13:09,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-08-05 11:13:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 161. [2019-08-05 11:13:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:13:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:13:09,099 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:13:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,099 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:13:09,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:13:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:09,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,100 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:09,100 INFO L418 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,100 INFO L82 PathProgramCache]: Analyzing trace with hash 81510718, now seen corresponding path program 324 times [2019-08-05 11:13:09,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 14 proven. 229 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:09,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:09,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:09,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:09,342 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:13:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:09,793 INFO L93 Difference]: Finished difference Result 285 states and 329 transitions. [2019-08-05 11:13:09,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:09,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:09,795 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:13:09,795 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:13:09,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1842, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:13:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2019-08-05 11:13:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:13:09,799 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:13:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:09,800 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:13:09,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:13:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:09,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:09,800 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:09,800 INFO L418 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash 795128381, now seen corresponding path program 325 times [2019-08-05 11:13:09,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:09,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:09,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 248 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:10,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:10,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:10,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:10,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:10,066 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 29 states. [2019-08-05 11:13:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:10,427 INFO L93 Difference]: Finished difference Result 301 states and 347 transitions. [2019-08-05 11:13:10,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:10,427 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:10,429 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:13:10,429 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:13:10,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:13:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 161. [2019-08-05 11:13:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:13:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2019-08-05 11:13:10,435 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 101 [2019-08-05 11:13:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:10,435 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2019-08-05 11:13:10,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2019-08-05 11:13:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:10,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:10,436 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:10,436 INFO L418 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 90373309, now seen corresponding path program 326 times [2019-08-05 11:13:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:10,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:10,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 247 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:10,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:10,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:10,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:10,696 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 29 states. [2019-08-05 11:13:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,288 INFO L93 Difference]: Finished difference Result 305 states and 353 transitions. [2019-08-05 11:13:11,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:11,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:11,290 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:13:11,290 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:13:11,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:13:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 169. [2019-08-05 11:13:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:13:11,294 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:13:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:11,295 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:13:11,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:13:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:11,295 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:11,295 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:11,295 INFO L418 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1241039422, now seen corresponding path program 327 times [2019-08-05 11:13:11,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:11,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:11,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 231 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:13:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:11,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:11,536 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:13:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:11,999 INFO L93 Difference]: Finished difference Result 305 states and 348 transitions. [2019-08-05 11:13:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:12,000 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,001 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:13:12,001 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:13:12,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:13:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 157. [2019-08-05 11:13:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:13:12,005 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:13:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,005 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:13:12,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:13:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:12,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,006 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:12,006 INFO L418 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1212778301, now seen corresponding path program 328 times [2019-08-05 11:13:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 5 proven. 245 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:13:12,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:12,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:12,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:12,240 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:13:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:12,705 INFO L93 Difference]: Finished difference Result 301 states and 349 transitions. [2019-08-05 11:13:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:12,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:12,706 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:13:12,706 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:13:12,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=1664, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:13:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:13:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 169. [2019-08-05 11:13:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:13:12,711 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:13:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:12,711 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:13:12,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:13:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:12,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:12,712 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:12,712 INFO L418 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:12,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1931522882, now seen corresponding path program 329 times [2019-08-05 11:13:12,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:12,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:12,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 233 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:13:12,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:12,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:12,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:12,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:12,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:12,955 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:13:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:13,459 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2019-08-05 11:13:13,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:13,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:13,461 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:13:13,461 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:13:13,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:13:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 165. [2019-08-05 11:13:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:13:13,466 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:13:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:13,466 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:13:13,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:13:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:13,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:13,467 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:13,467 INFO L418 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2090161982, now seen corresponding path program 330 times [2019-08-05 11:13:13,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:13,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:13,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 4 proven. 235 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:13:13,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:13,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:13,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:13,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:13,748 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:13:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,251 INFO L93 Difference]: Finished difference Result 301 states and 345 transitions. [2019-08-05 11:13:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:13:14,251 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,252 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:13:14,253 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:13:14,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1930, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:13:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 145. [2019-08-05 11:13:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:13:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:13:14,256 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:13:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,257 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:13:14,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:13:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:14,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,257 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:14,257 INFO L418 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1282944188, now seen corresponding path program 331 times [2019-08-05 11:13:14,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 7 proven. 258 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-08-05 11:13:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:14,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:14,505 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:13:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:14,894 INFO L93 Difference]: Finished difference Result 273 states and 317 transitions. [2019-08-05 11:13:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:14,894 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:14,896 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:13:14,896 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:13:14,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:13:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 169. [2019-08-05 11:13:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2019-08-05 11:13:14,900 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 101 [2019-08-05 11:13:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:14,900 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2019-08-05 11:13:14,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2019-08-05 11:13:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:14,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:14,901 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:14,901 INFO L418 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1861356995, now seen corresponding path program 332 times [2019-08-05 11:13:14,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:14,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:14,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 8 proven. 242 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:13:15,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:15,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:15,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:15,167 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand 29 states. [2019-08-05 11:13:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:15,656 INFO L93 Difference]: Finished difference Result 305 states and 351 transitions. [2019-08-05 11:13:15,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:15,657 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:15,657 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:13:15,657 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:13:15,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1909, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:13:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:13:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 165. [2019-08-05 11:13:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2019-08-05 11:13:15,661 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 101 [2019-08-05 11:13:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:15,662 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2019-08-05 11:13:15,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2019-08-05 11:13:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:15,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:15,662 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:15,662 INFO L418 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:15,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:15,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1069155395, now seen corresponding path program 333 times [2019-08-05 11:13:15,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:15,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:15,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 13 proven. 241 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:15,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:15,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:15,980 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 29 states. [2019-08-05 11:13:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:16,489 INFO L93 Difference]: Finished difference Result 281 states and 328 transitions. [2019-08-05 11:13:16,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:16,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:16,491 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:13:16,491 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:13:16,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:13:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 145. [2019-08-05 11:13:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 11:13:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2019-08-05 11:13:16,495 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 101 [2019-08-05 11:13:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:16,495 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2019-08-05 11:13:16,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2019-08-05 11:13:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:16,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:16,496 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:16,496 INFO L418 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2134639427, now seen corresponding path program 334 times [2019-08-05 11:13:16,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:16,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:16,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 7 proven. 247 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:16,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:16,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:16,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:16,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:16,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:16,773 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand 29 states. [2019-08-05 11:13:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,141 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2019-08-05 11:13:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:17,141 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,142 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:13:17,142 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:13:17,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:13:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 141. [2019-08-05 11:13:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:13:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:13:17,147 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:13:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,147 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:13:17,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:13:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:17,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,148 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:17,148 INFO L418 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 512676159, now seen corresponding path program 335 times [2019-08-05 11:13:17,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 12 proven. 220 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-08-05 11:13:17,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:17,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:17,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:17,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:17,390 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:13:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:17,834 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2019-08-05 11:13:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:17,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:17,836 INFO L225 Difference]: With dead ends: 277 [2019-08-05 11:13:17,836 INFO L226 Difference]: Without dead ends: 277 [2019-08-05 11:13:17,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:13:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-08-05 11:13:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 161. [2019-08-05 11:13:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:13:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:13:17,840 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:13:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:17,840 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:13:17,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:13:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:17,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:17,841 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:17,841 INFO L418 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -637989954, now seen corresponding path program 336 times [2019-08-05 11:13:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:17,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:17,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 11 proven. 232 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:18,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:18,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:18,092 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:13:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:18,537 INFO L93 Difference]: Finished difference Result 281 states and 325 transitions. [2019-08-05 11:13:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:18,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:18,539 INFO L225 Difference]: With dead ends: 281 [2019-08-05 11:13:18,539 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 11:13:18,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:13:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 11:13:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 153. [2019-08-05 11:13:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:13:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:13:18,543 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:13:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:18,543 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:13:18,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:13:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:18,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:18,544 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:18,544 INFO L418 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 66765118, now seen corresponding path program 337 times [2019-08-05 11:13:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:18,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:13:18,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:18,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:18,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:18,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:18,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:18,793 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:13:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,156 INFO L93 Difference]: Finished difference Result 273 states and 315 transitions. [2019-08-05 11:13:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:19,157 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,158 INFO L225 Difference]: With dead ends: 273 [2019-08-05 11:13:19,158 INFO L226 Difference]: Without dead ends: 273 [2019-08-05 11:13:19,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-08-05 11:13:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 157. [2019-08-05 11:13:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:13:19,162 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:13:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,162 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:13:19,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:13:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:19,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,162 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:19,163 INFO L418 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1455572797, now seen corresponding path program 338 times [2019-08-05 11:13:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 8 proven. 246 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:19,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:19,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:19,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:19,404 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:13:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:19,775 INFO L93 Difference]: Finished difference Result 309 states and 358 transitions. [2019-08-05 11:13:19,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:19,776 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:19,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:19,777 INFO L225 Difference]: With dead ends: 309 [2019-08-05 11:13:19,777 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 11:13:19,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 11:13:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 165. [2019-08-05 11:13:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:13:19,782 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:13:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:19,783 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:13:19,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:13:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:19,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:19,783 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:19,783 INFO L418 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 340047550, now seen corresponding path program 339 times [2019-08-05 11:13:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:19,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:19,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 13 proven. 230 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:20,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:20,051 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:13:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:20,517 INFO L93 Difference]: Finished difference Result 285 states and 328 transitions. [2019-08-05 11:13:20,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:20,517 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:20,518 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:13:20,518 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:13:20,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1842, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:13:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 169. [2019-08-05 11:13:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:13:20,524 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:13:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:20,524 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:13:20,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:13:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:20,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:20,525 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:20,525 INFO L418 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1688728386, now seen corresponding path program 340 times [2019-08-05 11:13:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:20,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:20,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 9 proven. 230 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:13:20,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:20,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:20,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:20,773 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:13:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:21,404 INFO L93 Difference]: Finished difference Result 313 states and 358 transitions. [2019-08-05 11:13:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:21,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:21,406 INFO L225 Difference]: With dead ends: 313 [2019-08-05 11:13:21,406 INFO L226 Difference]: Without dead ends: 313 [2019-08-05 11:13:21,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-08-05 11:13:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 157. [2019-08-05 11:13:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:13:21,411 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:13:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:21,411 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:13:21,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:13:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:21,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:21,411 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:21,412 INFO L418 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash -810618563, now seen corresponding path program 341 times [2019-08-05 11:13:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:21,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:21,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 12 proven. 242 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:21,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:21,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:21,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:21,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:21,812 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:13:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:22,203 INFO L93 Difference]: Finished difference Result 265 states and 308 transitions. [2019-08-05 11:13:22,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:22,204 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:22,205 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:13:22,205 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:13:22,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:13:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 141. [2019-08-05 11:13:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 11:13:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2019-08-05 11:13:22,209 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 101 [2019-08-05 11:13:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:22,209 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2019-08-05 11:13:22,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2019-08-05 11:13:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:22,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:22,210 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:22,210 INFO L418 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1716989507, now seen corresponding path program 342 times [2019-08-05 11:13:22,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:22,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:22,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 9 proven. 245 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:22,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:22,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:22,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:22,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:22,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:22,521 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand 29 states. [2019-08-05 11:13:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:22,919 INFO L93 Difference]: Finished difference Result 289 states and 335 transitions. [2019-08-05 11:13:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:22,920 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:22,921 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:13:22,921 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:13:22,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:13:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 153. [2019-08-05 11:13:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:13:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:13:22,926 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:13:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:22,926 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:13:22,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:13:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:22,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:22,927 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:22,927 INFO L418 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1114900802, now seen corresponding path program 343 times [2019-08-05 11:13:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:22,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:22,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:23,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:23,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:23,187 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:13:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:23,682 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2019-08-05 11:13:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:23,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:23,684 INFO L225 Difference]: With dead ends: 293 [2019-08-05 11:13:23,684 INFO L226 Difference]: Without dead ends: 293 [2019-08-05 11:13:23,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-08-05 11:13:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 165. [2019-08-05 11:13:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:13:23,689 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:13:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:23,689 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:13:23,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:13:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:23,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:23,690 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:23,690 INFO L418 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash -566323394, now seen corresponding path program 344 times [2019-08-05 11:13:23,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:23,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:23,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 233 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:23,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:23,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:23,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:23,948 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:13:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:24,437 INFO L93 Difference]: Finished difference Result 301 states and 345 transitions. [2019-08-05 11:13:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:24,437 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:24,438 INFO L225 Difference]: With dead ends: 301 [2019-08-05 11:13:24,439 INFO L226 Difference]: Without dead ends: 301 [2019-08-05 11:13:24,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1842, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-08-05 11:13:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 161. [2019-08-05 11:13:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:13:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2019-08-05 11:13:24,443 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 101 [2019-08-05 11:13:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:24,443 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2019-08-05 11:13:24,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2019-08-05 11:13:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:24,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:24,444 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:24,444 INFO L418 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash -841618370, now seen corresponding path program 345 times [2019-08-05 11:13:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:24,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:24,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 12 proven. 231 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:24,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:24,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:24,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:24,687 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand 29 states. [2019-08-05 11:13:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:25,137 INFO L93 Difference]: Finished difference Result 285 states and 327 transitions. [2019-08-05 11:13:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:25,138 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:25,139 INFO L225 Difference]: With dead ends: 285 [2019-08-05 11:13:25,139 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 11:13:25,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1842, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 11:13:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2019-08-05 11:13:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 11:13:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2019-08-05 11:13:25,144 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 101 [2019-08-05 11:13:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:25,144 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2019-08-05 11:13:25,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2019-08-05 11:13:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:25,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:25,144 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:25,145 INFO L418 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:25,145 INFO L82 PathProgramCache]: Analyzing trace with hash -839605826, now seen corresponding path program 346 times [2019-08-05 11:13:25,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:25,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:25,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 8 proven. 235 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:25,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:25,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:25,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:25,417 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 29 states. [2019-08-05 11:13:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:25,913 INFO L93 Difference]: Finished difference Result 309 states and 355 transitions. [2019-08-05 11:13:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:25,913 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:25,914 INFO L225 Difference]: With dead ends: 309 [2019-08-05 11:13:25,915 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 11:13:25,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:13:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 11:13:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 153. [2019-08-05 11:13:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:13:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:13:25,919 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:13:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:25,919 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:13:25,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:13:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:25,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:25,919 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:25,920 INFO L418 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash -535323587, now seen corresponding path program 347 times [2019-08-05 11:13:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:25,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:25,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 6 proven. 244 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-08-05 11:13:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:26,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:26,450 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. [2019-08-05 11:13:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:26,964 INFO L93 Difference]: Finished difference Result 309 states and 359 transitions. [2019-08-05 11:13:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:26,965 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:26,966 INFO L225 Difference]: With dead ends: 309 [2019-08-05 11:13:26,966 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 11:13:26,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=1586, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:13:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 11:13:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 169. [2019-08-05 11:13:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:13:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2019-08-05 11:13:26,970 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 101 [2019-08-05 11:13:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:26,971 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2019-08-05 11:13:26,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2019-08-05 11:13:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:26,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:26,971 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:26,971 INFO L418 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1992284483, now seen corresponding path program 348 times [2019-08-05 11:13:26,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:26,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:26,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 11 proven. 243 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-08-05 11:13:27,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:27,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:27,222 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand 29 states. [2019-08-05 11:13:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:27,612 INFO L93 Difference]: Finished difference Result 289 states and 336 transitions. [2019-08-05 11:13:27,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:27,613 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:27,614 INFO L225 Difference]: With dead ends: 289 [2019-08-05 11:13:27,614 INFO L226 Difference]: Without dead ends: 289 [2019-08-05 11:13:27,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:13:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-08-05 11:13:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 157. [2019-08-05 11:13:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:13:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-08-05 11:13:27,618 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 101 [2019-08-05 11:13:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:27,618 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-08-05 11:13:27,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-08-05 11:13:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:27,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,619 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:27,619 INFO L418 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 615342526, now seen corresponding path program 349 times [2019-08-05 11:13:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 7 proven. 232 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-08-05 11:13:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:27,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:27,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:27,934 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 29 states. [2019-08-05 11:13:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,403 INFO L93 Difference]: Finished difference Result 305 states and 350 transitions. [2019-08-05 11:13:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:13:28,403 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-08-05 11:13:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,404 INFO L225 Difference]: With dead ends: 305 [2019-08-05 11:13:28,404 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 11:13:28,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:13:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 11:13:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 153. [2019-08-05 11:13:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 11:13:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2019-08-05 11:13:28,409 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 101 [2019-08-05 11:13:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,409 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2019-08-05 11:13:28,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:13:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2019-08-05 11:13:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:28,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,410 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:28,410 INFO L418 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,410 INFO L82 PathProgramCache]: Analyzing trace with hash 342060094, now seen corresponding path program 350 times [2019-08-05 11:13:28,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 237 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-08-05 11:13:28,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:13:28,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:13:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:13:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:13:28,672 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 29 states. Received shutdown request... [2019-08-05 11:13:28,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:13:28,725 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:13:28,731 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:13:28,732 INFO L202 PluginConnector]: Adding new model recursive-CallABAB.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:13:28 BoogieIcfgContainer [2019-08-05 11:13:28,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:13:28,733 INFO L168 Benchmark]: Toolchain (without parser) took 236491.63 ms. Allocated memory was 132.1 MB in the beginning and 820.0 MB in the end (delta: 687.9 MB). Free memory was 108.5 MB in the beginning and 230.5 MB in the end (delta: -122.0 MB). Peak memory consumption was 565.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:28,734 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 109.8 MB in the beginning and 109.6 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:13:28,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.14 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 106.9 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:13:28,735 INFO L168 Benchmark]: Boogie Preprocessor took 20.97 ms. Allocated memory is still 132.1 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:28,735 INFO L168 Benchmark]: RCFGBuilder took 344.77 ms. Allocated memory is still 132.1 MB. Free memory was 105.6 MB in the beginning and 95.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:28,736 INFO L168 Benchmark]: TraceAbstraction took 236082.89 ms. Allocated memory was 132.1 MB in the beginning and 820.0 MB in the end (delta: 687.9 MB). Free memory was 94.8 MB in the beginning and 230.5 MB in the end (delta: -135.7 MB). Peak memory consumption was 552.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:28,738 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 109.8 MB in the beginning and 109.6 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 38.14 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 106.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.97 ms. Allocated memory is still 132.1 MB. Free memory was 106.9 MB in the beginning and 105.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.77 ms. Allocated memory is still 132.1 MB. Free memory was 105.6 MB in the beginning and 95.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236082.89 ms. Allocated memory was 132.1 MB in the beginning and 820.0 MB in the end (delta: 687.9 MB). Free memory was 94.8 MB in the beginning and 230.5 MB in the end (delta: -135.7 MB). Peak memory consumption was 552.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (153states) and FLOYD_HOARE automaton (currently 5 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (10 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 16 locations, 1 error locations. TIMEOUT Result, 236.0s OverallTime, 354 OverallIterations, 13 TraceHistogramMax, 131.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5791 SDtfs, 3104 SDslu, 56015 SDs, 0 SdLazy, 65435 SolverSat, 6535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34327 GetRequests, 22014 SyntacticMatches, 0 SemanticMatches, 12313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65089 ImplicationChecksByTransitivity, 161.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=301, 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: 1.4s AutomataMinimizationTime, 353 MinimizatonAttempts, 31766 StatesRemovedByMinimization, 351 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 99.7s InterpolantComputationTime, 30530 NumberOfCodeBlocks, 30530 NumberOfCodeBlocksAsserted, 354 NumberOfCheckSat, 30176 ConstructedInterpolants, 0 QuantifiedInterpolants, 5565552 SizeOfPredicates, 1116 NumberOfNonLiveVariables, 77210 ConjunctsInSsa, 9008 ConjunctsInUnsatCore, 354 InterpolantComputations, 3 PerfectInterpolantSequences, 54230/116565 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown