java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:47,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:47,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:47,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:47,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:47,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:47,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:47,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:47,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:47,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:47,266 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:47,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:47,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:47,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:47,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:47,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:47,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:47,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:47,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:47,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:47,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:47,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:47,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:47,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:47,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:47,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:47,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:47,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:47,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:47,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:47,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:47,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:47,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:47,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:47,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:47,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:47,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:47,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:47,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:47,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:47,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:47,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:47,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:47,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:47,362 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:47,362 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:47,363 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006.c.i_3.bpl [2019-08-05 10:21:47,363 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jm2006.c.i_3.bpl' [2019-08-05 10:21:47,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:47,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:47,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:47,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:47,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:47,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:47,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:47,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:47,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:47,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... [2019-08-05 10:21:47,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:47,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:47,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:47,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:47,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:21:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:47,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:47,776 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:47,777 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:47,778 INFO L202 PluginConnector]: Adding new model jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:47 BoogieIcfgContainer [2019-08-05 10:21:47,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:47,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:47,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:47,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:47,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:47" (1/2) ... [2019-08-05 10:21:47,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0818c0 and model type jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:47, skipping insertion in model container [2019-08-05 10:21:47,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:47" (2/2) ... [2019-08-05 10:21:47,786 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.c.i_3.bpl [2019-08-05 10:21:47,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:47,803 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:47,819 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:47,844 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:47,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:47,845 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:47,846 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:47,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:47,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:47,846 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:47,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:47,847 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:21:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:21:47,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:47,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:21:47,870 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:21:47,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:47,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:21:47,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:48,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:48,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:48,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:48,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:48,148 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:21:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,207 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:21:48,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:48,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:21:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,234 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:21:48,234 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:21:48,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:21:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:21:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:21:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:21:48,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:21:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,272 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:21:48,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:21:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:21:48,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:21:48,273 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:21:48,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,458 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:21:48,654 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:21:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:48,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:21:48,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:48,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:48,682 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:21:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,742 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:21:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:48,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:21:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,743 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:21:48,743 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:21:48,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:21:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:21:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:21:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:21:48,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:21:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:21:48,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:21:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:21:48,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,748 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:21:48,748 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:21:48,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:48,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:48,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:48,914 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:21:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,003 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:21:49,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:49,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:21:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,005 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:49,006 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:49,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:21:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:21:49,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:21:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,009 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:21:49,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:21:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:49,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,010 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:21:49,010 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,010 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:21:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,036 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:49,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:49,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:49,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:49,260 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:21:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,431 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:21:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:49,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:21:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,434 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:49,434 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:49,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:21:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:21:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:21:49,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:21:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,438 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:21:49,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:21:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:21:49,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,439 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:21:49,440 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:21:49,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:49,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:49,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:49,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:49,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:49,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:49,640 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:21:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,775 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:21:49,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:49,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:21:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,777 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:21:49,779 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:21:49,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:21:49,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:21:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:21:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:21:49,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:21:49,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,783 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:21:49,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:21:49,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:49,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,784 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:21:49,784 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,785 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:21:49,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:50,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:50,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:50,047 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:21:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,126 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:21:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:50,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:21:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,131 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:50,131 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:21:50,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:21:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:21:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:21:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:21:50,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:21:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,134 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:21:50,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:21:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:21:50,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,135 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:21:50,135 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:21:50,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:50,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:50,641 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:21:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,720 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:21:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:50,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:21:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,722 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:21:50,722 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:21:50,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:21:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:21:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:21:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:21:50,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:21:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,726 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:21:50,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:21:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:50,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,727 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:21:50,727 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:21:50,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:50,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:50,967 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:21:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,090 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:21:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:51,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:21:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,092 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:21:51,092 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:21:51,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:21:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:21:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:21:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:21:51,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:21:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,097 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:21:51,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:21:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:21:51,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,098 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:21:51,098 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:21:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:51,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:51,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:51,387 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:21:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,539 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:21:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:51,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:21:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,540 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:21:51,541 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:21:51,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:21:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:21:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:21:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:21:51,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:21:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,545 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:21:51,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:21:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:21:51,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,546 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:21:51,546 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:21:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:51,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:51,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:51,820 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:21:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,927 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:21:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:51,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:21:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,928 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:21:51,928 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:21:51,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:21:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:21:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:21:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:21:51,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:21:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,933 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:21:51,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:21:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:21:51,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,934 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:21:51,934 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:21:51,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:21:52,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:21:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:21:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:52,150 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:21:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,294 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:21:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:52,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:21:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,295 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:21:52,296 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:21:52,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:21:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:21:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:21:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:21:52,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:21:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,300 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:21:52,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:21:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:21:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:21:52,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,300 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:21:52,301 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:21:52,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:21:52,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:21:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:21:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:52,648 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:21:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,859 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:21:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:21:52,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:21:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,860 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:21:52,860 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:21:52,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:21:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:21:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:21:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:21:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:21:52,864 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:21:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,865 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:21:52,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:21:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:21:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:21:52,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,867 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:21:52,867 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:21:52,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,889 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:53,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:21:53,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:21:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:21:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:53,211 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:21:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,541 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:21:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:21:53,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:21:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,550 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:21:53,550 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:21:53,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:21:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:21:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:21:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:21:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:21:53,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:21:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,554 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:21:53,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:21:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:21:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:21:53,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,555 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:21:53,555 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:21:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:53,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:21:53,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:21:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:21:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:53,888 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:21:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:54,070 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:21:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:21:54,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:21:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:54,071 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:21:54,071 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:21:54,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:21:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:21:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:21:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:21:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:21:54,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:21:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:54,075 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:21:54,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:21:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:21:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:21:54,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:54,076 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:21:54,077 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:21:54,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:54,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:21:54,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:54,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:54,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:21:54,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:21:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:21:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:54,697 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:21:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:55,051 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:21:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:21:55,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:21:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:55,053 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:21:55,053 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:21:55,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:21:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:21:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:21:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:21:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:21:55,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:21:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:55,056 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:21:55,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:21:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:21:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:21:55,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:55,057 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:21:55,057 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:21:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:55,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:21:55,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:55,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:55,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:21:55,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:21:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:21:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:55,542 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:21:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:55,801 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:21:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:21:55,801 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:21:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:55,802 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:55,803 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:21:55,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:21:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:21:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:21:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:21:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:21:55,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:21:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:55,807 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:21:55,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:21:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:21:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:55,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:55,808 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:21:55,808 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:21:55,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:55,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:21:55,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:56,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:56,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:21:56,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:21:56,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:21:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:56,174 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:21:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:56,454 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:21:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:21:56,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:21:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:56,456 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:21:56,457 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:21:56,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:21:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:21:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:21:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:21:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:21:56,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:21:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:56,460 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:21:56,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:21:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:21:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:21:56,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:56,461 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:21:56,461 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:21:56,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:56,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:21:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:21:56,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:21:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:21:56,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:56,757 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:21:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:57,115 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:21:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:21:57,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:21:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:57,117 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:21:57,117 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:21:57,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:21:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:21:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:21:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:21:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:21:57,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:21:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:57,120 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:21:57,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:21:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:21:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:21:57,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:57,121 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:21:57,121 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:21:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:57,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:21:57,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:57,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:57,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:21:57,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:21:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:21:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:57,554 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:21:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:57,989 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:21:57,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:21:57,990 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:21:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:57,991 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:21:57,991 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:21:57,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:21:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:21:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:21:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:21:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:21:57,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:21:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:57,995 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:21:57,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:21:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:21:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:21:57,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:57,997 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:21:58,006 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:58,006 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:21:58,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:58,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:21:58,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:58,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:58,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:21:58,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:21:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:21:58,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:58,435 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:21:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:58,832 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:21:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:21:58,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:21:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:58,833 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:21:58,834 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:21:58,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:21:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:21:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:21:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:21:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:21:58,837 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:21:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:58,838 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:21:58,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:21:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:21:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:21:58,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:58,838 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:21:58,839 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:58,839 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:21:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:58,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:21:58,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:59,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:59,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:21:59,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:21:59,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:21:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:59,189 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:21:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:59,709 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:21:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:21:59,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:21:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:59,711 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:21:59,711 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:21:59,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:21:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:21:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:21:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:21:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:21:59,715 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:21:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:59,715 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:21:59,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:21:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:21:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:21:59,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:59,716 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:21:59,716 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:21:59,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:59,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:21:59,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:00,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:00,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:22:00,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:22:00,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:22:00,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:22:00,354 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:22:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:00,791 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:22:00,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:22:00,794 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:22:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:00,795 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:22:00,795 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:22:00,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:22:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:22:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:22:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:22:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:22:00,799 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:22:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:00,799 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:22:00,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:22:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:22:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:22:00,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:00,800 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:22:00,800 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:22:00,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:00,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:22:00,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:01,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:01,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:22:01,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:22:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:22:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:22:01,355 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:22:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:02,137 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:22:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:22:02,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:22:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:02,139 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:22:02,140 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:22:02,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:22:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:22:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:22:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:22:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:22:02,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:22:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:02,143 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:22:02,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:22:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:22:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:22:02,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:02,144 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:22:02,144 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:22:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:02,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:22:02,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:02,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:02,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:22:02,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:22:02,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:22:02,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:22:02,634 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:22:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:03,429 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:22:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:22:03,429 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:22:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:03,430 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:22:03,430 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:22:03,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:22:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:22:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:22:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:22:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:22:03,435 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:22:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:03,435 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:22:03,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:22:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:22:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:22:03,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:03,436 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:22:03,436 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:22:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:03,454 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:22:03,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:04,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:04,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:22:04,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:22:04,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:22:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:22:04,166 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:22:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:04,697 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:22:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:22:04,698 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:22:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:04,699 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:22:04,699 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:22:04,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:22:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:22:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:22:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:22:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:22:04,703 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:22:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:04,703 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:22:04,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:22:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:22:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:22:04,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:04,707 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:22:04,707 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:22:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:04,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:22:04,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:06,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:06,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:22:06,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:22:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:22:06,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:22:06,231 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:22:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:06,810 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:22:06,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:22:06,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:22:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:06,811 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:22:06,811 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:22:06,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:22:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:22:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:22:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:22:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:22:06,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:22:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:06,815 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:22:06,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:22:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:22:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:22:06,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:06,816 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:22:06,816 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:22:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:06,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:22:06,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:07,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:07,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:22:07,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:22:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:22:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:22:07,352 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:22:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:07,933 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:22:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:22:07,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:22:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:07,934 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:22:07,935 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:22:07,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:22:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:22:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:22:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:22:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:22:07,939 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:22:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:07,939 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:22:07,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:22:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:22:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:22:07,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:07,940 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:22:07,941 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:22:07,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:07,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:22:07,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:09,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:09,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:22:09,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:22:09,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:22:09,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:22:09,950 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:22:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:10,604 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:22:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:22:10,605 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:22:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:10,605 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:22:10,605 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:22:10,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:22:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:22:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:22:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:22:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:22:10,609 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:22:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:10,609 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:22:10,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:22:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:22:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:22:10,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:10,610 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:22:10,611 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:22:10,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:11,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:22:11,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:22:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:22:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:22:11,336 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:22:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:12,043 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:22:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:22:12,044 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:22:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:12,045 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:22:12,045 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:22:12,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:22:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:22:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:22:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:22:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:22:12,051 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:22:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:12,051 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:22:12,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:22:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:22:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:22:12,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:12,052 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:22:12,052 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:22:12,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:12,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:22:12,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:12,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:12,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:22:12,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:22:12,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:22:12,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:22:12,752 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:22:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:13,609 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:22:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:22:13,609 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:22:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:13,610 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:22:13,610 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:22:13,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:22:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:22:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:22:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:22:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:22:13,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:22:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:13,614 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:22:13,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:22:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:22:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:22:13,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:13,615 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:22:13,615 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:22:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:13,634 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:22:13,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:14,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:14,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:22:14,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:22:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:22:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:22:14,268 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:22:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:15,025 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:22:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:22:15,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:22:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:15,026 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:22:15,026 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:22:15,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:22:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:22:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:22:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:22:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:22:15,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:22:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:15,031 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:22:15,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:22:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:22:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:22:15,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:15,031 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:22:15,032 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:22:15,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:15,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:22:15,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:15,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:15,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:22:15,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:22:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:22:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:22:15,822 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:22:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:16,654 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:22:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:22:16,655 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:22:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:16,655 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:22:16,655 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:22:16,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:22:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:22:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:22:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:22:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:22:16,659 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:22:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:16,660 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:22:16,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:22:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:22:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:22:16,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:16,660 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:22:16,661 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:22:16,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:16,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:22:16,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:17,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:17,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:22:17,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:22:17,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:22:17,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:22:17,411 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:22:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:18,355 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:22:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:22:18,355 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:22:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:18,356 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:22:18,356 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:22:18,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:22:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:22:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:22:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:22:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:22:18,360 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:22:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:18,361 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:22:18,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:22:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:22:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:22:18,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:18,361 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:22:18,362 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:22:18,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:18,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:22:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:19,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:22:19,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:22:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:22:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:22:19,279 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:22:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:20,216 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:22:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:22:20,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:22:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:20,217 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:22:20,217 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:22:20,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:22:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:22:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:22:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:22:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:22:20,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:22:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:20,221 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:22:20,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:22:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:22:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:22:20,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:20,221 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:22:20,221 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:22:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:20,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:22:20,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:22:21,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:22:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:22:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:21,193 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:22:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,158 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:22:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:22:22,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:22:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,159 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:22:22,159 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:22:22,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:22:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:22:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:22:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:22:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:22:22,163 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:22:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,163 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:22:22,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:22:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:22:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:22:22,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,164 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:22:22,164 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:22:22,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:22,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:22:22,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:23,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:23,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:22:23,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:22:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:22:23,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:22:23,139 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:22:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:24,299 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:22:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:22:24,299 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:22:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:24,300 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:22:24,300 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:22:24,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:22:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:22:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:22:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:22:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:22:24,303 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:22:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:24,303 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:22:24,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:22:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:22:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:22:24,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:24,304 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:22:24,304 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:22:24,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:24,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:22:24,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:25,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:25,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:22:25,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:22:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:22:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:25,341 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:22:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:26,455 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:22:26,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:22:26,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:22:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:26,456 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:22:26,456 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:22:26,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:22:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:22:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:22:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:22:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:22:26,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:22:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:26,460 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:22:26,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:22:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:22:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:22:26,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:26,461 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:22:26,461 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:22:26,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:26,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:22:26,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:27,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:27,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:22:27,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:22:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:22:27,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:27,392 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:22:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:28,601 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:22:28,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:22:28,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:22:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:28,602 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:22:28,602 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:22:28,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:22:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:22:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:22:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:22:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:22:28,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:22:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:28,606 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:22:28,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:22:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:22:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:22:28,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:28,607 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:22:28,607 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:22:28,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:28,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:22:28,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:29,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:29,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:22:29,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:22:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:22:29,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:29,590 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:22:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:30,817 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:22:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:22:30,818 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:22:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:30,818 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:22:30,818 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:22:30,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:22:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:22:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:22:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:22:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:22:30,822 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:22:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:30,822 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:22:30,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:22:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:22:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:22:30,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:30,823 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:22:30,823 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:22:30,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:30,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:22:30,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:31,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:31,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:22:31,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:22:31,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:22:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:31,871 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:22:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:33,183 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:22:33,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:22:33,183 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:22:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:33,184 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:22:33,184 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:22:33,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:22:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:22:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:22:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:22:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:22:33,187 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:22:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:33,188 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:22:33,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:22:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:22:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:22:33,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:33,188 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:22:33,188 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:33,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:22:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:33,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-05 10:22:33,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:34,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:22:34,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:22:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:22:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:34,513 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:22:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:35,885 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:22:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:22:35,886 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:22:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:35,886 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:22:35,886 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:22:35,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:22:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:22:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:22:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:22:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:22:35,889 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:22:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:35,890 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:22:35,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:22:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:22:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:22:35,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:35,890 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:22:35,891 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:35,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:22:35,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:35,919 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 176 conjunts are in the unsatisfiable core [2019-08-05 10:22:35,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:37,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:37,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:22:37,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:22:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:22:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:22:37,018 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:22:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:38,434 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:22:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:22:38,440 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:22:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:38,440 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:22:38,441 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:22:38,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:22:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:22:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:22:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:22:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:22:38,442 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:22:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:38,443 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:22:38,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:22:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:22:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:22:38,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:38,443 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:22:38,443 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:22:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:38,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:22:38,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:39,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:39,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:22:39,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:22:39,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:22:39,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:39,800 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:22:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:41,315 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:22:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:22:41,315 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:22:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:41,316 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:22:41,316 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:22:41,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:22:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:22:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:22:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:22:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:22:41,320 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:22:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:41,320 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:22:41,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:22:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:22:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:22:41,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:41,321 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:22:41,321 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:22:41,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:41,348 WARN L254 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 184 conjunts are in the unsatisfiable core [2019-08-05 10:22:41,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:42,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:22:42,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:22:42,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:22:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:22:42,496 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:22:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:44,156 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:22:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:22:44,156 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:22:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:44,157 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:22:44,157 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:22:44,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:22:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:22:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:22:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:22:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:22:44,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:22:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:44,160 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:22:44,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:22:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:22:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:22:44,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:44,161 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:22:44,161 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:22:44,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:44,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 188 conjunts are in the unsatisfiable core [2019-08-05 10:22:44,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:45,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:22:45,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:22:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:22:45,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:45,369 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:22:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:46,979 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:22:46,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:22:46,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:22:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:46,981 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:22:46,981 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:22:46,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:22:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:22:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:22:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:22:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:22:46,984 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:22:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:46,984 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:22:46,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:22:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:22:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:22:46,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:46,985 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:22:46,986 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:22:46,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:47,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:22:47,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:48,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:22:48,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:22:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:22:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:48,381 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:22:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:50,275 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:22:50,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:22:50,276 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:22:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:50,277 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:22:50,277 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:22:50,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:22:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:22:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:22:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:22:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:22:50,279 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:22:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:50,280 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:22:50,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:22:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:22:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:22:50,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:50,280 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:22:50,281 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:50,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:22:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:50,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 196 conjunts are in the unsatisfiable core [2019-08-05 10:22:50,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:51,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:51,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:22:51,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:22:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:22:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:51,680 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:22:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:53,416 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:22:53,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:22:53,417 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:22:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:53,418 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:22:53,418 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:22:53,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:22:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:22:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:22:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:22:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:22:53,421 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:22:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:53,421 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:22:53,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:22:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:22:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:22:53,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:53,422 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:22:53,422 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:22:53,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:53,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-05 10:22:53,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:55,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:55,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:22:55,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:22:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:22:55,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:55,083 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:22:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:56,966 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:22:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:22:56,966 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:22:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:56,967 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:22:56,967 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:22:56,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:22:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:22:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:22:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:22:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:22:56,971 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:22:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:56,971 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:22:56,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:22:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:22:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:22:56,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:56,972 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:22:56,973 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:22:56,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:56,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:22:56,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:58,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:22:58,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:22:58,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:22:58,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:22:58,456 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:23:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:00,502 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:23:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:23:00,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:23:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:00,503 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:23:00,504 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:23:00,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:23:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:23:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:23:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:23:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:23:00,507 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:23:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:00,507 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:23:00,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:23:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:23:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:23:00,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:00,508 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:23:00,508 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:23:00,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:00,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 208 conjunts are in the unsatisfiable core [2019-08-05 10:23:00,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:02,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:23:02,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:23:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:23:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:23:02,983 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:23:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:05,048 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:23:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:23:05,049 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:23:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:05,049 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:23:05,050 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:23:05,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:23:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:23:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:23:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:23:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:23:05,053 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:23:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:05,053 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:23:05,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:23:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:23:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:23:05,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:05,054 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:23:05,054 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:05,055 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:23:05,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:05,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 212 conjunts are in the unsatisfiable core [2019-08-05 10:23:05,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:06,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:23:06,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:23:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:23:06,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:23:06,673 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:23:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:08,752 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:23:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:23:08,754 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:23:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:08,755 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:23:08,755 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:23:08,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:23:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:23:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:23:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:23:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:23:08,757 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:23:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:08,758 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:23:08,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:23:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:23:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:23:08,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:08,758 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:23:08,759 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:23:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:08,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:23:08,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:10,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:10,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:23:10,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:23:10,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:23:10,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:23:10,971 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:23:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:13,141 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:23:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:23:13,141 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:23:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:13,142 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:23:13,142 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:23:13,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:23:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:23:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:23:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:23:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:23:13,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:23:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:13,146 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:23:13,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:23:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:23:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:23:13,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:13,147 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:23:13,147 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:23:13,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:13,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 220 conjunts are in the unsatisfiable core [2019-08-05 10:23:13,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:14,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:23:14,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:23:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:23:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:23:14,967 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:23:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:17,223 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:23:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:23:17,223 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:23:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:17,224 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:23:17,224 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:23:17,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:23:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:23:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:23:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:23:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:23:17,228 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:23:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:17,228 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:23:17,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:23:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:23:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:23:17,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:17,229 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:23:17,229 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:23:17,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:17,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 224 conjunts are in the unsatisfiable core [2019-08-05 10:23:17,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:18,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:18,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:23:18,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:23:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:23:18,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:23:18,959 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:23:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:21,370 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:23:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:23:21,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:23:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:21,372 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:23:21,372 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:23:21,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:23:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:23:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:23:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:23:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:23:21,375 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:23:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:21,375 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:23:21,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:23:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:23:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:23:21,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:21,376 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:23:21,376 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:23:21,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:21,421 WARN L254 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-05 10:23:21,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:23,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:23,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:23:23,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:23:23,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:23:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:23:23,173 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:23:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:25,725 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:23:25,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:23:25,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:23:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:25,726 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:23:25,726 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:23:25,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:23:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:23:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:23:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:23:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:23:25,729 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:23:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:25,730 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:23:25,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:23:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:23:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:23:25,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:25,731 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:23:25,731 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:23:25,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:25,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 232 conjunts are in the unsatisfiable core [2019-08-05 10:23:25,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:23:27,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:23:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:23:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:23:27,665 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:23:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:30,246 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:23:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:23:30,246 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:23:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:30,247 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:23:30,247 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:23:30,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:23:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:23:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:23:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:23:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:23:30,250 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:23:30,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:30,250 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:23:30,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:23:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:23:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:23:30,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:30,251 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:23:30,251 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:23:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:30,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 236 conjunts are in the unsatisfiable core [2019-08-05 10:23:30,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:32,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:23:32,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:23:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:23:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:23:32,623 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:23:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:35,315 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:23:35,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:23:35,316 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:23:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:35,317 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:23:35,317 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:23:35,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:23:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:23:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:23:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:23:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:23:35,319 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:23:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:35,319 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:23:35,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:23:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:23:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:23:35,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:35,320 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:23:35,320 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:35,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:35,321 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:23:35,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:35,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:23:35,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:37,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:37,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:23:37,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:23:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:23:37,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:23:37,303 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:23:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:39,926 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:23:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:23:39,927 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:23:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:39,927 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:23:39,927 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:23:39,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:23:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:23:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:23:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:23:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:23:39,931 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:23:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:39,931 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:23:39,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:23:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:23:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:23:39,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:39,932 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:23:39,932 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:39,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:39,933 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:23:39,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:39,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 244 conjunts are in the unsatisfiable core [2019-08-05 10:23:39,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:23:42,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:23:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:23:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:23:42,321 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:23:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:45,118 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:23:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:23:45,119 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:23:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:45,120 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:23:45,120 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:23:45,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:23:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:23:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:23:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:23:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:23:45,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:23:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:45,123 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:23:45,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:23:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:23:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:23:45,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:45,124 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:23:45,124 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:45,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:23:45,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:45,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 248 conjunts are in the unsatisfiable core [2019-08-05 10:23:45,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:47,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:47,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:23:47,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:23:47,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:23:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:23:47,509 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:23:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:50,295 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:23:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:23:50,296 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:23:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:50,297 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:23:50,297 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:23:50,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:23:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:23:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:23:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:23:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:23:50,300 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:23:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:50,300 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:23:50,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:23:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:23:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:23:50,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:50,301 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:23:50,301 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:23:50,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:50,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 10:23:50,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:52,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:52,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:23:52,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:23:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:23:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:23:52,718 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:23:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:55,813 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:23:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:23:55,813 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:23:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:55,814 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:23:55,814 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:23:55,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:23:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:23:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:23:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:23:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:23:55,817 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:23:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:55,817 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:23:55,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:23:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:23:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:23:55,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:55,818 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:23:55,818 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:23:55,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:55,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 256 conjunts are in the unsatisfiable core [2019-08-05 10:23:55,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:57,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:57,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:23:57,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:23:57,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:23:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:23:57,976 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:24:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:01,072 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:24:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:24:01,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:24:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:01,074 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:24:01,074 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:24:01,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:24:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:24:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:24:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:24:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:24:01,077 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:24:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:01,077 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:24:01,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:24:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:24:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:24:01,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:01,078 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:24:01,078 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:24:01,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:01,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 260 conjunts are in the unsatisfiable core [2019-08-05 10:24:01,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:03,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:03,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:24:03,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:24:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:24:03,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:24:03,359 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:24:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:06,652 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:24:06,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:24:06,653 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:24:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:06,654 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:24:06,654 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:24:06,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:24:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:24:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:24:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:24:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:24:06,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:24:06,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:06,657 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:24:06,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:24:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:24:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:24:06,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:06,658 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:24:06,658 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:24:06,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:06,722 WARN L254 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:24:06,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:09,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:09,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:24:09,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:24:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:24:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:24:09,135 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:24:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:12,568 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:24:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:24:12,568 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:24:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:12,569 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:24:12,569 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:24:12,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:24:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:24:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:24:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:24:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:24:12,572 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:24:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:12,573 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:24:12,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:24:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:24:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:24:12,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:12,574 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:24:12,574 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:24:12,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:12,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 268 conjunts are in the unsatisfiable core [2019-08-05 10:24:12,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:15,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:15,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:24:15,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:24:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:24:15,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:24:15,077 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:24:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:18,657 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:24:18,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:24:18,658 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:24:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:18,659 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:24:18,659 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:24:18,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:24:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:24:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:24:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:24:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:24:18,662 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:24:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:18,662 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:24:18,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:24:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:24:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:24:18,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:18,663 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:24:18,663 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:24:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:18,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 272 conjunts are in the unsatisfiable core [2019-08-05 10:24:18,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:21,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:21,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:24:21,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:24:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:24:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:24:21,940 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:24:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:25,486 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:24:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:24:25,487 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:24:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:25,487 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:24:25,487 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:24:25,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:24:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:24:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:24:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:24:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:24:25,490 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:24:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:25,490 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:24:25,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:24:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:24:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:24:25,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:25,491 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:24:25,491 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:25,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:25,491 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:24:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:25,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-05 10:24:25,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:24:29,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:24:29,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:24:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:24:29,353 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:24:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:33,166 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:24:33,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:24:33,167 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:24:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:33,168 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:24:33,168 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:24:33,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:24:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:24:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:24:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:24:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:24:33,170 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:24:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:33,170 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:24:33,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:24:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:24:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:24:33,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:33,171 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:24:33,171 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:24:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:33,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 280 conjunts are in the unsatisfiable core [2019-08-05 10:24:33,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:36,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:36,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:24:36,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:24:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:24:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:24:36,048 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:24:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:39,809 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:24:39,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:24:39,809 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:24:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:39,810 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:24:39,810 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:24:39,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:24:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:24:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:24:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:24:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:24:39,813 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:24:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:39,813 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:24:39,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:24:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:24:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:24:39,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:39,814 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:24:39,814 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:24:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:39,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 284 conjunts are in the unsatisfiable core [2019-08-05 10:24:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:42,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:24:42,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:24:42,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:24:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:24:42,783 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:24:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:46,537 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:24:46,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:24:46,537 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:24:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:46,538 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:24:46,538 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:24:46,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:24:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:24:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:24:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:24:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:24:46,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:24:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:46,541 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:24:46,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:24:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:24:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:24:46,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:46,542 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:24:46,542 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:24:46,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:46,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:24:46,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:49,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:49,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:24:49,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:24:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:24:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:24:49,602 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:24:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:53,588 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:24:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:24:53,589 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:24:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:53,590 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:24:53,590 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:24:53,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:24:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:24:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:24:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:24:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:24:53,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:24:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:53,594 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:24:53,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:24:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:24:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:24:53,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:53,595 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:24:53,595 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:53,595 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:24:53,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:53,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 292 conjunts are in the unsatisfiable core [2019-08-05 10:24:53,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:56,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:24:56,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:24:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:24:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:24:56,547 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:25:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:00,599 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:25:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:25:00,600 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:25:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:00,601 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:25:00,601 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:25:00,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:25:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:25:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:25:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:25:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:25:00,604 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:25:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:00,605 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:25:00,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:25:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:25:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:25:00,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:00,606 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:25:00,606 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:25:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:00,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 296 conjunts are in the unsatisfiable core [2019-08-05 10:25:00,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:04,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:25:04,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:25:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:25:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:25:04,077 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:25:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:08,310 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:25:08,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:25:08,311 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:25:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:08,312 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:25:08,312 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:25:08,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:25:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:25:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:25:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:25:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:25:08,315 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:25:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:08,315 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:25:08,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:25:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:25:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:25:08,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:08,316 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:25:08,317 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:08,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:25:08,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:08,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-05 10:25:08,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:11,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:11,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:25:11,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:25:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:25:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:25:11,375 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:25:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:15,650 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:25:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:25:15,651 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:25:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:15,652 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:25:15,652 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:25:15,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:25:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:25:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:25:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:25:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:25:15,655 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:25:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:15,655 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:25:15,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:25:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:25:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:25:15,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:15,656 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:25:15,656 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:25:15,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:15,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 304 conjunts are in the unsatisfiable core [2019-08-05 10:25:15,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:19,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:25:19,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:25:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:25:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:25:19,037 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:25:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:23,412 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:25:23,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:25:23,413 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:25:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:23,414 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:25:23,414 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:25:23,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:25:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:25:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:25:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:25:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:25:23,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:25:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:23,417 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:25:23,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:25:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:25:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:25:23,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:23,417 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:25:23,418 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:25:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:23,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 308 conjunts are in the unsatisfiable core [2019-08-05 10:25:23,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:26,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:26,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:25:26,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:25:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:25:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:25:26,579 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:25:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:31,100 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:25:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:25:31,100 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:25:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:31,101 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:25:31,101 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:25:31,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:25:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:25:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:25:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:25:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:25:31,104 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:25:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:31,104 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:25:31,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:25:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:25:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:25:31,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:31,105 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:25:31,105 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:31,106 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:25:31,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:31,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 312 conjunts are in the unsatisfiable core [2019-08-05 10:25:31,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:34,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:34,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:25:34,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:25:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:25:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:25:34,474 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:25:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:39,094 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:25:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:25:39,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:25:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:39,095 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:25:39,096 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:25:39,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:25:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:25:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:25:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:25:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:25:39,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:25:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:39,099 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:25:39,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:25:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:25:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:25:39,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:39,099 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:25:39,100 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:25:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:39,167 WARN L254 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 316 conjunts are in the unsatisfiable core [2019-08-05 10:25:39,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:42,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:42,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:25:42,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:25:42,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:25:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:25:42,769 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:25:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:47,481 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:25:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:25:47,482 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:25:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:47,483 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:25:47,483 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:25:47,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:25:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:25:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:25:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:25:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:25:47,486 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:25:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:47,486 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:25:47,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:25:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:25:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:25:47,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:47,487 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:25:47,487 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:25:47,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:47,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 320 conjunts are in the unsatisfiable core [2019-08-05 10:25:47,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:25:51,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:25:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:25:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:25:51,120 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:25:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,147 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:25:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:25:56,147 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:25:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,148 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:25:56,148 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:25:56,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:25:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:25:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:25:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:25:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:25:56,151 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:25:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,152 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:25:56,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:25:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:25:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:25:56,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,153 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:25:56,153 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:25:56,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 324 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:59,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:25:59,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:25:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:25:59,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:25:59,732 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. Received shutdown request... [2019-08-05 10:25:59,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:59,927 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:25:59,933 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:25:59,933 INFO L202 PluginConnector]: Adding new model jm2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:59 BoogieIcfgContainer [2019-08-05 10:25:59,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:59,935 INFO L168 Benchmark]: Toolchain (without parser) took 252525.67 ms. Allocated memory was 134.2 MB in the beginning and 238.0 MB in the end (delta: 103.8 MB). Free memory was 111.7 MB in the beginning and 171.3 MB in the end (delta: -59.5 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,938 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:25:59,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.60 ms. Allocated memory is still 134.2 MB. Free memory was 111.3 MB in the beginning and 109.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,940 INFO L168 Benchmark]: Boogie Preprocessor took 20.10 ms. Allocated memory is still 134.2 MB. Free memory was 109.6 MB in the beginning and 108.8 MB in the end (delta: 838.8 kB). Peak memory consumption was 838.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,940 INFO L168 Benchmark]: RCFGBuilder took 312.60 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 98.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,941 INFO L168 Benchmark]: TraceAbstraction took 252153.57 ms. Allocated memory was 134.2 MB in the beginning and 238.0 MB in the end (delta: 103.8 MB). Free memory was 98.5 MB in the beginning and 171.3 MB in the end (delta: -72.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,945 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.60 ms. Allocated memory is still 134.2 MB. Free memory was 111.3 MB in the beginning and 109.6 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.10 ms. Allocated memory is still 134.2 MB. Free memory was 109.6 MB in the beginning and 108.8 MB in the end (delta: 838.8 kB). Peak memory consumption was 838.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 312.60 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 98.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252153.57 ms. Allocated memory was 134.2 MB in the beginning and 238.0 MB in the end (delta: 103.8 MB). Free memory was 98.5 MB in the beginning and 171.3 MB in the end (delta: -72.8 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 53). Cancelled while BasicCegarLoop was constructing difference of abstraction (82states) and FLOYD_HOARE automaton (currently 5 states, 81 states before enhancement),while ReachableStatesComputation was computing reachable states (3 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 252.0s OverallTime, 79 OverallIterations, 78 TraceHistogramMax, 134.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 235 SDtfs, 0 SDslu, 3081 SDs, 0 SdLazy, 167637 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3239 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 112.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 114.4s InterpolantComputationTime, 3318 NumberOfCodeBlocks, 3318 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1867353 SizeOfPredicates, 474 NumberOfNonLiveVariables, 17538 ConjunctsInSsa, 13272 ConjunctsInUnsatCore, 79 InterpolantComputations, 1 PerfectInterpolantSequences, 0/82160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown