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/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:25:28,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:25:28,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:25:28,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:25:28,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:25:28,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:25:28,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:25:28,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:25:28,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:25:28,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:25:28,299 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:25:28,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:25:28,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:25:28,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:25:28,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:25:28,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:25:28,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:25:28,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:25:28,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:25:28,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:25:28,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:25:28,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:25:28,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:25:28,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:25:28,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:25:28,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:25:28,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:25:28,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:25:28,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:25:28,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:25:28,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:25:28,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:25:28,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:25:28,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:25:28,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:25:28,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:25:28,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:25:28,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:25:28,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:25:28,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:25:28,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:25:28,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:25:28,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:25:28,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:25:28,402 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:25:28,403 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:25:28,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2019-08-04 21:25:28,404 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2019-08-04 21:25:28,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:25:28,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:25:28,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:25:28,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:25:28,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:25:28,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:25:28,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:25:28,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:25:28,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:25:28,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/1) ... [2019-08-04 21:25:28,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:25:28,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:25:28,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:25:28,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:25:28,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (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-04 21:25:28,567 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:25:28,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:25:28,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:25:28,988 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:25:28,988 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:25:28,990 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:25:28 BoogieIcfgContainer [2019-08-04 21:25:28,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:25:28,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:25:28,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:25:28,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:25:28,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:25:28" (1/2) ... [2019-08-04 21:25:28,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187208d4 and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:25:28, skipping insertion in model container [2019-08-04 21:25:28,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:25:28" (2/2) ... [2019-08-04 21:25:28,998 INFO L109 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2019-08-04 21:25:29,006 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:25:29,013 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:25:29,026 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:25:29,051 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:25:29,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:25:29,052 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:25:29,052 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:25:29,052 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:25:29,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:25:29,053 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:25:29,053 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:25:29,053 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:25:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-04 21:25:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:25:29,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:29,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:25:29,078 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:29,084 INFO L82 PathProgramCache]: Analyzing trace with hash 889618619, now seen corresponding path program 1 times [2019-08-04 21:25:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:29,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:25:29,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:29,224 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-04 21:25:29,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:25:29,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:25:29,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:25:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:25:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:25:29,246 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-04 21:25:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:29,316 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-04 21:25:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:25:29,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-04 21:25:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:29,347 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:25:29,347 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:25:29,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-04 21:25:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:25:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:25:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:25:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-04 21:25:29,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-04 21:25:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:29,422 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-04 21:25:29,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:25:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-04 21:25:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:25:29,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:29,423 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-04 21:25:29,423 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash 141442743, now seen corresponding path program 1 times [2019-08-04 21:25:29,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:29,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:25:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:29,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:29,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:25:29,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:25:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:25:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:25:29,581 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-04 21:25:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:29,657 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-04 21:25:29,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:25:29,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-04 21:25:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:29,659 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:25:29,659 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:25:29,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:25:29,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:25:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:25:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:25:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-04 21:25:29,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-04 21:25:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:29,664 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-04 21:25:29,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:25:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-04 21:25:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:25:29,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:29,665 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-04 21:25:29,666 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1596035661, now seen corresponding path program 2 times [2019-08-04 21:25:29,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:29,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:25:29,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:29,772 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-04 21:25:29,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:29,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:25:29,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:25:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:25:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:25:29,774 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2019-08-04 21:25:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:29,866 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-04 21:25:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:25:29,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-04 21:25:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:29,868 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:25:29,868 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:25:29,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:25:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:25:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:25:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:25:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-04 21:25:29,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-04 21:25:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-04 21:25:29,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:25:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-04 21:25:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:25:29,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:29,874 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-08-04 21:25:29,874 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash -570503761, now seen corresponding path program 3 times [2019-08-04 21:25:29,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:29,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:25:29,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:30,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:30,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:25:30,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:25:30,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:25:30,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:25:30,021 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2019-08-04 21:25:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:30,081 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-04 21:25:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:25:30,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-04 21:25:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:30,088 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:25:30,088 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:25:30,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:25:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:25:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:25:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:25:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-04 21:25:30,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-04 21:25:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:30,092 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-04 21:25:30,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:25:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-04 21:25:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:25:30,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:30,093 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2019-08-04 21:25:30,094 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1418141355, now seen corresponding path program 4 times [2019-08-04 21:25:30,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:30,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:25:30,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:30,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:30,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:25:30,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:25:30,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:25:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:25:30,386 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-08-04 21:25:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:30,474 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-04 21:25:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:25:30,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:25:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:30,475 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:25:30,475 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:25:30,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:25:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:25:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:25:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:25:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-04 21:25:30,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-04 21:25:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:30,480 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-04 21:25:30,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:25:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-04 21:25:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:25:30,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:30,481 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2019-08-04 21:25:30,481 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1245651111, now seen corresponding path program 5 times [2019-08-04 21:25:30,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:30,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:25:30,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:30,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:30,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:25:30,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:25:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:25:30,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:25:30,675 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2019-08-04 21:25:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:30,720 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-04 21:25:30,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:25:30,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-04 21:25:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:30,722 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:25:30,722 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:25:30,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:25:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:25:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:25:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:25:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-04 21:25:30,725 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-04 21:25:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:30,726 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-04 21:25:30,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:25:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-04 21:25:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:25:30,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:30,727 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2019-08-04 21:25:30,727 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1308716125, now seen corresponding path program 6 times [2019-08-04 21:25:30,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:30,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:25:30,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:30,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:30,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:25:30,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:25:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:25:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:25:30,967 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2019-08-04 21:25:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:30,998 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-04 21:25:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:25:30,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-04 21:25:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:30,999 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:25:30,999 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:25:31,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:25:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:25:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:25:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:25:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-04 21:25:31,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-04 21:25:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:31,004 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-04 21:25:31,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:25:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-04 21:25:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:25:31,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:31,005 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2019-08-04 21:25:31,005 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash 665663391, now seen corresponding path program 7 times [2019-08-04 21:25:31,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:31,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:25:31,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:25:31,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:25:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:25:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:25:31,189 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2019-08-04 21:25:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:31,214 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-04 21:25:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:25:31,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-08-04 21:25:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:31,215 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:25:31,215 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:25:31,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:25:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:25:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:25:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:25:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-04 21:25:31,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-08-04 21:25:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:31,220 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-04 21:25:31,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:25:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-04 21:25:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:25:31,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:31,222 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2019-08-04 21:25:31,222 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash -331166565, now seen corresponding path program 8 times [2019-08-04 21:25:31,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:31,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:25:31,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:31,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:25:31,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:25:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:25:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:25:31,674 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2019-08-04 21:25:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:31,724 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-04 21:25:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:25:31,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-08-04 21:25:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:31,725 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:25:31,725 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:25:31,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:25:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:25:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:25:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:25:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-04 21:25:31,729 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-08-04 21:25:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:31,730 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-04 21:25:31,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:25:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-04 21:25:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:25:31,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:31,731 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2019-08-04 21:25:31,731 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash -507047273, now seen corresponding path program 9 times [2019-08-04 21:25:31,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:31,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:25:31,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:32,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:32,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:25:32,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:25:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:25:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:25:32,014 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2019-08-04 21:25:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:32,064 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-04 21:25:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:25:32,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-04 21:25:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:32,065 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:25:32,066 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:25:32,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:25:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:25:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:25:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:25:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-04 21:25:32,070 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-08-04 21:25:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:32,071 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-04 21:25:32,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:25:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-04 21:25:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:25:32,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:32,072 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2019-08-04 21:25:32,072 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2024683117, now seen corresponding path program 10 times [2019-08-04 21:25:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:32,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:25:32,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:32,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:32,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:25:32,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:25:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:25:32,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:25:32,276 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2019-08-04 21:25:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:32,331 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-04 21:25:32,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:25:32,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-08-04 21:25:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:32,332 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:25:32,333 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:25:32,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:25:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:25:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:25:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:25:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-04 21:25:32,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-08-04 21:25:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:32,337 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-04 21:25:32,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:25:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-04 21:25:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:25:32,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:32,339 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2019-08-04 21:25:32,339 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:32,339 INFO L82 PathProgramCache]: Analyzing trace with hash -183848561, now seen corresponding path program 11 times [2019-08-04 21:25:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:32,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:25:32,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:32,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:32,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:25:32,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:25:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:25:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:25:32,607 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-08-04 21:25:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:32,739 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-04 21:25:32,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:25:32,739 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-08-04 21:25:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:32,740 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:25:32,740 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:25:32,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:25:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:25:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:25:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:25:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-04 21:25:32,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-08-04 21:25:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:32,744 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-04 21:25:32,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:25:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-04 21:25:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:25:32,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:32,745 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2019-08-04 21:25:32,746 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash -668366197, now seen corresponding path program 12 times [2019-08-04 21:25:32,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:32,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:25:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:33,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:33,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:25:33,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:25:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:25:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:25:33,176 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2019-08-04 21:25:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:33,241 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-04 21:25:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:25:33,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-08-04 21:25:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:33,245 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:25:33,245 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:25:33,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:25:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:25:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:25:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:25:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-04 21:25:33,252 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-08-04 21:25:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:33,252 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-04 21:25:33,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:25:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-04 21:25:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:25:33,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:33,253 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2019-08-04 21:25:33,254 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1861620871, now seen corresponding path program 13 times [2019-08-04 21:25:33,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:33,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:25:33,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:33,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:33,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:25:33,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:25:33,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:25:33,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:25:33,521 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2019-08-04 21:25:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:33,573 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-04 21:25:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:25:33,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-08-04 21:25:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:33,575 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:25:33,575 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:25:33,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:25:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:25:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:25:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:25:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-04 21:25:33,580 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-08-04 21:25:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:33,580 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-04 21:25:33,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:25:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-04 21:25:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:25:33,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:33,581 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2019-08-04 21:25:33,581 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2067263613, now seen corresponding path program 14 times [2019-08-04 21:25:33,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:33,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:25:33,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:34,013 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-04 21:25:34,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:25:34,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:25:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:25:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:25:34,015 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-08-04 21:25:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:34,072 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-04 21:25:34,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:25:34,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-08-04 21:25:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:34,074 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:25:34,074 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:25:34,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:25:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:25:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:25:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:25:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-04 21:25:34,078 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-08-04 21:25:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:34,078 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-04 21:25:34,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:25:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-04 21:25:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:25:34,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:34,079 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2019-08-04 21:25:34,079 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1845967743, now seen corresponding path program 15 times [2019-08-04 21:25:34,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:34,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:25:34,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:34,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:34,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:25:34,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:25:34,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:25:34,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:25:34,335 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 18 states. [2019-08-04 21:25:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:34,388 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-04 21:25:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:25:34,393 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-08-04 21:25:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:34,393 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:25:34,393 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:25:34,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:25:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:25:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:25:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:25:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-04 21:25:34,397 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-08-04 21:25:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:34,397 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-04 21:25:34,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:25:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-04 21:25:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:25:34,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:34,398 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2019-08-04 21:25:34,398 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash 69949563, now seen corresponding path program 16 times [2019-08-04 21:25:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:34,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:25:34,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:35,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:35,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:25:35,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:25:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:25:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:25:35,119 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 19 states. [2019-08-04 21:25:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:35,145 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-04 21:25:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:25:35,152 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2019-08-04 21:25:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:35,152 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:25:35,152 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:25:35,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:25:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:25:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:25:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:25:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-04 21:25:35,156 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-08-04 21:25:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:35,156 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-04 21:25:35,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:25:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-04 21:25:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:25:35,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:35,157 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2019-08-04 21:25:35,158 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1581504905, now seen corresponding path program 17 times [2019-08-04 21:25:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:35,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:25:35,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:35,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:35,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:25:35,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:25:35,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:25:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:25:35,533 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2019-08-04 21:25:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:35,659 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-04 21:25:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:25:35,660 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-08-04 21:25:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:35,660 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:25:35,660 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:25:35,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:25:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:25:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:25:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:25:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-04 21:25:35,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-08-04 21:25:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:35,665 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-04 21:25:35,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:25:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-04 21:25:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:25:35,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:35,666 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2019-08-04 21:25:35,666 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 508650867, now seen corresponding path program 18 times [2019-08-04 21:25:35,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:35,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:25:35,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:36,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:36,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:25:36,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:25:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:25:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:25:36,024 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2019-08-04 21:25:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:36,068 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-04 21:25:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:25:36,069 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-04 21:25:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:36,069 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:25:36,070 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:25:36,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:25:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:25:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:25:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:25:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-04 21:25:36,074 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-08-04 21:25:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:36,075 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-04 21:25:36,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:25:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-04 21:25:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:25:36,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:36,076 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2019-08-04 21:25:36,076 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash -896346769, now seen corresponding path program 19 times [2019-08-04 21:25:36,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:36,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:25:36,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:36,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:36,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:25:36,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:25:36,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:25:36,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:25:36,326 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 22 states. [2019-08-04 21:25:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:36,403 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-04 21:25:36,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:25:36,404 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2019-08-04 21:25:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:36,405 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:25:36,405 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:25:36,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:25:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:25:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:25:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:25:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-04 21:25:36,409 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-08-04 21:25:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:36,409 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-04 21:25:36,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:25:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-04 21:25:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:25:36,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:36,410 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2019-08-04 21:25:36,410 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1815623275, now seen corresponding path program 20 times [2019-08-04 21:25:36,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:36,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:25:36,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:37,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:37,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:25:37,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:25:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:25:37,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:25:37,714 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 23 states. [2019-08-04 21:25:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:37,933 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-04 21:25:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:25:37,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-08-04 21:25:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:37,934 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:25:37,934 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:25:37,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:25:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:25:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:25:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:25:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-04 21:25:37,937 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-08-04 21:25:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:37,938 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-04 21:25:37,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:25:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-04 21:25:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:25:37,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:37,939 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2019-08-04 21:25:37,939 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 973686887, now seen corresponding path program 21 times [2019-08-04 21:25:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:37,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:25:37,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:38,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:38,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:25:38,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:25:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:25:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:25:38,662 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 24 states. [2019-08-04 21:25:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:38,721 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-04 21:25:38,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:25:38,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2019-08-04 21:25:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:38,724 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:25:38,724 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:25:38,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:25:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:25:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:25:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:25:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-04 21:25:38,729 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-08-04 21:25:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:38,729 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-04 21:25:38,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:25:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-04 21:25:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:25:38,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:38,730 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2019-08-04 21:25:38,731 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash -673330333, now seen corresponding path program 22 times [2019-08-04 21:25:38,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:38,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:25:38,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:39,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:39,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:25:39,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:25:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:25:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:25:39,103 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 25 states. [2019-08-04 21:25:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:39,179 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-04 21:25:39,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:25:39,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-04 21:25:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:39,180 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:25:39,180 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:25:39,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:25:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:25:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:25:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:25:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-04 21:25:39,183 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-08-04 21:25:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:39,183 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-04 21:25:39,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:25:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-04 21:25:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:25:39,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:39,184 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2019-08-04 21:25:39,184 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1386053471, now seen corresponding path program 23 times [2019-08-04 21:25:39,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:39,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:25:39,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:39,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:39,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:25:39,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:25:39,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:25:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:25:39,676 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 26 states. [2019-08-04 21:25:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:39,734 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-04 21:25:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:25:39,735 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-08-04 21:25:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:39,736 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:25:39,736 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:25:39,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:25:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:25:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:25:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:25:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-04 21:25:39,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-08-04 21:25:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:39,741 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-04 21:25:39,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:25:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-04 21:25:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:25:39,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:39,742 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2019-08-04 21:25:39,742 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash 473965659, now seen corresponding path program 24 times [2019-08-04 21:25:39,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:39,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:25:39,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:40,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:40,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:25:40,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:25:40,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:25:40,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:25:40,348 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 27 states. [2019-08-04 21:25:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:40,401 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-08-04 21:25:40,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:25:40,401 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2019-08-04 21:25:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:40,402 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:25:40,402 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:25:40,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:25:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:25:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:25:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:25:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-04 21:25:40,406 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-08-04 21:25:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:40,406 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-04 21:25:40,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:25:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-04 21:25:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:25:40,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:40,408 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2019-08-04 21:25:40,408 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash 130906711, now seen corresponding path program 25 times [2019-08-04 21:25:40,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:40,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:25:40,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:40,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:40,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:25:40,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:25:40,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:25:40,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:25:40,946 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 28 states. [2019-08-04 21:25:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:40,986 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-08-04 21:25:40,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:25:40,987 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2019-08-04 21:25:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:40,988 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:25:40,988 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:25:40,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:25:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:25:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:25:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:25:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-04 21:25:40,991 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-08-04 21:25:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:40,991 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-04 21:25:40,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:25:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-04 21:25:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:25:40,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:40,992 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2019-08-04 21:25:40,992 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:40,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1163739475, now seen corresponding path program 26 times [2019-08-04 21:25:40,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:41,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:25:41,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:41,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:25:41,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:25:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:25:41,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:25:41,672 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 29 states. [2019-08-04 21:25:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:41,723 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2019-08-04 21:25:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:25:41,724 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-08-04 21:25:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:41,725 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:25:41,725 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:25:41,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:25:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:25:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:25:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:25:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-04 21:25:41,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-08-04 21:25:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:41,729 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-04 21:25:41,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:25:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-04 21:25:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:25:41,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:41,730 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2019-08-04 21:25:41,730 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1578580303, now seen corresponding path program 27 times [2019-08-04 21:25:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:41,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:25:41,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:42,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:42,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:25:42,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:25:42,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:25:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:25:42,172 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 30 states. [2019-08-04 21:25:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:42,235 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-08-04 21:25:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:25:42,236 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2019-08-04 21:25:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:42,237 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:25:42,237 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:25:42,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:25:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:25:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:25:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:25:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-04 21:25:42,240 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-08-04 21:25:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:42,241 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-04 21:25:42,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:25:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-04 21:25:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:25:42,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:42,241 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2019-08-04 21:25:42,242 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash 808657483, now seen corresponding path program 28 times [2019-08-04 21:25:42,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:42,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:25:42,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:42,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:42,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:25:42,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:25:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:25:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:25:42,665 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 31 states. [2019-08-04 21:25:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:42,703 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-08-04 21:25:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:25:42,703 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-08-04 21:25:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:42,704 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:25:42,704 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:25:42,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:25:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:25:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:25:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:25:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-04 21:25:42,709 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-08-04 21:25:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:42,709 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-04 21:25:42,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:25:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-04 21:25:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:25:42,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:42,710 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2019-08-04 21:25:42,710 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash -352797625, now seen corresponding path program 29 times [2019-08-04 21:25:42,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:25:42,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:43,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:43,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:25:43,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:25:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:25:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:25:43,639 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2019-08-04 21:25:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:43,699 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-08-04 21:25:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:25:43,699 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2019-08-04 21:25:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:43,700 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:25:43,700 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:25:43,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:25:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:25:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:25:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:25:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-08-04 21:25:43,704 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-08-04 21:25:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:43,704 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-08-04 21:25:43,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:25:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-08-04 21:25:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:25:43,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:43,705 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2019-08-04 21:25:43,705 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash 180340547, now seen corresponding path program 30 times [2019-08-04 21:25:43,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:43,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:25:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:44,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:44,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:25:44,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:25:44,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:25:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:25:44,205 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 33 states. [2019-08-04 21:25:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:44,420 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-08-04 21:25:44,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:25:44,421 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-08-04 21:25:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:44,422 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:25:44,422 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:25:44,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:25:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:25:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:25:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:25:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-08-04 21:25:44,426 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-08-04 21:25:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:44,426 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-08-04 21:25:44,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:25:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-08-04 21:25:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:25:44,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:44,427 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2019-08-04 21:25:44,427 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1425015615, now seen corresponding path program 31 times [2019-08-04 21:25:44,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:44,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:25:44,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:44,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:44,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:25:44,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:25:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:25:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:25:44,938 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 34 states. [2019-08-04 21:25:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:44,988 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-08-04 21:25:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:25:44,990 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-08-04 21:25:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:44,991 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:25:44,991 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:25:44,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:25:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:25:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:25:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:25:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-08-04 21:25:44,995 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-08-04 21:25:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:44,996 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-08-04 21:25:44,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:25:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-08-04 21:25:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:25:44,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:44,997 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2019-08-04 21:25:44,997 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -738119621, now seen corresponding path program 32 times [2019-08-04 21:25:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:45,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:25:45,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:45,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:45,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:25:45,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:25:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:25:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:25:45,843 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 35 states. [2019-08-04 21:25:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:45,886 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2019-08-04 21:25:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:25:45,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2019-08-04 21:25:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:45,887 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:25:45,887 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:25:45,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:25:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:25:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:25:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:25:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-08-04 21:25:45,891 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-08-04 21:25:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:45,892 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-08-04 21:25:45,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:25:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-08-04 21:25:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:25:45,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:45,892 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2019-08-04 21:25:45,893 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -746910153, now seen corresponding path program 33 times [2019-08-04 21:25:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:45,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:25:45,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:46,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:46,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:25:46,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:25:46,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:25:46,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:25:46,989 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 36 states. [2019-08-04 21:25:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:47,044 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-08-04 21:25:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:25:47,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2019-08-04 21:25:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:47,046 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:25:47,046 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:25:47,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:25:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:25:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:25:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:25:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-08-04 21:25:47,051 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-08-04 21:25:47,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:47,051 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-08-04 21:25:47,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:25:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-08-04 21:25:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:25:47,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:47,052 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2019-08-04 21:25:47,052 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash -604676813, now seen corresponding path program 34 times [2019-08-04 21:25:47,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:47,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:25:47,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:47,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:47,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:25:47,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:25:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:25:47,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:25:47,941 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 37 states. [2019-08-04 21:25:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:48,042 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2019-08-04 21:25:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:25:48,043 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2019-08-04 21:25:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:48,044 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:25:48,044 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:25:48,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:25:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:25:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:25:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:25:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-08-04 21:25:48,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-08-04 21:25:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:48,048 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-08-04 21:25:48,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:25:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-08-04 21:25:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:25:48,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:48,049 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2019-08-04 21:25:48,049 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1357390545, now seen corresponding path program 35 times [2019-08-04 21:25:48,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:48,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:25:48,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:48,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:48,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:25:48,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:25:48,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:25:48,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:25:48,765 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 38 states. [2019-08-04 21:25:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:48,837 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-08-04 21:25:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:25:48,838 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2019-08-04 21:25:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:48,839 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:25:48,839 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:25:48,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:25:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:25:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:25:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:25:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-08-04 21:25:48,842 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-08-04 21:25:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:48,842 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-08-04 21:25:48,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:25:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-08-04 21:25:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:25:48,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:48,843 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2019-08-04 21:25:48,843 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1134186027, now seen corresponding path program 36 times [2019-08-04 21:25:48,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:48,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:25:48,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:50,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:50,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:25:50,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:25:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:25:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:25:50,865 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 39 states. [2019-08-04 21:25:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:50,941 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-08-04 21:25:50,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:25:50,941 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2019-08-04 21:25:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:50,942 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:25:50,942 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:25:50,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:25:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:25:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:25:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:25:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-08-04 21:25:50,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-08-04 21:25:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:50,946 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-08-04 21:25:50,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:25:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-08-04 21:25:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:25:50,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:50,947 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2019-08-04 21:25:50,947 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1052479449, now seen corresponding path program 37 times [2019-08-04 21:25:50,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:50,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:25:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:51,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:51,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:25:51,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:25:51,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:25:51,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:25:51,759 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 40 states. [2019-08-04 21:25:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:51,812 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-08-04 21:25:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:25:51,813 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2019-08-04 21:25:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:51,814 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:25:51,814 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:25:51,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:25:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:25:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:25:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:25:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-08-04 21:25:51,817 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-08-04 21:25:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:51,817 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-08-04 21:25:51,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:25:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-08-04 21:25:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:25:51,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:51,818 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2019-08-04 21:25:51,818 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2095973155, now seen corresponding path program 38 times [2019-08-04 21:25:51,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:51,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:25:51,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:52,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:52,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:25:52,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:25:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:25:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:25:52,699 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 41 states. [2019-08-04 21:25:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:52,750 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-08-04 21:25:52,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:25:52,751 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2019-08-04 21:25:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:52,752 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:25:52,752 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:25:52,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:25:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:25:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:25:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:25:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-08-04 21:25:52,755 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-08-04 21:25:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:52,755 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-08-04 21:25:52,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:25:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-08-04 21:25:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:25:52,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:52,756 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2019-08-04 21:25:52,757 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:52,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:52,757 INFO L82 PathProgramCache]: Analyzing trace with hash -193018081, now seen corresponding path program 39 times [2019-08-04 21:25:52,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:52,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:25:52,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:53,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:53,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:25:53,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:25:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:25:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:25:53,741 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 42 states. [2019-08-04 21:25:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:53,842 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-08-04 21:25:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:25:53,843 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2019-08-04 21:25:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:53,844 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:25:53,844 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:25:53,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:25:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:25:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:25:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:25:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-08-04 21:25:53,849 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-08-04 21:25:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:53,849 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-08-04 21:25:53,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:25:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-08-04 21:25:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:25:53,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:53,850 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2019-08-04 21:25:53,850 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash -890340325, now seen corresponding path program 40 times [2019-08-04 21:25:53,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:53,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:25:53,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:25:54,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:25:54,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:25:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:25:54,550 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 43 states. [2019-08-04 21:25:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:54,629 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-08-04 21:25:54,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:25:54,630 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2019-08-04 21:25:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:54,631 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:25:54,631 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:25:54,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:25:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:25:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:25:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:25:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-08-04 21:25:54,634 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-08-04 21:25:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:54,635 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-08-04 21:25:54,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:25:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-08-04 21:25:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:25:54,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:54,635 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2019-08-04 21:25:54,635 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:54,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1002118633, now seen corresponding path program 41 times [2019-08-04 21:25:54,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:54,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:25:54,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:55,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:55,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:25:55,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:25:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:25:55,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:25:55,579 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 44 states. [2019-08-04 21:25:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:55,642 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-08-04 21:25:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:25:55,643 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2019-08-04 21:25:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:55,644 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:25:55,644 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:25:55,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:25:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:25:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:25:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:25:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-08-04 21:25:55,648 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-08-04 21:25:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:55,648 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-08-04 21:25:55,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:25:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-08-04 21:25:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:25:55,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:55,649 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2019-08-04 21:25:55,649 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:55,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1046890221, now seen corresponding path program 42 times [2019-08-04 21:25:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:55,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:25:55,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:56,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:25:56,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:25:56,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:25:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:25:56,533 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 45 states. [2019-08-04 21:25:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:56,623 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-08-04 21:25:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:25:56,624 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2019-08-04 21:25:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:56,625 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:25:56,625 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:25:56,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:25:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:25:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:25:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:25:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-08-04 21:25:56,628 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-08-04 21:25:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:56,629 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-08-04 21:25:56,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:25:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-08-04 21:25:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:25:56,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:56,630 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2019-08-04 21:25:56,630 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1122713329, now seen corresponding path program 43 times [2019-08-04 21:25:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:56,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:25:56,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:57,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:57,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:25:57,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:25:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:25:57,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:25:57,421 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 46 states. [2019-08-04 21:25:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:57,478 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-08-04 21:25:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:25:57,479 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2019-08-04 21:25:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:57,480 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:25:57,480 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:25:57,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:25:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:25:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:25:57,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:25:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-08-04 21:25:57,494 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-08-04 21:25:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:57,494 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-08-04 21:25:57,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:25:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-08-04 21:25:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:25:57,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:57,494 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2019-08-04 21:25:57,495 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:57,495 INFO L82 PathProgramCache]: Analyzing trace with hash -974276085, now seen corresponding path program 44 times [2019-08-04 21:25:57,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:57,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:25:57,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:58,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:58,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:25:58,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:25:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:25:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:25:58,354 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 47 states. [2019-08-04 21:25:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:58,429 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2019-08-04 21:25:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:25:58,429 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2019-08-04 21:25:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:58,430 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:25:58,431 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:25:58,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:25:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:25:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:25:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:25:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-08-04 21:25:58,434 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-08-04 21:25:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:58,434 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-08-04 21:25:58,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:25:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-08-04 21:25:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:25:58,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:58,435 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2019-08-04 21:25:58,435 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -60005369, now seen corresponding path program 45 times [2019-08-04 21:25:58,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:58,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:25:58,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:59,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:25:59,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:25:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:25:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:25:59,737 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 48 states. [2019-08-04 21:26:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:00,079 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-08-04 21:26:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:26:00,080 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2019-08-04 21:26:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:00,081 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:26:00,081 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:26:00,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:26:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:26:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-04 21:26:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:26:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-08-04 21:26:00,084 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-08-04 21:26:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:00,084 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-08-04 21:26:00,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:26:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-08-04 21:26:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:26:00,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:00,085 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2019-08-04 21:26:00,085 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1914142973, now seen corresponding path program 46 times [2019-08-04 21:26:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:00,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:26:00,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:00,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:00,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:26:00,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:26:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:26:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:26:00,948 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2019-08-04 21:26:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:01,012 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-08-04 21:26:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:26:01,018 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2019-08-04 21:26:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:01,019 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:26:01,019 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:26:01,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:26:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:26:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:26:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:26:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-08-04 21:26:01,022 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-08-04 21:26:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:01,022 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-08-04 21:26:01,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:26:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-08-04 21:26:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:26:01,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:01,023 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2019-08-04 21:26:01,024 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1328952577, now seen corresponding path program 47 times [2019-08-04 21:26:01,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:01,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:26:01,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:03,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:03,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:26:03,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:26:03,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:26:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:26:03,307 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 50 states. [2019-08-04 21:26:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:03,375 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-08-04 21:26:03,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:26:03,377 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-08-04 21:26:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:03,378 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:26:03,378 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:26:03,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:26:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:26:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:26:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:26:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-08-04 21:26:03,381 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-08-04 21:26:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:03,382 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-08-04 21:26:03,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:26:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-08-04 21:26:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:26:03,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:03,383 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2019-08-04 21:26:03,383 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1601697797, now seen corresponding path program 48 times [2019-08-04 21:26:03,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:03,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:26:03,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:04,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:04,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:26:04,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:26:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:26:04,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:26:04,574 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 51 states. [2019-08-04 21:26:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:04,638 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2019-08-04 21:26:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:26:04,639 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2019-08-04 21:26:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:04,640 INFO L225 Difference]: With dead ends: 105 [2019-08-04 21:26:04,641 INFO L226 Difference]: Without dead ends: 105 [2019-08-04 21:26:04,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:26:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-04 21:26:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-04 21:26:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:26:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-08-04 21:26:04,644 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-08-04 21:26:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:04,644 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-08-04 21:26:04,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:26:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-08-04 21:26:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:26:04,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:04,645 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2019-08-04 21:26:04,645 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1716849161, now seen corresponding path program 49 times [2019-08-04 21:26:04,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:04,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:26:04,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:26:05,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:26:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:26:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:26:05,684 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 52 states. [2019-08-04 21:26:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:06,191 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-08-04 21:26:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:26:06,191 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2019-08-04 21:26:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:06,193 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:26:06,193 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:26:06,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:26:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:26:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:26:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:26:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-08-04 21:26:06,196 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-08-04 21:26:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:06,196 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-08-04 21:26:06,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:26:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-08-04 21:26:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:26:06,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:06,197 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2019-08-04 21:26:06,198 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:06,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash -708160269, now seen corresponding path program 50 times [2019-08-04 21:26:06,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:06,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:26:06,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:07,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:26:07,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:26:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:26:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:26:07,278 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 53 states. [2019-08-04 21:26:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:07,423 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-08-04 21:26:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:26:07,424 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2019-08-04 21:26:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:07,426 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:26:07,426 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:26:07,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:26:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:26:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:26:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:26:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-08-04 21:26:07,429 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-08-04 21:26:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:07,429 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-08-04 21:26:07,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:26:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-08-04 21:26:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:26:07,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:07,430 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2019-08-04 21:26:07,431 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2020743953, now seen corresponding path program 51 times [2019-08-04 21:26:07,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:07,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:26:07,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:08,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:08,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:26:08,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:26:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:26:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:26:08,912 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 54 states. [2019-08-04 21:26:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:09,060 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-08-04 21:26:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:26:09,061 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2019-08-04 21:26:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:09,061 INFO L225 Difference]: With dead ends: 111 [2019-08-04 21:26:09,062 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:26:09,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:26:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:26:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-04 21:26:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:26:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-08-04 21:26:09,064 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-08-04 21:26:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:09,064 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-08-04 21:26:09,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:26:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-08-04 21:26:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:26:09,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:09,065 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2019-08-04 21:26:09,065 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash -693279253, now seen corresponding path program 52 times [2019-08-04 21:26:09,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:09,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:26:09,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:10,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:10,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:26:10,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:26:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:26:10,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:26:10,163 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 55 states. [2019-08-04 21:26:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:10,258 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2019-08-04 21:26:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:26:10,258 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2019-08-04 21:26:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:10,259 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:26:10,259 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:26:10,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:26:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:26:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:26:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:26:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-08-04 21:26:10,263 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-08-04 21:26:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:10,264 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-08-04 21:26:10,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:26:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-08-04 21:26:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:26:10,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:10,265 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2019-08-04 21:26:10,265 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash -604989465, now seen corresponding path program 53 times [2019-08-04 21:26:10,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:10,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:26:10,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:11,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:11,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:26:11,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:26:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:26:11,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:26:11,471 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 56 states. [2019-08-04 21:26:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:11,570 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-08-04 21:26:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:26:11,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2019-08-04 21:26:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:11,572 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:26:11,572 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:26:11,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:26:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:26:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-04 21:26:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-04 21:26:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-08-04 21:26:11,575 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-08-04 21:26:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:11,576 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-08-04 21:26:11,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:26:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-08-04 21:26:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:26:11,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:11,577 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2019-08-04 21:26:11,577 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1657849117, now seen corresponding path program 54 times [2019-08-04 21:26:11,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:11,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:26:11,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:12,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:12,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:26:12,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:26:12,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:26:12,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:26:12,789 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 57 states. [2019-08-04 21:26:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:12,892 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-08-04 21:26:12,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:26:12,892 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2019-08-04 21:26:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:12,893 INFO L225 Difference]: With dead ends: 117 [2019-08-04 21:26:12,893 INFO L226 Difference]: Without dead ends: 117 [2019-08-04 21:26:12,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:26:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-04 21:26:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-04 21:26:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:26:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-08-04 21:26:12,896 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-08-04 21:26:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:12,896 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-08-04 21:26:12,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:26:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-08-04 21:26:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:26:12,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:12,897 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2019-08-04 21:26:12,898 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash 156307167, now seen corresponding path program 55 times [2019-08-04 21:26:12,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:12,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:26:12,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:14,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:14,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:26:14,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:26:14,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:26:14,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:26:14,565 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 58 states. [2019-08-04 21:26:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:14,640 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2019-08-04 21:26:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:26:14,640 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 116 [2019-08-04 21:26:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:14,641 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:26:14,641 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:26:14,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:26:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:26:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-04 21:26:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-04 21:26:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-08-04 21:26:14,644 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-08-04 21:26:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:14,644 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-08-04 21:26:14,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:26:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-08-04 21:26:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-04 21:26:14,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:14,645 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2019-08-04 21:26:14,645 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -196226085, now seen corresponding path program 56 times [2019-08-04 21:26:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:14,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:26:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:15,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:15,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:26:15,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:26:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:26:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:26:15,997 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 59 states. [2019-08-04 21:26:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:16,075 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-08-04 21:26:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:26:16,077 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 118 [2019-08-04 21:26:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:16,078 INFO L225 Difference]: With dead ends: 121 [2019-08-04 21:26:16,078 INFO L226 Difference]: Without dead ends: 121 [2019-08-04 21:26:16,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:26:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-04 21:26:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-04 21:26:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:26:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-08-04 21:26:16,080 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-08-04 21:26:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:16,080 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-08-04 21:26:16,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:26:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-08-04 21:26:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-04 21:26:16,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:16,081 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2019-08-04 21:26:16,081 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 321735127, now seen corresponding path program 57 times [2019-08-04 21:26:16,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:16,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:26:16,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:17,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:17,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:26:17,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:26:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:26:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:26:17,441 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 60 states. [2019-08-04 21:26:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:17,620 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-08-04 21:26:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:26:17,620 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2019-08-04 21:26:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:17,621 INFO L225 Difference]: With dead ends: 123 [2019-08-04 21:26:17,621 INFO L226 Difference]: Without dead ends: 123 [2019-08-04 21:26:17,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:26:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-04 21:26:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-04 21:26:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-04 21:26:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-08-04 21:26:17,625 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-08-04 21:26:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:17,625 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-08-04 21:26:17,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:26:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-08-04 21:26:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-04 21:26:17,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:17,626 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2019-08-04 21:26:17,626 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:17,627 INFO L82 PathProgramCache]: Analyzing trace with hash -133746477, now seen corresponding path program 58 times [2019-08-04 21:26:17,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:17,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:26:17,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:19,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:26:19,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:26:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:26:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:26:19,570 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 61 states. [2019-08-04 21:26:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:19,656 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-08-04 21:26:19,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:26:19,657 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2019-08-04 21:26:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:19,658 INFO L225 Difference]: With dead ends: 125 [2019-08-04 21:26:19,658 INFO L226 Difference]: Without dead ends: 125 [2019-08-04 21:26:19,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:26:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-04 21:26:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-04 21:26:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-04 21:26:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-08-04 21:26:19,661 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-08-04 21:26:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:19,662 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-08-04 21:26:19,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:26:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-08-04 21:26:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-04 21:26:19,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:19,663 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2019-08-04 21:26:19,663 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash 235096271, now seen corresponding path program 59 times [2019-08-04 21:26:19,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:19,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:26:19,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:21,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:21,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:26:21,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:26:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:26:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:26:21,096 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 62 states. [2019-08-04 21:26:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:21,207 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-08-04 21:26:21,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:26:21,214 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 124 [2019-08-04 21:26:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:21,214 INFO L225 Difference]: With dead ends: 127 [2019-08-04 21:26:21,215 INFO L226 Difference]: Without dead ends: 127 [2019-08-04 21:26:21,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:26:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-04 21:26:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-04 21:26:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-04 21:26:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-08-04 21:26:21,217 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-08-04 21:26:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:21,218 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-08-04 21:26:21,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:26:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-08-04 21:26:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-04 21:26:21,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:21,219 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2019-08-04 21:26:21,219 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1789308469, now seen corresponding path program 60 times [2019-08-04 21:26:21,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:21,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:26:21,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:22,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:22,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:26:22,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:26:22,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:26:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:26:22,661 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 63 states. [2019-08-04 21:26:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:22,743 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2019-08-04 21:26:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:26:22,744 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2019-08-04 21:26:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:22,745 INFO L225 Difference]: With dead ends: 129 [2019-08-04 21:26:22,745 INFO L226 Difference]: Without dead ends: 129 [2019-08-04 21:26:22,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:26:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-04 21:26:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-04 21:26:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-04 21:26:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-08-04 21:26:22,748 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-08-04 21:26:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:22,748 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-08-04 21:26:22,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:26:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-08-04 21:26:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-04 21:26:22,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:22,749 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2019-08-04 21:26:22,749 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1622078521, now seen corresponding path program 61 times [2019-08-04 21:26:22,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:22,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:26:22,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:24,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:24,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:26:24,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:26:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:26:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:26:24,322 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 64 states. [2019-08-04 21:26:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:24,472 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-08-04 21:26:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:26:24,473 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2019-08-04 21:26:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:24,473 INFO L225 Difference]: With dead ends: 131 [2019-08-04 21:26:24,473 INFO L226 Difference]: Without dead ends: 131 [2019-08-04 21:26:24,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:26:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-04 21:26:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-04 21:26:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-04 21:26:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-08-04 21:26:24,476 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-08-04 21:26:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:24,476 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-08-04 21:26:24,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:26:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-08-04 21:26:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-04 21:26:24,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:24,477 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2019-08-04 21:26:24,477 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 172111555, now seen corresponding path program 62 times [2019-08-04 21:26:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:24,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:26:24,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:25,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:25,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:26:25,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:26:25,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:26:25,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:26:25,922 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 65 states. [2019-08-04 21:26:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:26,032 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-08-04 21:26:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:26:26,033 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2019-08-04 21:26:26,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:26,034 INFO L225 Difference]: With dead ends: 133 [2019-08-04 21:26:26,034 INFO L226 Difference]: Without dead ends: 133 [2019-08-04 21:26:26,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:26:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-04 21:26:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-04 21:26:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-04 21:26:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-08-04 21:26:26,037 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-08-04 21:26:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:26,037 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-08-04 21:26:26,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:26:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-08-04 21:26:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-04 21:26:26,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:26,038 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2019-08-04 21:26:26,039 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2106888895, now seen corresponding path program 63 times [2019-08-04 21:26:26,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:26,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:26:26,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:27,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:26:27,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:26:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:26:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:26:27,723 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 66 states. [2019-08-04 21:26:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:27,802 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-08-04 21:26:27,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:26:27,802 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 132 [2019-08-04 21:26:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:27,803 INFO L225 Difference]: With dead ends: 135 [2019-08-04 21:26:27,803 INFO L226 Difference]: Without dead ends: 135 [2019-08-04 21:26:27,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:26:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-04 21:26:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-04 21:26:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-04 21:26:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-08-04 21:26:27,807 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-08-04 21:26:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:27,807 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-08-04 21:26:27,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:26:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-08-04 21:26:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-04 21:26:27,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:27,808 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2019-08-04 21:26:27,808 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:27,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:27,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1707073467, now seen corresponding path program 64 times [2019-08-04 21:26:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:27,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:26:27,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:29,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:29,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:26:29,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:26:29,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:26:29,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:26:29,671 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 67 states. [2019-08-04 21:26:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:29,768 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-08-04 21:26:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:26:29,769 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 134 [2019-08-04 21:26:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:29,770 INFO L225 Difference]: With dead ends: 137 [2019-08-04 21:26:29,770 INFO L226 Difference]: Without dead ends: 137 [2019-08-04 21:26:29,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:26:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-04 21:26:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-04 21:26:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-04 21:26:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-08-04 21:26:29,774 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-08-04 21:26:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:29,774 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-08-04 21:26:29,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:26:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-08-04 21:26:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-04 21:26:29,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:29,775 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2019-08-04 21:26:29,775 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash -263463497, now seen corresponding path program 65 times [2019-08-04 21:26:29,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:29,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:26:29,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:31,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:31,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:26:31,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:26:31,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:26:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:26:31,556 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 68 states. [2019-08-04 21:26:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:31,727 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-08-04 21:26:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:26:31,727 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2019-08-04 21:26:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:31,728 INFO L225 Difference]: With dead ends: 139 [2019-08-04 21:26:31,728 INFO L226 Difference]: Without dead ends: 139 [2019-08-04 21:26:31,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:26:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-04 21:26:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-04 21:26:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-04 21:26:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-08-04 21:26:31,732 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-08-04 21:26:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:31,732 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-08-04 21:26:31,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:26:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-08-04 21:26:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-04 21:26:31,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:31,733 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2019-08-04 21:26:31,733 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:31,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash 131091635, now seen corresponding path program 66 times [2019-08-04 21:26:31,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:31,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:26:31,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:33,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:33,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:26:33,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:26:33,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:26:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:26:33,394 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 69 states. [2019-08-04 21:26:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:33,519 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-08-04 21:26:33,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:26:33,520 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2019-08-04 21:26:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:33,521 INFO L225 Difference]: With dead ends: 141 [2019-08-04 21:26:33,521 INFO L226 Difference]: Without dead ends: 141 [2019-08-04 21:26:33,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:26:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-04 21:26:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-04 21:26:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-04 21:26:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-08-04 21:26:33,524 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-08-04 21:26:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:33,524 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-08-04 21:26:33,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:26:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-08-04 21:26:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-04 21:26:33,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:33,525 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2019-08-04 21:26:33,525 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1341451439, now seen corresponding path program 67 times [2019-08-04 21:26:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:33,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:26:33,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:35,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:26:35,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:26:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:26:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:26:35,576 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 70 states. [2019-08-04 21:26:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:35,746 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-08-04 21:26:35,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:26:35,746 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 140 [2019-08-04 21:26:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:35,748 INFO L225 Difference]: With dead ends: 143 [2019-08-04 21:26:35,748 INFO L226 Difference]: Without dead ends: 143 [2019-08-04 21:26:35,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:26:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-04 21:26:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-04 21:26:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-04 21:26:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-08-04 21:26:35,751 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-08-04 21:26:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:35,751 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-08-04 21:26:35,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:26:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-08-04 21:26:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-04 21:26:35,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:35,752 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2019-08-04 21:26:35,752 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash 561085867, now seen corresponding path program 68 times [2019-08-04 21:26:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:35,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:26:35,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:37,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:37,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:26:37,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:26:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:26:37,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:26:37,452 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 71 states. [2019-08-04 21:26:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:37,556 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-08-04 21:26:37,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:26:37,557 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2019-08-04 21:26:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:37,558 INFO L225 Difference]: With dead ends: 145 [2019-08-04 21:26:37,558 INFO L226 Difference]: Without dead ends: 145 [2019-08-04 21:26:37,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:26:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-04 21:26:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-04 21:26:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-04 21:26:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-08-04 21:26:37,562 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-08-04 21:26:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:37,562 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-08-04 21:26:37,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:26:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-08-04 21:26:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-04 21:26:37,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:37,563 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2019-08-04 21:26:37,563 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2045919321, now seen corresponding path program 69 times [2019-08-04 21:26:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:37,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:26:37,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:39,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:26:39,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:26:39,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:26:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:26:39,687 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 72 states. [2019-08-04 21:26:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:39,914 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-08-04 21:26:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:26:39,915 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2019-08-04 21:26:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:39,916 INFO L225 Difference]: With dead ends: 147 [2019-08-04 21:26:39,916 INFO L226 Difference]: Without dead ends: 147 [2019-08-04 21:26:39,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:26:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-04 21:26:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-04 21:26:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-04 21:26:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-08-04 21:26:39,920 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-08-04 21:26:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:39,920 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-08-04 21:26:39,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:26:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-08-04 21:26:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-04 21:26:39,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:39,921 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2019-08-04 21:26:39,922 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash 882995875, now seen corresponding path program 70 times [2019-08-04 21:26:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:39,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:26:39,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:41,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:41,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:26:41,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:26:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:26:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:26:41,802 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 73 states. [2019-08-04 21:26:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:41,931 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-08-04 21:26:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:26:41,932 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2019-08-04 21:26:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:41,933 INFO L225 Difference]: With dead ends: 149 [2019-08-04 21:26:41,933 INFO L226 Difference]: Without dead ends: 149 [2019-08-04 21:26:41,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:26:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-04 21:26:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-04 21:26:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-04 21:26:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-08-04 21:26:41,936 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-08-04 21:26:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:41,936 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-08-04 21:26:41,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:26:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-08-04 21:26:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-04 21:26:41,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:41,937 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2019-08-04 21:26:41,937 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1928046945, now seen corresponding path program 71 times [2019-08-04 21:26:41,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:41,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:26:41,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:43,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:43,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:26:43,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:26:43,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:26:43,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:26:43,849 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 74 states. [2019-08-04 21:26:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:43,952 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-08-04 21:26:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:26:43,953 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 148 [2019-08-04 21:26:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:43,954 INFO L225 Difference]: With dead ends: 151 [2019-08-04 21:26:43,954 INFO L226 Difference]: Without dead ends: 151 [2019-08-04 21:26:43,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:26:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-04 21:26:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-04 21:26:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-04 21:26:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-08-04 21:26:43,957 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-08-04 21:26:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:43,958 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-08-04 21:26:43,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:26:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-08-04 21:26:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-04 21:26:43,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:43,959 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2019-08-04 21:26:43,959 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:43,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1805767781, now seen corresponding path program 72 times [2019-08-04 21:26:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:44,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:26:44,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:46,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:46,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:26:46,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:26:46,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:26:46,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:26:46,262 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 75 states. [2019-08-04 21:26:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:46,373 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-08-04 21:26:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:26:46,378 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 150 [2019-08-04 21:26:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:46,378 INFO L225 Difference]: With dead ends: 153 [2019-08-04 21:26:46,378 INFO L226 Difference]: Without dead ends: 153 [2019-08-04 21:26:46,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:26:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-04 21:26:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-04 21:26:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-04 21:26:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-08-04 21:26:46,381 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-08-04 21:26:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:46,381 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-08-04 21:26:46,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:26:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-08-04 21:26:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-04 21:26:46,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:46,382 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2019-08-04 21:26:46,382 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:46,382 INFO L82 PathProgramCache]: Analyzing trace with hash -259608169, now seen corresponding path program 73 times [2019-08-04 21:26:46,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:46,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:26:46,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:48,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:48,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:26:48,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:26:48,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:26:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:26:48,413 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 76 states. [2019-08-04 21:26:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:48,518 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-08-04 21:26:48,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:26:48,518 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2019-08-04 21:26:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:48,519 INFO L225 Difference]: With dead ends: 155 [2019-08-04 21:26:48,519 INFO L226 Difference]: Without dead ends: 155 [2019-08-04 21:26:48,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:26:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-04 21:26:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-04 21:26:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-04 21:26:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-08-04 21:26:48,523 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-08-04 21:26:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:48,523 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-08-04 21:26:48,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:26:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-08-04 21:26:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-04 21:26:48,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:48,525 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2019-08-04 21:26:48,525 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash -458905453, now seen corresponding path program 74 times [2019-08-04 21:26:48,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:48,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:26:48,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:50,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:50,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:26:50,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:26:50,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:26:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:26:50,793 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 77 states. [2019-08-04 21:26:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:50,888 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-04 21:26:50,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:26:50,888 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2019-08-04 21:26:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:50,889 INFO L225 Difference]: With dead ends: 157 [2019-08-04 21:26:50,890 INFO L226 Difference]: Without dead ends: 157 [2019-08-04 21:26:50,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:26:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-04 21:26:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-04 21:26:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-04 21:26:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-08-04 21:26:50,893 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-08-04 21:26:50,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:50,893 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-08-04 21:26:50,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:26:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-08-04 21:26:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-04 21:26:50,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:50,894 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2019-08-04 21:26:50,894 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1289932943, now seen corresponding path program 75 times [2019-08-04 21:26:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:50,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:26:50,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:53,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:53,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:26:53,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:26:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:26:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:26:53,061 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 78 states. [2019-08-04 21:26:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:53,175 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-08-04 21:26:53,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:26:53,175 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 156 [2019-08-04 21:26:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:53,176 INFO L225 Difference]: With dead ends: 159 [2019-08-04 21:26:53,177 INFO L226 Difference]: Without dead ends: 159 [2019-08-04 21:26:53,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:26:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-04 21:26:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-04 21:26:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:26:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-08-04 21:26:53,179 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-08-04 21:26:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:53,180 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-08-04 21:26:53,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:26:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-08-04 21:26:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-04 21:26:53,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:53,180 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2019-08-04 21:26:53,181 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1703548533, now seen corresponding path program 76 times [2019-08-04 21:26:53,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:53,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:26:53,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:55,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:55,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:26:55,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:26:55,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:26:55,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:26:55,598 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 79 states. [2019-08-04 21:26:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:55,708 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-08-04 21:26:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:26:55,709 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 158 [2019-08-04 21:26:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:55,710 INFO L225 Difference]: With dead ends: 161 [2019-08-04 21:26:55,711 INFO L226 Difference]: Without dead ends: 161 [2019-08-04 21:26:55,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:26:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-04 21:26:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-04 21:26:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-04 21:26:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-08-04 21:26:55,713 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-08-04 21:26:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:55,714 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-08-04 21:26:55,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:26:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-08-04 21:26:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-04 21:26:55,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:55,715 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2019-08-04 21:26:55,715 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -811158649, now seen corresponding path program 77 times [2019-08-04 21:26:55,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:55,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:26:55,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:57,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:57,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:26:57,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:26:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:26:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:26:57,863 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 80 states. [2019-08-04 21:26:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:57,993 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-08-04 21:26:57,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:26:57,994 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2019-08-04 21:26:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:57,995 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:26:57,995 INFO L226 Difference]: Without dead ends: 163 [2019-08-04 21:26:57,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:26:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-04 21:26:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-04 21:26:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-04 21:26:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-08-04 21:26:57,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-08-04 21:26:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:57,998 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-08-04 21:26:57,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:26:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-08-04 21:26:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-04 21:26:57,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:58,000 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2019-08-04 21:26:58,000 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2077027971, now seen corresponding path program 78 times [2019-08-04 21:26:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:58,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:26:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:00,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:00,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:27:00,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:27:00,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:27:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:27:00,541 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 81 states. [2019-08-04 21:27:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:00,651 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-08-04 21:27:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:27:00,652 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2019-08-04 21:27:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:00,653 INFO L225 Difference]: With dead ends: 165 [2019-08-04 21:27:00,653 INFO L226 Difference]: Without dead ends: 165 [2019-08-04 21:27:00,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:27:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-04 21:27:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-04 21:27:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-04 21:27:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-08-04 21:27:00,656 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-08-04 21:27:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:00,656 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-08-04 21:27:00,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:27:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-08-04 21:27:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-04 21:27:00,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:00,657 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2019-08-04 21:27:00,657 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1219470721, now seen corresponding path program 79 times [2019-08-04 21:27:00,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:00,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:27:00,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:02,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:02,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:27:02,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:27:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:27:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:27:02,938 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 82 states. [2019-08-04 21:27:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:03,054 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-08-04 21:27:03,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:27:03,055 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 164 [2019-08-04 21:27:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:03,056 INFO L225 Difference]: With dead ends: 167 [2019-08-04 21:27:03,056 INFO L226 Difference]: Without dead ends: 167 [2019-08-04 21:27:03,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:27:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-04 21:27:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-04 21:27:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-04 21:27:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-08-04 21:27:03,060 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-08-04 21:27:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:03,060 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-08-04 21:27:03,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:27:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-08-04 21:27:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-04 21:27:03,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:03,061 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2019-08-04 21:27:03,061 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 531150715, now seen corresponding path program 80 times [2019-08-04 21:27:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:03,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:27:03,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:05,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:05,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:27:05,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:27:05,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:27:05,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:27:05,554 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 83 states. [2019-08-04 21:27:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:05,670 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-08-04 21:27:05,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:27:05,670 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 166 [2019-08-04 21:27:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:05,671 INFO L225 Difference]: With dead ends: 169 [2019-08-04 21:27:05,672 INFO L226 Difference]: Without dead ends: 169 [2019-08-04 21:27:05,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:27:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-04 21:27:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-04 21:27:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-04 21:27:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-08-04 21:27:05,675 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-08-04 21:27:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:05,675 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-08-04 21:27:05,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:27:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-08-04 21:27:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-04 21:27:05,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:05,676 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2019-08-04 21:27:05,676 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:05,676 INFO L82 PathProgramCache]: Analyzing trace with hash -748829321, now seen corresponding path program 81 times [2019-08-04 21:27:05,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:05,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:27:05,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:08,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:08,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:27:08,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:27:08,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:27:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:27:08,010 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 84 states. [2019-08-04 21:27:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:08,141 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-08-04 21:27:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:27:08,141 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2019-08-04 21:27:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:08,143 INFO L225 Difference]: With dead ends: 171 [2019-08-04 21:27:08,143 INFO L226 Difference]: Without dead ends: 171 [2019-08-04 21:27:08,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:27:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-04 21:27:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-04 21:27:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-04 21:27:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-08-04 21:27:08,146 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-08-04 21:27:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:08,146 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-08-04 21:27:08,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:27:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-08-04 21:27:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-04 21:27:08,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:08,147 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2019-08-04 21:27:08,147 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1845970035, now seen corresponding path program 82 times [2019-08-04 21:27:08,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:08,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:27:08,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:10,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:10,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:27:10,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:27:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:27:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:27:10,795 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 85 states. [2019-08-04 21:27:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:10,901 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-08-04 21:27:10,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:27:10,901 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2019-08-04 21:27:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:10,902 INFO L225 Difference]: With dead ends: 173 [2019-08-04 21:27:10,903 INFO L226 Difference]: Without dead ends: 173 [2019-08-04 21:27:10,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:27:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-04 21:27:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-04 21:27:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-04 21:27:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-08-04 21:27:10,906 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-08-04 21:27:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:10,906 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-08-04 21:27:10,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:27:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-08-04 21:27:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-04 21:27:10,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:10,907 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2019-08-04 21:27:10,908 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 72152175, now seen corresponding path program 83 times [2019-08-04 21:27:10,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:11,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:27:11,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:13,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:27:13,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:27:13,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:27:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:27:13,419 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 86 states. [2019-08-04 21:27:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:13,534 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-08-04 21:27:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:27:13,534 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 172 [2019-08-04 21:27:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:13,535 INFO L225 Difference]: With dead ends: 175 [2019-08-04 21:27:13,535 INFO L226 Difference]: Without dead ends: 175 [2019-08-04 21:27:13,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:27:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-04 21:27:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-04 21:27:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-04 21:27:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-08-04 21:27:13,539 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-08-04 21:27:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:13,539 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-08-04 21:27:13,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:27:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-08-04 21:27:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-04 21:27:13,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:13,540 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2019-08-04 21:27:13,540 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:13,541 INFO L82 PathProgramCache]: Analyzing trace with hash 535205227, now seen corresponding path program 84 times [2019-08-04 21:27:13,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:13,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:27:13,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:16,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:16,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:27:16,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:27:16,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:27:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:27:16,432 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 87 states. [2019-08-04 21:27:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:16,562 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-08-04 21:27:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:27:16,563 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 174 [2019-08-04 21:27:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:16,564 INFO L225 Difference]: With dead ends: 177 [2019-08-04 21:27:16,564 INFO L226 Difference]: Without dead ends: 177 [2019-08-04 21:27:16,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:27:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-04 21:27:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-08-04 21:27:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-04 21:27:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-08-04 21:27:16,568 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-08-04 21:27:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:16,568 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-08-04 21:27:16,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:27:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-08-04 21:27:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-04 21:27:16,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:16,569 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2019-08-04 21:27:16,569 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1147410585, now seen corresponding path program 85 times [2019-08-04 21:27:16,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:16,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:27:16,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:19,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:19,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:27:19,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:27:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:27:19,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:27:19,252 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 88 states. [2019-08-04 21:27:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:19,374 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-08-04 21:27:19,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:27:19,375 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2019-08-04 21:27:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:19,376 INFO L225 Difference]: With dead ends: 179 [2019-08-04 21:27:19,376 INFO L226 Difference]: Without dead ends: 179 [2019-08-04 21:27:19,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:27:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-04 21:27:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-04 21:27:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-04 21:27:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-08-04 21:27:19,380 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-08-04 21:27:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:19,380 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-08-04 21:27:19,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:27:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-08-04 21:27:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-04 21:27:19,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:19,381 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2019-08-04 21:27:19,381 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:19,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1061464675, now seen corresponding path program 86 times [2019-08-04 21:27:19,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:19,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:27:19,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:22,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:27:22,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:27:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:27:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:27:22,415 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 89 states. [2019-08-04 21:27:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:23,008 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-08-04 21:27:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:27:23,008 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 178 [2019-08-04 21:27:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:23,009 INFO L225 Difference]: With dead ends: 181 [2019-08-04 21:27:23,009 INFO L226 Difference]: Without dead ends: 181 [2019-08-04 21:27:23,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:27:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-04 21:27:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-08-04 21:27:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-04 21:27:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-08-04 21:27:23,012 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-08-04 21:27:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:23,013 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-08-04 21:27:23,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:27:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-08-04 21:27:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-04 21:27:23,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:23,013 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2019-08-04 21:27:23,014 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:23,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2076745311, now seen corresponding path program 87 times [2019-08-04 21:27:23,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:23,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:27:23,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:25,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:25,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:27:25,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:27:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:27:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:27:25,832 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 90 states. [2019-08-04 21:27:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:26,034 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-08-04 21:27:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:27:26,035 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 180 [2019-08-04 21:27:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:26,036 INFO L225 Difference]: With dead ends: 183 [2019-08-04 21:27:26,036 INFO L226 Difference]: Without dead ends: 183 [2019-08-04 21:27:26,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:27:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-04 21:27:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-04 21:27:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-04 21:27:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-08-04 21:27:26,039 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-08-04 21:27:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:26,039 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-08-04 21:27:26,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:27:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-08-04 21:27:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-04 21:27:26,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:26,040 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2019-08-04 21:27:26,040 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:26,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1491106981, now seen corresponding path program 88 times [2019-08-04 21:27:26,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:26,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:27:26,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:28,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:28,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:27:28,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:27:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:27:28,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:27:28,845 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 91 states. [2019-08-04 21:27:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:28,978 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-08-04 21:27:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:27:28,979 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 182 [2019-08-04 21:27:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:28,980 INFO L225 Difference]: With dead ends: 185 [2019-08-04 21:27:28,980 INFO L226 Difference]: Without dead ends: 185 [2019-08-04 21:27:28,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:27:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-04 21:27:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-04 21:27:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-04 21:27:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-08-04 21:27:28,983 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-08-04 21:27:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:28,984 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-08-04 21:27:28,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:27:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-08-04 21:27:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-04 21:27:28,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:28,985 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2019-08-04 21:27:28,985 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1481709911, now seen corresponding path program 89 times [2019-08-04 21:27:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:29,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:27:29,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:32,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:27:32,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:27:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:27:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:27:32,069 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 92 states. [2019-08-04 21:27:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:32,221 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-08-04 21:27:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:27:32,222 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 184 [2019-08-04 21:27:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:32,223 INFO L225 Difference]: With dead ends: 187 [2019-08-04 21:27:32,223 INFO L226 Difference]: Without dead ends: 187 [2019-08-04 21:27:32,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:27:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-04 21:27:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-04 21:27:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-04 21:27:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-08-04 21:27:32,227 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-08-04 21:27:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:32,228 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-08-04 21:27:32,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:27:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-08-04 21:27:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-04 21:27:32,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:32,229 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2019-08-04 21:27:32,229 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2089476013, now seen corresponding path program 90 times [2019-08-04 21:27:32,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:32,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:27:32,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:35,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:35,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:27:35,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:27:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:27:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:27:35,212 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 93 states. [2019-08-04 21:27:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:35,352 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-08-04 21:27:35,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:27:35,353 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 186 [2019-08-04 21:27:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:35,354 INFO L225 Difference]: With dead ends: 189 [2019-08-04 21:27:35,354 INFO L226 Difference]: Without dead ends: 189 [2019-08-04 21:27:35,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:27:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-04 21:27:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-08-04 21:27:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-04 21:27:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-08-04 21:27:35,358 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-08-04 21:27:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:35,358 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-08-04 21:27:35,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:27:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-08-04 21:27:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-04 21:27:35,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:35,359 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2019-08-04 21:27:35,359 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1974687823, now seen corresponding path program 91 times [2019-08-04 21:27:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:35,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:27:35,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:38,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:27:38,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:27:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:27:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:27:38,663 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 94 states. [2019-08-04 21:27:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:38,810 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-08-04 21:27:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:27:38,811 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 188 [2019-08-04 21:27:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:38,812 INFO L225 Difference]: With dead ends: 191 [2019-08-04 21:27:38,812 INFO L226 Difference]: Without dead ends: 191 [2019-08-04 21:27:38,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:27:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-04 21:27:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-04 21:27:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-04 21:27:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-08-04 21:27:38,815 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-08-04 21:27:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:38,816 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-08-04 21:27:38,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:27:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-08-04 21:27:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-04 21:27:38,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:38,817 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2019-08-04 21:27:38,817 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash -784105141, now seen corresponding path program 92 times [2019-08-04 21:27:38,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:38,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:27:38,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:42,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:42,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:27:42,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:27:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:27:42,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:27:42,577 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 95 states. [2019-08-04 21:27:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:42,716 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-08-04 21:27:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:27:42,717 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 190 [2019-08-04 21:27:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:42,718 INFO L225 Difference]: With dead ends: 193 [2019-08-04 21:27:42,718 INFO L226 Difference]: Without dead ends: 193 [2019-08-04 21:27:42,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:27:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-04 21:27:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-08-04 21:27:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-04 21:27:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-08-04 21:27:42,722 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-08-04 21:27:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:42,722 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-08-04 21:27:42,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:27:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-08-04 21:27:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-04 21:27:42,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:42,723 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2019-08-04 21:27:42,723 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:42,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:42,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1989321913, now seen corresponding path program 93 times [2019-08-04 21:27:42,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:42,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:27:42,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:45,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:27:45,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:27:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:27:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:27:45,807 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 96 states. [2019-08-04 21:27:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:45,957 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-08-04 21:27:45,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:27:45,958 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 192 [2019-08-04 21:27:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:45,959 INFO L225 Difference]: With dead ends: 195 [2019-08-04 21:27:45,959 INFO L226 Difference]: Without dead ends: 195 [2019-08-04 21:27:45,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:27:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-04 21:27:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-08-04 21:27:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-04 21:27:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-08-04 21:27:45,963 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-08-04 21:27:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:45,963 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-08-04 21:27:45,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:27:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-08-04 21:27:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-04 21:27:45,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:45,964 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2019-08-04 21:27:45,964 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -561469885, now seen corresponding path program 94 times [2019-08-04 21:27:45,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:46,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:27:46,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:49,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:49,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:27:49,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:27:49,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:27:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:27:49,348 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 97 states. [2019-08-04 21:27:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:49,498 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-08-04 21:27:49,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:27:49,499 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2019-08-04 21:27:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:49,500 INFO L225 Difference]: With dead ends: 197 [2019-08-04 21:27:49,500 INFO L226 Difference]: Without dead ends: 197 [2019-08-04 21:27:49,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:27:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-04 21:27:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-04 21:27:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-04 21:27:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-08-04 21:27:49,504 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-08-04 21:27:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:49,504 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-08-04 21:27:49,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:27:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-08-04 21:27:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-04 21:27:49,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:49,506 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2019-08-04 21:27:49,506 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1509761599, now seen corresponding path program 95 times [2019-08-04 21:27:49,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:49,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:27:49,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:53,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:53,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:27:53,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:27:53,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:27:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:27:53,024 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 98 states. [2019-08-04 21:27:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:53,310 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-08-04 21:27:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:27:53,311 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 196 [2019-08-04 21:27:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:53,312 INFO L225 Difference]: With dead ends: 199 [2019-08-04 21:27:53,312 INFO L226 Difference]: Without dead ends: 199 [2019-08-04 21:27:53,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:27:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-04 21:27:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-08-04 21:27:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-04 21:27:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-08-04 21:27:53,316 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-08-04 21:27:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:53,316 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-08-04 21:27:53,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:27:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-08-04 21:27:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-04 21:27:53,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:53,318 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2019-08-04 21:27:53,318 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash -901607621, now seen corresponding path program 96 times [2019-08-04 21:27:53,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:53,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:27:53,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:56,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:56,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:27:56,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:27:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:27:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:27:56,836 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 99 states. [2019-08-04 21:27:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:56,982 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-08-04 21:27:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:27:56,982 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 198 [2019-08-04 21:27:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:56,983 INFO L225 Difference]: With dead ends: 201 [2019-08-04 21:27:56,984 INFO L226 Difference]: Without dead ends: 201 [2019-08-04 21:27:56,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:27:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-04 21:27:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-08-04 21:27:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-04 21:27:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-08-04 21:27:56,987 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-08-04 21:27:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:56,987 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-08-04 21:27:56,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:27:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-08-04 21:27:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-04 21:27:56,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:56,988 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2019-08-04 21:27:56,988 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:56,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1054911799, now seen corresponding path program 97 times [2019-08-04 21:27:56,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:57,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:27:57,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:00,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:00,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:28:00,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:28:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:28:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:28:00,346 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 100 states. [2019-08-04 21:28:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:00,504 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-08-04 21:28:00,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:28:00,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 200 [2019-08-04 21:28:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:00,506 INFO L225 Difference]: With dead ends: 203 [2019-08-04 21:28:00,506 INFO L226 Difference]: Without dead ends: 203 [2019-08-04 21:28:00,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:28:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-04 21:28:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-04 21:28:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-04 21:28:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-08-04 21:28:00,510 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-08-04 21:28:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:00,511 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-08-04 21:28:00,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:28:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-08-04 21:28:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-04 21:28:00,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:00,512 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2019-08-04 21:28:00,512 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash 74398771, now seen corresponding path program 98 times [2019-08-04 21:28:00,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:00,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:28:00,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:04,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-04 21:28:04,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:28:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:28:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:28:04,268 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 101 states. [2019-08-04 21:28:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:04,448 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-08-04 21:28:04,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:28:04,449 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 202 [2019-08-04 21:28:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:04,450 INFO L225 Difference]: With dead ends: 205 [2019-08-04 21:28:04,450 INFO L226 Difference]: Without dead ends: 205 [2019-08-04 21:28:04,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:28:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-04 21:28:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-08-04 21:28:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-04 21:28:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-08-04 21:28:04,453 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-08-04 21:28:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:04,454 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-08-04 21:28:04,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:28:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-08-04 21:28:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-04 21:28:04,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:04,455 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2019-08-04 21:28:04,455 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1600783313, now seen corresponding path program 99 times [2019-08-04 21:28:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:04,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:28:04,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:08,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:08,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-04 21:28:08,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:28:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:28:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:28:08,119 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 102 states. [2019-08-04 21:28:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:08,270 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-08-04 21:28:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:28:08,271 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 204 [2019-08-04 21:28:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:08,272 INFO L225 Difference]: With dead ends: 207 [2019-08-04 21:28:08,272 INFO L226 Difference]: Without dead ends: 207 [2019-08-04 21:28:08,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:28:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-04 21:28:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-08-04 21:28:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-08-04 21:28:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-08-04 21:28:08,275 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-08-04 21:28:08,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:08,275 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-08-04 21:28:08,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:28:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-08-04 21:28:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-08-04 21:28:08,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:08,276 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2019-08-04 21:28:08,277 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash -838030037, now seen corresponding path program 100 times [2019-08-04 21:28:08,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:08,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:28:08,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:12,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:12,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-04 21:28:12,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-04 21:28:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-04 21:28:12,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:28:12,087 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 103 states. [2019-08-04 21:28:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:12,253 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-08-04 21:28:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-04 21:28:12,253 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 206 [2019-08-04 21:28:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:12,255 INFO L225 Difference]: With dead ends: 209 [2019-08-04 21:28:12,255 INFO L226 Difference]: Without dead ends: 209 [2019-08-04 21:28:12,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:28:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-04 21:28:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-08-04 21:28:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-04 21:28:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-08-04 21:28:12,258 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-08-04 21:28:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:12,258 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-08-04 21:28:12,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-04 21:28:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-08-04 21:28:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-04 21:28:12,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:12,259 INFO L399 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2019-08-04 21:28:12,259 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:12,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2023427879, now seen corresponding path program 101 times [2019-08-04 21:28:12,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:12,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:28:12,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:15,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:15,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-04 21:28:15,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-04 21:28:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-04 21:28:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:28:15,955 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 104 states. [2019-08-04 21:28:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:16,110 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2019-08-04 21:28:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-04 21:28:16,111 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 208 [2019-08-04 21:28:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:16,112 INFO L225 Difference]: With dead ends: 211 [2019-08-04 21:28:16,113 INFO L226 Difference]: Without dead ends: 211 [2019-08-04 21:28:16,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-04 21:28:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-08-04 21:28:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-08-04 21:28:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-08-04 21:28:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-08-04 21:28:16,116 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-08-04 21:28:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:16,117 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-08-04 21:28:16,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-04 21:28:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-08-04 21:28:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-08-04 21:28:16,118 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:16,118 INFO L399 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2019-08-04 21:28:16,118 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1189551581, now seen corresponding path program 102 times [2019-08-04 21:28:16,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:16,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:28:16,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:20,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-04 21:28:20,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-04 21:28:20,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-04 21:28:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:28:20,335 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 105 states. [2019-08-04 21:28:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:20,512 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2019-08-04 21:28:20,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-04 21:28:20,513 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 210 [2019-08-04 21:28:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:20,514 INFO L225 Difference]: With dead ends: 213 [2019-08-04 21:28:20,514 INFO L226 Difference]: Without dead ends: 213 [2019-08-04 21:28:20,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:28:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-08-04 21:28:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-08-04 21:28:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-04 21:28:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-08-04 21:28:20,517 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-08-04 21:28:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:20,518 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-08-04 21:28:20,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-04 21:28:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-08-04 21:28:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-04 21:28:20,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:20,519 INFO L399 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2019-08-04 21:28:20,519 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -781326817, now seen corresponding path program 103 times [2019-08-04 21:28:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:20,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-04 21:28:20,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:25,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:25,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-04 21:28:25,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-04 21:28:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-04 21:28:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:28:25,088 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 106 states. [2019-08-04 21:28:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:25,268 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2019-08-04 21:28:25,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-04 21:28:25,268 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 212 [2019-08-04 21:28:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:25,269 INFO L225 Difference]: With dead ends: 215 [2019-08-04 21:28:25,269 INFO L226 Difference]: Without dead ends: 215 [2019-08-04 21:28:25,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-04 21:28:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-04 21:28:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-08-04 21:28:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-08-04 21:28:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-08-04 21:28:25,272 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-08-04 21:28:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:25,273 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-08-04 21:28:25,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-04 21:28:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-08-04 21:28:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-04 21:28:25,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:25,273 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2019-08-04 21:28:25,274 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash 680647451, now seen corresponding path program 104 times [2019-08-04 21:28:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:25,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:28:25,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:29,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:29,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-04 21:28:29,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-04 21:28:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-04 21:28:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:28:29,526 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 107 states. [2019-08-04 21:28:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:29,722 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2019-08-04 21:28:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-04 21:28:29,723 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 214 [2019-08-04 21:28:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:29,724 INFO L225 Difference]: With dead ends: 217 [2019-08-04 21:28:29,724 INFO L226 Difference]: Without dead ends: 217 [2019-08-04 21:28:29,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:28:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-04 21:28:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-08-04 21:28:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-04 21:28:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2019-08-04 21:28:29,728 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2019-08-04 21:28:29,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:29,729 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2019-08-04 21:28:29,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-04 21:28:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2019-08-04 21:28:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-04 21:28:29,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:29,730 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2019-08-04 21:28:29,730 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1183613207, now seen corresponding path program 105 times [2019-08-04 21:28:29,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:29,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:28:29,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:33,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-04 21:28:33,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-04 21:28:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-04 21:28:33,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-04 21:28:33,831 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 108 states. [2019-08-04 21:28:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:34,012 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2019-08-04 21:28:34,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-04 21:28:34,012 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 216 [2019-08-04 21:28:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:34,013 INFO L225 Difference]: With dead ends: 219 [2019-08-04 21:28:34,013 INFO L226 Difference]: Without dead ends: 219 [2019-08-04 21:28:34,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-04 21:28:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-08-04 21:28:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-08-04 21:28:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-04 21:28:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2019-08-04 21:28:34,017 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2019-08-04 21:28:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:34,017 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2019-08-04 21:28:34,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-04 21:28:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2019-08-04 21:28:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-08-04 21:28:34,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:34,019 INFO L399 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2019-08-04 21:28:34,019 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:34,019 INFO L82 PathProgramCache]: Analyzing trace with hash -797599725, now seen corresponding path program 106 times [2019-08-04 21:28:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:28:34,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:38,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:38,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-04 21:28:38,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-04 21:28:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-04 21:28:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:28:38,323 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 109 states. [2019-08-04 21:28:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:38,559 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2019-08-04 21:28:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-04 21:28:38,560 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 218 [2019-08-04 21:28:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:38,561 INFO L225 Difference]: With dead ends: 221 [2019-08-04 21:28:38,561 INFO L226 Difference]: Without dead ends: 221 [2019-08-04 21:28:38,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:28:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-04 21:28:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-08-04 21:28:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-04 21:28:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2019-08-04 21:28:38,564 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2019-08-04 21:28:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:38,565 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2019-08-04 21:28:38,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-04 21:28:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2019-08-04 21:28:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-04 21:28:38,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:38,566 INFO L399 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2019-08-04 21:28:38,566 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2072715249, now seen corresponding path program 107 times [2019-08-04 21:28:38,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:38,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-04 21:28:38,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:43,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:43,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-04 21:28:43,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-04 21:28:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-04 21:28:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:28:43,026 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 110 states. [2019-08-04 21:28:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:43,233 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2019-08-04 21:28:43,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-04 21:28:43,233 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 220 [2019-08-04 21:28:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:43,234 INFO L225 Difference]: With dead ends: 223 [2019-08-04 21:28:43,234 INFO L226 Difference]: Without dead ends: 223 [2019-08-04 21:28:43,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-04 21:28:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-04 21:28:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-08-04 21:28:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-04 21:28:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2019-08-04 21:28:43,236 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2019-08-04 21:28:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:43,236 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2019-08-04 21:28:43,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-04 21:28:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2019-08-04 21:28:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-08-04 21:28:43,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:43,237 INFO L399 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2019-08-04 21:28:43,237 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 901912843, now seen corresponding path program 108 times [2019-08-04 21:28:43,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:43,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:28:43,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:47,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:47,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-04 21:28:47,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-04 21:28:47,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-04 21:28:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:28:47,452 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 111 states. [2019-08-04 21:28:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:47,703 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2019-08-04 21:28:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-04 21:28:47,703 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 222 [2019-08-04 21:28:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:47,704 INFO L225 Difference]: With dead ends: 225 [2019-08-04 21:28:47,704 INFO L226 Difference]: Without dead ends: 225 [2019-08-04 21:28:47,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:28:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-04 21:28:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-08-04 21:28:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-04 21:28:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-08-04 21:28:47,706 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2019-08-04 21:28:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:47,707 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-08-04 21:28:47,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-04 21:28:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-08-04 21:28:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-08-04 21:28:47,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:47,708 INFO L399 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2019-08-04 21:28:47,708 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:47,708 INFO L82 PathProgramCache]: Analyzing trace with hash -928709881, now seen corresponding path program 109 times [2019-08-04 21:28:47,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-04 21:28:47,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:51,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-04 21:28:51,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-04 21:28:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-04 21:28:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-04 21:28:51,988 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 112 states. [2019-08-04 21:28:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:52,196 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2019-08-04 21:28:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-04 21:28:52,196 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 224 [2019-08-04 21:28:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:52,197 INFO L225 Difference]: With dead ends: 227 [2019-08-04 21:28:52,197 INFO L226 Difference]: Without dead ends: 227 [2019-08-04 21:28:52,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-04 21:28:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-04 21:28:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-08-04 21:28:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-04 21:28:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2019-08-04 21:28:52,201 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2019-08-04 21:28:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:52,201 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2019-08-04 21:28:52,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-04 21:28:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2019-08-04 21:28:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-04 21:28:52,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:52,203 INFO L399 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2019-08-04 21:28:52,203 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 779443715, now seen corresponding path program 110 times [2019-08-04 21:28:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:52,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-04 21:28:52,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:28:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-04 21:28:57,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-04 21:28:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-04 21:28:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:28:57,273 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 113 states. [2019-08-04 21:28:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:57,473 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2019-08-04 21:28:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-04 21:28:57,474 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 226 [2019-08-04 21:28:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:57,474 INFO L225 Difference]: With dead ends: 229 [2019-08-04 21:28:57,475 INFO L226 Difference]: Without dead ends: 229 [2019-08-04 21:28:57,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:28:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-04 21:28:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-08-04 21:28:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-04 21:28:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2019-08-04 21:28:57,477 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2019-08-04 21:28:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:57,478 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2019-08-04 21:28:57,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-04 21:28:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2019-08-04 21:28:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-04 21:28:57,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:57,479 INFO L399 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2019-08-04 21:28:57,479 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1637542399, now seen corresponding path program 111 times [2019-08-04 21:28:57,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:57,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:28:57,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:29:02,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:02,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-04 21:29:02,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-04 21:29:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-04 21:29:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-04 21:29:02,129 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 114 states. [2019-08-04 21:29:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:02,341 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2019-08-04 21:29:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-04 21:29:02,341 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 228 [2019-08-04 21:29:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:02,342 INFO L225 Difference]: With dead ends: 231 [2019-08-04 21:29:02,342 INFO L226 Difference]: Without dead ends: 231 [2019-08-04 21:29:02,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-04 21:29:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-04 21:29:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-08-04 21:29:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-08-04 21:29:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2019-08-04 21:29:02,345 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2019-08-04 21:29:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:02,345 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2019-08-04 21:29:02,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-04 21:29:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2019-08-04 21:29:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-08-04 21:29:02,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:02,346 INFO L399 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2019-08-04 21:29:02,346 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1636656891, now seen corresponding path program 112 times [2019-08-04 21:29:02,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:02,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:29:02,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:29:07,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:07,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-04 21:29:07,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-04 21:29:07,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-04 21:29:07,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:29:07,081 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 115 states. [2019-08-04 21:29:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:07,331 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2019-08-04 21:29:07,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-04 21:29:07,332 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 230 [2019-08-04 21:29:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:07,333 INFO L225 Difference]: With dead ends: 233 [2019-08-04 21:29:07,333 INFO L226 Difference]: Without dead ends: 233 [2019-08-04 21:29:07,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:29:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-04 21:29:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-08-04 21:29:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-04 21:29:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2019-08-04 21:29:07,335 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2019-08-04 21:29:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:07,335 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2019-08-04 21:29:07,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-04 21:29:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2019-08-04 21:29:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-04 21:29:07,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:07,336 INFO L399 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2019-08-04 21:29:07,336 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash 785683703, now seen corresponding path program 113 times [2019-08-04 21:29:07,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:07,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-04 21:29:07,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:29:12,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:12,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-04 21:29:12,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-04 21:29:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-04 21:29:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:29:12,157 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 116 states. [2019-08-04 21:29:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:12,425 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2019-08-04 21:29:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-04 21:29:12,425 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 232 [2019-08-04 21:29:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:12,426 INFO L225 Difference]: With dead ends: 235 [2019-08-04 21:29:12,426 INFO L226 Difference]: Without dead ends: 235 [2019-08-04 21:29:12,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-04 21:29:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-04 21:29:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-08-04 21:29:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-04 21:29:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2019-08-04 21:29:12,429 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2019-08-04 21:29:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:12,429 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2019-08-04 21:29:12,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-04 21:29:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2019-08-04 21:29:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-04 21:29:12,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:12,431 INFO L399 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2019-08-04 21:29:12,431 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -955763725, now seen corresponding path program 114 times [2019-08-04 21:29:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:12,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:29:12,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:29:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-04 21:29:17,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-04 21:29:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-04 21:29:17,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:29:17,395 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 117 states. [2019-08-04 21:29:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:17,667 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2019-08-04 21:29:17,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-04 21:29:17,667 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 234 [2019-08-04 21:29:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:17,668 INFO L225 Difference]: With dead ends: 237 [2019-08-04 21:29:17,668 INFO L226 Difference]: Without dead ends: 237 [2019-08-04 21:29:17,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:29:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-04 21:29:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-08-04 21:29:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-04 21:29:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2019-08-04 21:29:17,671 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2019-08-04 21:29:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:17,672 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2019-08-04 21:29:17,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-04 21:29:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2019-08-04 21:29:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-08-04 21:29:17,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:17,673 INFO L399 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2019-08-04 21:29:17,673 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 550503407, now seen corresponding path program 115 times [2019-08-04 21:29:17,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:17,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-04 21:29:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:29:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-04 21:29:22,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-04 21:29:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-04 21:29:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-04 21:29:22,632 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 118 states. [2019-08-04 21:29:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:22,860 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2019-08-04 21:29:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-04 21:29:22,860 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 236 [2019-08-04 21:29:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:22,861 INFO L225 Difference]: With dead ends: 239 [2019-08-04 21:29:22,861 INFO L226 Difference]: Without dead ends: 239 [2019-08-04 21:29:22,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-04 21:29:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-04 21:29:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2019-08-04 21:29:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-08-04 21:29:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2019-08-04 21:29:22,865 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2019-08-04 21:29:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:22,865 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2019-08-04 21:29:22,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-04 21:29:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2019-08-04 21:29:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-04 21:29:22,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:22,866 INFO L399 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1, 1, 1] [2019-08-04 21:29:22,866 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash 669238507, now seen corresponding path program 116 times [2019-08-04 21:29:22,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:22,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-04 21:29:23,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:29:27,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:27,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-04 21:29:27,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-04 21:29:27,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-04 21:29:27,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-04 21:29:27,897 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 119 states. [2019-08-04 21:29:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:28,133 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2019-08-04 21:29:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-04 21:29:28,134 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 238 [2019-08-04 21:29:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:28,135 INFO L225 Difference]: With dead ends: 241 [2019-08-04 21:29:28,135 INFO L226 Difference]: Without dead ends: 241 [2019-08-04 21:29:28,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-04 21:29:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-08-04 21:29:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-08-04 21:29:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-04 21:29:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2019-08-04 21:29:28,139 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 238 [2019-08-04 21:29:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:28,139 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2019-08-04 21:29:28,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-04 21:29:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2019-08-04 21:29:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-08-04 21:29:28,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:28,140 INFO L399 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1, 1, 1] [2019-08-04 21:29:28,140 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1190447385, now seen corresponding path program 117 times [2019-08-04 21:29:28,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:28,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:29:28,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-04 21:29:28,341 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-04 21:29:28,341 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:29:28,345 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:29:28,345 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:29:28 BoogieIcfgContainer [2019-08-04 21:29:28,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:29:28,348 INFO L168 Benchmark]: Toolchain (without parser) took 239900.18 ms. Allocated memory was 137.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 108.0 MB in the beginning and 1.0 GB in the end (delta: -909.0 MB). Peak memory consumption was 139.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:28,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 137.4 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:29:28,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.94 ms. Allocated memory is still 137.4 MB. Free memory was 107.8 MB in the beginning and 106.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:28,349 INFO L168 Benchmark]: Boogie Preprocessor took 19.90 ms. Allocated memory is still 137.4 MB. Free memory was 106.2 MB in the beginning and 105.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:28,350 INFO L168 Benchmark]: RCFGBuilder took 488.93 ms. Allocated memory is still 137.4 MB. Free memory was 105.0 MB in the beginning and 93.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:28,351 INFO L168 Benchmark]: TraceAbstraction took 239353.88 ms. Allocated memory was 137.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 93.4 MB in the beginning and 1.0 GB in the end (delta: -923.6 MB). Peak memory consumption was 124.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:29:28,353 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.16 ms. Allocated memory is still 137.4 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.94 ms. Allocated memory is still 137.4 MB. Free memory was 107.8 MB in the beginning and 106.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.90 ms. Allocated memory is still 137.4 MB. Free memory was 106.2 MB in the beginning and 105.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 488.93 ms. Allocated memory is still 137.4 MB. Free memory was 105.0 MB in the beginning and 93.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239353.88 ms. Allocated memory was 137.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 93.4 MB in the beginning and 1.0 GB in the end (delta: -923.6 MB). Peak memory consumption was 124.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 83). Cancelled while BasicCegarLoop was analyzing trace of length 241 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 239.3s OverallTime, 118 OverallIterations, 118 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 819 SDtfs, 0 SDslu, 10176 SDs, 0 SdLazy, 9202 SolverSat, 358 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14157 GetRequests, 7254 SyntacticMatches, 0 SemanticMatches, 6903 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 213.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 117 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 217.5s InterpolantComputationTime, 14274 NumberOfCodeBlocks, 14274 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 14157 ConstructedInterpolants, 0 QuantifiedInterpolants, 6655545 SizeOfPredicates, 117 NumberOfNonLiveVariables, 71136 ConjunctsInSsa, 7020 ConjunctsInUnsatCore, 117 InterpolantComputations, 1 PerfectInterpolantSequences, 0/533832 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown