java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:17:30,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:17:30,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:17:30,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:17:30,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:17:30,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:17:30,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:17:30,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:17:30,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:17:30,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:17:30,467 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:17:30,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:17:30,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:17:30,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:17:30,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:17:30,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:17:30,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:17:30,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:17:30,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:17:30,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:17:30,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:17:30,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:17:30,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:17:30,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:17:30,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:17:30,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:17:30,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:17:30,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:17:30,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:17:30,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:17:30,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:17:30,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:17:30,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:17:30,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:17:30,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:17:30,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:17:30,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:17:30,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:17:30,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:17:30,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:17:30,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:17:30,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:17:30,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:17:30,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:17:30,537 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:17:30,538 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:17:30,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl [2019-08-05 10:17:30,539 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl' [2019-08-05 10:17:30,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:17:30,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:17:30,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:30,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:17:30,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:17:30,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:30,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:17:30,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:17:30,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:17:30,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... [2019-08-05 10:17:30,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:17:30,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:17:30,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:17:30,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:17:30,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:17:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:17:30,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:17:30,959 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:17:30,960 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:17:30,961 INFO L202 PluginConnector]: Adding new model functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:30 BoogieIcfgContainer [2019-08-05 10:17:30,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:17:30,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:17:30,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:17:30,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:17:30,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:30" (1/2) ... [2019-08-05 10:17:30,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c47f530 and model type functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:17:30, skipping insertion in model container [2019-08-05 10:17:30,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:30" (2/2) ... [2019-08-05 10:17:30,970 INFO L109 eAbstractionObserver]: Analyzing ICFG functions1.i_3.bpl [2019-08-05 10:17:30,981 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:17:30,991 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:17:31,008 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:17:31,039 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:17:31,040 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:17:31,040 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:17:31,040 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:17:31,040 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:17:31,040 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:17:31,041 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:17:31,041 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:17:31,041 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:17:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:17:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:17:31,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:31,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:17:31,083 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:17:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:31,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:17:31,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:31,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:17:31,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:17:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:17:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:31,261 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:17:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:31,298 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:17:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:17:31,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:17:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:31,311 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:17:31,311 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:17:31,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:17:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:17:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:17:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:17:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:17:31,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:17:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:31,345 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:17:31,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:17:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:17:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:17:31,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:31,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:17:31,347 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:17:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:31,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:17:31,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:17:31,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:17:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:17:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:31,489 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:17:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:31,554 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:17:31,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:17:31,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:17:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:31,555 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:17:31,555 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:17:31,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:17:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:17:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:17:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:17:31,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:17:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:31,559 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:17:31,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:17:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:17:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:17:31,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:31,560 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:17:31,560 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:17:31,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:31,585 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:17:31,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:17:31,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:17:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:17:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:17:31,675 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:17:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:31,720 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:17:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:17:31,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:17:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:31,721 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:17:31,722 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:17:31,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:17:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:17:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:17:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:17:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:17:31,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:17:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:31,725 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:17:31,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:17:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:17:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:17:31,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:31,726 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:17:31,727 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:31,727 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:17:31,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:31,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:17:31,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:17:31,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:17:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:17:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:31,850 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:17:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:31,941 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:17:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:17:31,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:17:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:31,942 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:17:31,942 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:17:31,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:17:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:17:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:17:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:17:31,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:17:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:31,946 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:17:31,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:17:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:17:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:17:31,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:31,947 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:17:31,948 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:17:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:31,977 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:17:31,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:32,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:32,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:17:32,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:17:32,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:17:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:32,322 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:17:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:32,517 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:17:32,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:17:32,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:17:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:32,518 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:17:32,518 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:17:32,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:17:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:17:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:17:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:17:32,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:17:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:32,522 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:17:32,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:17:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:17:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:17:32,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:32,523 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:17:32,523 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:32,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:17:32,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:32,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:17:32,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:32,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:32,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:17:32,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:17:32,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:17:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:32,699 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:17:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:32,896 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:17:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:17:32,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:17:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:32,898 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:17:32,898 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:17:32,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:17:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:17:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:17:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:17:32,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:17:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:32,904 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:17:32,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:17:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:17:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:17:32,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:32,905 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:17:32,905 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:32,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:17:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:32,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:17:32,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:33,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:33,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:17:33,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:17:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:17:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:17:33,136 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:17:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:33,232 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:17:33,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:17:33,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:17:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:33,233 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:17:33,233 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:17:33,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:17:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:17:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:17:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:17:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:17:33,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:17:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:33,237 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:17:33,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:17:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:17:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:17:33,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:33,238 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:17:33,238 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:33,238 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:17:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:33,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:17:33,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:33,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:33,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:17:33,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:17:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:17:33,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:33,774 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:17:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:33,854 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:17:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:17:33,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:17:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:33,856 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:17:33,856 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:17:33,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:17:33,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:17:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:17:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:17:33,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:17:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:33,860 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:17:33,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:17:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:17:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:17:33,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:33,861 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:17:33,861 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:17:33,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:33,887 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:17:33,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:34,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:34,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:17:34,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:17:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:17:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:17:34,073 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:17:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:34,173 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:17:34,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:17:34,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:17:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:34,175 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:17:34,175 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:17:34,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:17:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:17:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:17:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:17:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:17:34,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:17:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:34,179 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:17:34,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:17:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:17:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:17:34,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:34,180 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:17:34,180 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:17:34,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:34,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:17:34,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:34,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:34,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:17:34,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:17:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:17:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:17:34,665 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:17:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:34,831 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:17:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:17:34,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:17:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:34,832 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:17:34,832 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:17:34,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:17:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:17:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:17:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:17:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:17:34,836 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:17:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:34,837 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:17:34,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:17:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:17:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:17:34,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:34,837 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:17:34,838 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:17:34,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:34,863 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:17:34,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:35,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:17:35,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:17:35,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:17:35,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:17:35,132 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:17:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,277 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:17:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:17:35,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:17:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,285 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:17:35,285 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:17:35,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:17:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:17:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:17:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:17:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:17:35,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:17:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,289 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:17:35,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:17:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:17:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:17:35,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,290 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:17:35,290 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:17:35,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:17:35,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:17:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:17:35,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:35,486 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:17:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,636 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:17:35,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:17:35,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:17:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,637 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:17:35,637 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:17:35,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:17:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:17:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:17:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:17:35,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:17:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,640 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:17:35,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:17:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:17:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:17:35,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,641 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:17:35,641 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,642 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:17:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,666 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:35,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:17:35,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:17:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:17:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:17:35,892 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:17:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:36,077 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:17:36,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:17:36,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:17:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:36,084 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:17:36,084 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:17:36,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:17:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:17:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:17:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:17:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:17:36,090 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:17:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:36,091 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:17:36,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:17:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:17:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:17:36,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:36,092 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:17:36,092 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:36,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:17:36,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:36,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:17:36,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:36,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:36,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:17:36,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:17:36,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:17:36,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:17:36,304 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:17:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:36,560 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:17:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:17:36,561 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:17:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:36,562 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:17:36,562 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:17:36,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:17:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:17:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:17:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:17:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:17:36,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:17:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:36,566 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:17:36,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:17:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:17:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:17:36,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:36,567 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:17:36,568 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:17:36,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:36,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:17:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:17:37,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:17:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:17:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:17:37,011 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:17:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:37,508 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:17:37,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:17:37,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:17:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:37,509 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:17:37,510 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:17:37,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:17:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:17:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:17:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:17:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:17:37,514 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:17:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:37,515 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:17:37,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:17:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:17:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:17:37,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:37,516 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:17:37,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:17:37,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:37,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:17:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:17:37,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:17:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:17:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:37,826 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:17:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,296 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:17:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:17:38,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:17:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,297 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:17:38,298 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:17:38,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:17:38,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:17:38,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:17:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:17:38,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:17:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,302 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:17:38,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:17:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:17:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:17:38,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,303 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:17:38,303 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:17:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:38,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:17:38,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:38,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:17:38,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:17:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:17:38,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:17:38,723 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:17:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:39,001 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:17:39,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:17:39,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:17:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:39,003 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:17:39,003 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:17:39,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:17:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:17:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:17:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:17:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:17:39,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:17:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:39,007 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:17:39,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:17:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:17:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:17:39,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:39,008 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:17:39,008 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:17:39,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:39,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:17:39,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:39,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:39,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:17:39,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:17:39,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:17:39,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:39,545 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:17:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:39,965 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:17:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:17:39,966 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:17:39,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:39,967 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:17:39,967 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:17:39,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:17:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:17:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:17:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:17:39,971 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:17:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:39,971 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:17:39,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:17:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:17:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:17:39,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:39,972 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:17:39,972 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:39,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:39,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:17:39,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:40,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:17:40,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:17:40,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:17:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:17:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:17:40,845 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:17:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:41,161 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:17:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:17:41,162 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:17:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:41,163 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:17:41,163 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:17:41,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:17:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:17:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:17:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:17:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:17:41,167 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:17:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:41,168 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:17:41,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:17:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:17:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:17:41,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:41,169 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:17:41,169 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:17:41,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:41,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-05 10:17:41,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:41,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:41,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:17:41,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:17:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:17:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:41,638 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:17:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:42,178 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:17:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:17:42,179 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:17:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:42,180 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:17:42,180 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:17:42,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:17:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:17:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:17:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:17:42,185 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:17:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:42,185 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:17:42,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:17:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:17:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:17:42,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:42,186 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:17:42,186 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:42,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:42,187 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:17:42,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:42,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:17:42,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:42,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:42,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:17:42,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:17:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:17:42,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:17:42,538 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:17:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:42,892 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:17:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:17:42,892 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:17:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:42,893 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:17:42,893 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:17:42,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:17:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:17:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:17:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:17:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:17:42,897 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:17:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:42,897 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:17:42,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:17:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:17:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:17:42,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:42,898 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:17:42,899 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:42,899 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:17:42,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:42,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:17:42,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:17:43,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:17:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:17:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:43,254 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:17:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:43,647 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:17:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:17:43,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:17:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:43,650 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:17:43,650 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:17:43,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:17:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:17:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:17:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:17:43,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:17:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:43,653 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:17:43,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:17:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:17:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:17:43,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:43,654 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:17:43,654 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:17:43,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:43,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-05 10:17:43,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:44,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:17:44,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:17:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:17:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:44,015 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:17:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:44,857 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:17:44,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:17:44,858 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:17:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:44,859 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:17:44,859 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:17:44,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:17:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:17:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:17:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:17:44,862 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:17:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:44,862 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:17:44,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:17:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:17:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:17:44,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:44,863 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:17:44,864 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:44,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:17:44,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:44,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 10:17:44,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:45,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:45,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:17:45,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:17:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:17:45,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:45,978 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:17:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:46,701 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:17:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:17:46,704 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:17:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:46,705 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:17:46,705 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:17:46,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:17:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:17:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:17:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:17:46,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:17:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:46,708 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:17:46,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:17:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:17:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:17:46,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:46,709 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:17:46,710 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:46,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:17:46,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:46,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:17:46,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:49,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:49,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:17:49,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:17:49,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:17:49,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:49,038 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:17:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:49,515 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:17:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:17:49,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:17:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:49,516 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:17:49,516 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:17:49,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:17:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:17:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:17:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:17:49,520 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:17:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:49,520 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:17:49,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:17:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:17:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:17:49,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:49,521 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:17:49,521 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:49,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:17:49,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:49,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-05 10:17:49,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:50,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:50,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:17:50,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:17:50,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:17:50,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:50,412 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:17:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:50,947 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:17:50,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:17:50,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:17:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:50,949 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:17:50,949 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:17:50,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:17:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:17:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:17:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:17:50,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:17:50,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:50,953 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:17:50,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:17:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:17:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:17:50,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:50,953 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:17:50,954 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:50,954 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:17:50,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:50,994 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:17:50,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:51,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:51,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:17:51,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:17:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:17:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:51,425 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:17:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:52,015 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:17:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:17:52,015 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:17:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:52,016 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:17:52,016 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:17:52,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:17:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:17:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:17:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:17:52,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:17:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:52,019 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:17:52,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:17:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:17:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:17:52,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:52,020 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:17:52,020 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:17:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:52,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:17:52,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:52,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:52,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:17:52,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:17:52,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:17:52,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:52,683 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:17:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:53,307 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:17:53,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:17:53,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:17:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:53,309 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:17:53,309 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:17:53,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:17:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:17:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:17:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:17:53,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:17:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:53,321 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:17:53,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:17:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:17:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:17:53,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:53,322 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:17:53,323 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:17:53,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:53,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-05 10:17:53,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:54,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:54,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:17:54,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:17:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:17:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:54,169 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:17:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:54,799 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:17:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:17:54,800 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:17:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:54,800 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:17:54,801 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:17:54,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:17:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:17:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:17:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:17:54,804 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:17:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:54,805 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:17:54,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:17:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:17:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:17:54,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:54,806 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:17:54,806 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:54,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:17:54,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:54,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 235 conjunts are in the unsatisfiable core [2019-08-05 10:17:54,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:55,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:55,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:17:55,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:17:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:17:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:55,290 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:17:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:55,970 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:17:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:17:55,971 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:17:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:55,971 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:17:55,971 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:17:55,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:17:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:17:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:17:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:17:55,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:17:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:55,975 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:17:55,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:17:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:17:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:17:55,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:55,976 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:17:55,976 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:17:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:56,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 10:17:56,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:56,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:56,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:17:56,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:17:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:17:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:56,864 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:17:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:57,734 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:17:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:17:57,735 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:17:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:57,736 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:17:57,736 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:17:57,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:17:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:17:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:17:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:17:57,740 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:17:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:57,740 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:17:57,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:17:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:17:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:17:57,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:57,741 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:17:57,742 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:17:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:57,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-05 10:17:57,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:58,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:58,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:17:58,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:17:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:17:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:58,649 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:17:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:59,436 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:17:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:17:59,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:17:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:59,437 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:17:59,437 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:17:59,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:17:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:17:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:17:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:17:59,441 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:17:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:59,441 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:17:59,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:17:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:17:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:17:59,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:59,442 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:17:59,442 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:17:59,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 259 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:18:00,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:18:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:18:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:00,766 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:18:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:01,596 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:18:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:18:01,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:18:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:01,597 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:18:01,597 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:18:01,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:18:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:18:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:18:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:18:01,601 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:18:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:01,601 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:18:01,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:18:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:18:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:18:01,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:01,602 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:18:01,602 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:18:01,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:01,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 10:18:01,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:02,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:02,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:18:02,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:18:02,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:18:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:02,318 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:18:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,369 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:18:03,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:18:03,370 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:18:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,371 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:18:03,371 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:18:03,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:18:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:18:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:18:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:18:03,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:18:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,374 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:18:03,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:18:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:18:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:18:03,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,375 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:18:03,375 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:18:03,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 275 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:04,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:04,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:18:04,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:18:04,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:18:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:04,083 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:18:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:04,991 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:18:04,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:18:04,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:18:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:04,993 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:18:04,993 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:18:04,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:18:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:18:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:18:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:18:04,996 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:18:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:04,997 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:18:04,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:18:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:18:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:18:04,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:04,997 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:18:04,998 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:04,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:18:04,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:05,074 WARN L254 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 283 conjunts are in the unsatisfiable core [2019-08-05 10:18:05,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:06,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:06,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:18:06,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:18:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:18:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:06,742 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:18:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:07,845 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:18:07,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:18:07,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:18:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:07,846 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:18:07,846 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:18:07,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:18:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:18:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:18:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:18:07,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:18:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:07,850 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:18:07,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:18:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:18:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:18:07,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:07,851 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:18:07,852 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:18:07,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:07,919 WARN L254 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 10:18:07,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:09,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:09,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:18:09,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:18:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:18:09,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:09,051 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:18:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,063 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:18:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:18:10,063 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:18:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,064 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:18:10,064 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:18:10,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:18:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:18:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:18:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:18:10,067 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:18:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,068 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:18:10,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:18:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:18:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:18:10,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,068 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:18:10,069 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:18:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:10,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 299 conjunts are in the unsatisfiable core [2019-08-05 10:18:10,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:11,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:11,178 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:18:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:12,246 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:18:12,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:18:12,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:18:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:12,247 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:18:12,247 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:18:12,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:18:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:18:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:18:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:18:12,250 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:18:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:12,250 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:18:12,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:18:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:18:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:18:12,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:12,251 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:18:12,251 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:18:12,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:12,328 WARN L254 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 307 conjunts are in the unsatisfiable core [2019-08-05 10:18:12,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:13,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:13,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:18:13,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:18:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:18:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:13,261 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:18:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,406 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:18:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:18:14,407 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:18:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,408 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:18:14,408 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:18:14,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:18:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:18:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:18:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:18:14,412 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:18:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,412 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:18:14,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:18:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:18:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:18:14,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,413 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:18:14,414 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:18:14,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:14,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 315 conjunts are in the unsatisfiable core [2019-08-05 10:18:14,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:15,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:15,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:18:15,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:18:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:18:15,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:15,254 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:18:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:16,460 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:18:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:18:16,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:18:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:16,461 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:18:16,462 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:18:16,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:18:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:18:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:18:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:18:16,465 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:18:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:16,465 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:18:16,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:18:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:18:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:18:16,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:16,466 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:18:16,466 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:16,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:18:16,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:16,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 323 conjunts are in the unsatisfiable core [2019-08-05 10:18:16,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:17,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:18:17,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:18:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:18:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:18:17,251 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:18:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:18,654 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:18:18,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:18:18,654 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:18:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:18,655 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:18:18,655 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:18:18,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:18:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:18:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:18:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:18:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:18:18,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:18:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:18,658 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:18:18,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:18:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:18:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:18:18,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:18,659 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:18:18,659 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:18,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:18:18,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:18,760 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 331 conjunts are in the unsatisfiable core [2019-08-05 10:18:18,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:19,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:19,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:18:19,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:18:19,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:18:19,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:18:19,795 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:18:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:21,096 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:18:21,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:18:21,102 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:18:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:21,103 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:18:21,103 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:18:21,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:18:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:18:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:18:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:18:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:18:21,105 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:18:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:21,105 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:18:21,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:18:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:18:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:18:21,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:21,105 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:18:21,106 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:21,106 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:18:21,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 339 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:22,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:22,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:18:22,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:18:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:18:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:18:22,266 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:18:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:23,962 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:18:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:18:23,962 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:18:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:23,963 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:18:23,963 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:18:23,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:18:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:18:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:18:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:18:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:18:23,967 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:18:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:23,968 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:18:23,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:18:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:18:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:18:23,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:23,968 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:18:23,968 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:18:23,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:24,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 347 conjunts are in the unsatisfiable core [2019-08-05 10:18:24,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:24,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:18:24,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:18:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:18:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:18:24,886 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:18:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:26,302 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:18:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:18:26,302 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:18:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:26,303 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:18:26,303 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:18:26,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:18:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:18:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:18:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:18:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:18:26,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:18:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:26,306 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:18:26,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:18:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:18:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:18:26,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:26,307 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:18:26,307 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:18:26,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:26,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 355 conjunts are in the unsatisfiable core [2019-08-05 10:18:26,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:27,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:18:27,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:18:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:18:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:18:27,221 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:18:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,803 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:18:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:18:28,804 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:18:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,804 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:18:28,805 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:18:28,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:18:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:18:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:18:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:18:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:18:28,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:18:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,808 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:18:28,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:18:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:18:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:18:28,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,809 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:18:28,809 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:18:28,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,900 WARN L254 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 363 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:29,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:18:29,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:18:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:18:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:18:29,844 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:18:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:31,436 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:18:31,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:18:31,443 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:18:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:31,444 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:18:31,444 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:18:31,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:18:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:18:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:18:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:18:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:18:31,446 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:18:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:31,446 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:18:31,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:18:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:18:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:18:31,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:31,447 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:18:31,447 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:18:31,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:31,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 371 conjunts are in the unsatisfiable core [2019-08-05 10:18:31,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:32,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:32,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:18:32,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:18:32,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:18:32,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:18:32,596 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:18:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:34,421 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:18:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:18:34,422 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:18:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:34,423 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:18:34,423 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:18:34,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:18:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:18:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:18:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:18:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:18:34,425 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:18:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:34,426 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:18:34,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:18:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:18:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:18:34,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:34,427 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:18:34,427 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:18:34,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:34,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 379 conjunts are in the unsatisfiable core [2019-08-05 10:18:34,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:35,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:18:35,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:18:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:18:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:35,435 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:18:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,115 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:18:37,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:18:37,115 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:18:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,116 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:18:37,116 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:18:37,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:18:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:18:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:18:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:18:37,120 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:18:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,120 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:18:37,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:18:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:18:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:18:37,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,121 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:18:37,122 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:18:37,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:37,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 387 conjunts are in the unsatisfiable core [2019-08-05 10:18:37,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:38,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:38,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:18:38,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:18:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:18:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:18:38,392 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:18:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:40,160 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:18:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:18:40,161 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:18:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:40,162 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:18:40,162 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:18:40,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:18:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:18:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:18:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:18:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:18:40,166 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:18:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:40,166 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:18:40,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:18:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:18:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:18:40,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:40,167 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:18:40,167 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:18:40,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:40,262 WARN L254 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 395 conjunts are in the unsatisfiable core [2019-08-05 10:18:40,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:41,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:41,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:18:41,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:18:41,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:18:41,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:41,230 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:18:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:43,084 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:18:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:18:43,085 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:18:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:43,085 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:18:43,086 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:18:43,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:18:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:18:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:18:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:18:43,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:18:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:43,088 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:18:43,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:18:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:18:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:18:43,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:43,089 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:18:43,089 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:18:43,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:43,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 403 conjunts are in the unsatisfiable core [2019-08-05 10:18:43,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:44,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:44,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:18:44,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:18:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:18:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:44,378 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:18:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:46,279 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:18:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:18:46,280 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:18:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:46,281 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:18:46,281 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:18:46,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:18:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:18:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:18:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:18:46,284 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:18:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:46,284 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:18:46,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:18:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:18:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:18:46,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:46,285 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:18:46,285 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:18:46,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:46,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 411 conjunts are in the unsatisfiable core [2019-08-05 10:18:46,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:47,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:47,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:18:47,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:18:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:18:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:47,460 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:18:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:49,592 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:18:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:18:49,593 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:18:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:49,593 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:18:49,593 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:18:49,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:18:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:18:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:18:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:18:49,596 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:18:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:49,597 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:18:49,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:18:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:18:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:18:49,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:49,598 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:18:49,598 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:18:49,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:49,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 419 conjunts are in the unsatisfiable core [2019-08-05 10:18:49,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:50,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:50,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:18:50,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:18:50,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:18:50,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:18:50,823 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:18:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:52,875 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:18:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:18:52,876 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:18:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:52,876 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:18:52,877 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:18:52,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:18:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:18:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:18:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:18:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:18:52,880 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:18:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:52,881 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:18:52,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:18:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:18:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:18:52,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:52,881 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:18:52,882 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:18:52,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:53,007 WARN L254 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 427 conjunts are in the unsatisfiable core [2019-08-05 10:18:53,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:54,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:54,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:18:54,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:18:54,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:18:54,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:54,350 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:18:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:56,477 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:18:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:18:56,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:18:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:56,479 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:18:56,479 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:18:56,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:18:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:18:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:18:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:18:56,482 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:18:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:56,482 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:18:56,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:18:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:18:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:18:56,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:56,483 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:18:56,483 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:18:56,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:56,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 435 conjunts are in the unsatisfiable core [2019-08-05 10:18:56,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:57,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:57,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:18:57,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:18:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:18:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:18:57,924 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:19:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:00,372 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:19:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:19:00,372 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:19:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:00,373 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:19:00,373 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:19:00,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:19:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:19:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:19:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:19:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:19:00,376 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:19:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:00,376 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:19:00,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:19:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:19:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:19:00,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:00,377 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:19:00,377 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:19:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:00,511 WARN L254 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 443 conjunts are in the unsatisfiable core [2019-08-05 10:19:00,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:01,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:01,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:19:01,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:19:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:19:01,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:01,736 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:19:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:04,302 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:19:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:19:04,303 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:19:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:04,304 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:19:04,304 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:19:04,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:19:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:19:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:19:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:19:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:19:04,307 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:19:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:04,308 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:19:04,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:19:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:19:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:19:04,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:04,309 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:19:04,309 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:19:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:04,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 451 conjunts are in the unsatisfiable core [2019-08-05 10:19:04,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:05,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:19:05,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:19:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:19:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:19:05,790 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:19:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,341 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:19:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:19:08,341 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:19:08,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,342 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:19:08,342 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:19:08,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:19:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:19:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:19:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:19:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:19:08,345 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:19:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,346 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:19:08,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:19:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:19:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:19:08,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,347 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:19:08,347 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:19:08,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,497 WARN L254 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 459 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:10,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:19:10,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:19:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:19:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:19:10,150 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:19:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:12,738 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:19:12,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:19:12,738 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:19:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:12,739 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:19:12,739 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:19:12,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:19:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:19:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:19:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:19:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:19:12,743 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:19:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:12,743 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:19:12,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:19:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:19:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:19:12,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:12,744 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:19:12,744 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:12,745 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:19:12,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 467 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:14,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:14,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:19:14,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:19:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:19:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:19:14,683 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:19:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:17,360 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:19:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:19:17,361 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:19:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:17,362 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:19:17,362 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:19:17,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:19:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:19:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:19:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:19:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:19:17,364 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:19:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:17,365 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:19:17,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:19:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:19:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:19:17,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:17,366 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:19:17,367 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:19:17,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:17,513 WARN L254 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 475 conjunts are in the unsatisfiable core [2019-08-05 10:19:17,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:19,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:19,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:19:19,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:19:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:19:19,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:19:19,002 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:19:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:21,942 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:19:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:19:21,943 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:19:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:21,944 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:19:21,944 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:19:21,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:19:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:19:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:19:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:19:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:19:21,946 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:19:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:21,947 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:19:21,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:19:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:19:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:19:21,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:21,947 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:19:21,947 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:19:21,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:22,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 483 conjunts are in the unsatisfiable core [2019-08-05 10:19:22,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:19:23,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:19:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:19:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:19:23,606 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:19:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:26,576 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:19:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:19:26,576 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:19:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:26,577 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:19:26,577 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:19:26,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:19:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:19:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:19:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:19:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:19:26,580 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:19:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:26,580 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:19:26,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:19:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:19:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:19:26,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:26,581 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:19:26,581 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:19:26,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:26,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 491 conjunts are in the unsatisfiable core [2019-08-05 10:19:26,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:28,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:28,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:19:28,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:19:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:19:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:19:28,394 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:19:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:31,443 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:19:31,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:19:31,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:19:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:31,445 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:19:31,445 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:19:31,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:19:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:19:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:19:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:19:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:19:31,448 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:19:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:31,448 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:19:31,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:19:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:19:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:19:31,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:31,449 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:19:31,449 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:19:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:31,603 WARN L254 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 499 conjunts are in the unsatisfiable core [2019-08-05 10:19:31,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:33,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:33,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:19:33,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:19:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:19:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:19:33,123 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:19:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:36,269 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:19:36,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:19:36,270 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:19:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:36,271 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:19:36,271 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:19:36,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:19:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:19:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:19:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:19:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:19:36,274 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:19:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:36,275 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:19:36,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:19:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:19:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:19:36,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:36,275 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:19:36,276 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:19:36,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:36,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 507 conjunts are in the unsatisfiable core [2019-08-05 10:19:36,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:38,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:38,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:19:38,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:19:38,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:19:38,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:38,042 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:19:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:41,387 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:19:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:19:41,388 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:19:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:41,389 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:19:41,389 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:19:41,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:19:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:19:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:19:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:19:41,392 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:19:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:41,392 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:19:41,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:19:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:19:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:19:41,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:41,393 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:19:41,394 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:19:41,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:41,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 515 conjunts are in the unsatisfiable core [2019-08-05 10:19:41,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:43,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:43,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:19:43,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:19:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:19:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:43,328 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:19:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:46,702 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:19:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:19:46,702 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:19:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:46,703 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:19:46,703 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:19:46,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:19:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:19:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:19:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:19:46,706 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:19:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:46,706 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:19:46,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:19:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:19:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:19:46,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:46,707 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:19:46,707 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:46,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:19:46,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:46,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 523 conjunts are in the unsatisfiable core [2019-08-05 10:19:46,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:48,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:48,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:19:48,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:19:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:19:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:48,625 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:19:52,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:52,089 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:19:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:19:52,090 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:19:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:52,091 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:19:52,091 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:19:52,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:19:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:19:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:19:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:19:52,093 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:19:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:52,094 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:19:52,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:19:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:19:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:19:52,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:52,094 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:19:52,095 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:19:52,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:52,313 WARN L254 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 531 conjunts are in the unsatisfiable core [2019-08-05 10:19:52,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:55,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:55,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:19:55,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:19:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:19:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:55,983 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:19:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:59,370 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:19:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:19:59,370 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:19:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:59,371 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:19:59,371 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:19:59,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:19:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:19:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:19:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:19:59,374 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:19:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:59,374 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:19:59,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:19:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:19:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:19:59,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:59,375 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:19:59,375 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:19:59,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:59,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 539 conjunts are in the unsatisfiable core [2019-08-05 10:19:59,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:01,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:01,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:20:01,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:20:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:20:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:20:01,705 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:20:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:05,135 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:20:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:20:05,135 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:20:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:05,136 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:20:05,136 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:20:05,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:20:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:20:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:20:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:20:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:20:05,139 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:20:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:05,139 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:20:05,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:20:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:20:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:20:05,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:05,140 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:20:05,140 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:20:05,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:05,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 547 conjunts are in the unsatisfiable core [2019-08-05 10:20:05,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:07,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:07,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:20:07,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:20:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:20:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:20:07,204 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:20:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,762 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:20:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:20:10,763 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:20:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,764 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:20:10,764 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:20:10,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:20:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:20:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:20:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:20:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:20:10,766 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:20:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,767 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:20:10,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:20:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:20:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:20:10,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,768 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:20:10,769 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:20:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:11,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 555 conjunts are in the unsatisfiable core [2019-08-05 10:20:11,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:12,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:20:12,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:20:12,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:20:12,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:20:12,908 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:20:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,619 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:20:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:20:16,620 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:20:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,621 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:20:16,621 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:20:16,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:20:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:20:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:20:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:20:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:20:16,624 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:20:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,625 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:20:16,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:20:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:20:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:20:16,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,626 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:20:16,626 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:20:16,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:16,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 563 conjunts are in the unsatisfiable core [2019-08-05 10:20:17,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:18,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:18,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:20:18,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:20:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:20:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:20:18,904 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:20:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:22,819 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:20:22,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:20:22,820 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:20:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:22,821 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:20:22,821 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:20:22,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:20:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:20:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:20:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:20:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:20:22,824 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:20:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:22,825 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:20:22,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:20:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:20:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:20:22,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:22,825 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:20:22,826 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:22,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:22,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:20:22,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:23,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 571 conjunts are in the unsatisfiable core [2019-08-05 10:20:23,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:25,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:20:25,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:20:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:20:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:20:25,239 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:20:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:29,219 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:20:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:20:29,219 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:20:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:29,220 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:20:29,220 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:20:29,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:20:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:20:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:20:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:20:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:20:29,223 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:20:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:29,224 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:20:29,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:20:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:20:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:20:29,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:29,225 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:20:29,225 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:29,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:29,225 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:20:29,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:29,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 579 conjunts are in the unsatisfiable core [2019-08-05 10:20:29,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:31,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:31,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:20:31,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:20:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:20:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:20:31,811 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:20:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:35,756 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:20:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:20:35,757 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:20:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:35,757 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:20:35,758 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:20:35,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:20:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:20:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:20:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:20:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:20:35,761 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:20:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:35,761 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:20:35,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:20:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:20:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:20:35,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:35,762 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:20:35,762 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:35,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:35,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:20:35,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:36,056 WARN L254 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 587 conjunts are in the unsatisfiable core [2019-08-05 10:20:36,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:38,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:38,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:20:38,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:20:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:20:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:20:38,219 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:20:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:42,383 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:20:42,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:20:42,384 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:20:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:42,384 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:20:42,385 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:20:42,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:20:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:20:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:20:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:20:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:20:42,387 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:20:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:42,387 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:20:42,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:20:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:20:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:20:42,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:42,394 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:20:42,394 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:20:42,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:42,713 WARN L254 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 595 conjunts are in the unsatisfiable core [2019-08-05 10:20:42,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:44,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:44,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:20:44,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:20:44,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:20:44,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:44,872 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:20:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:49,188 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:20:49,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:20:49,188 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:20:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:49,189 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:20:49,189 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:20:49,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:20:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:20:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:20:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:20:49,192 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:20:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:49,192 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:20:49,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:20:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:20:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:20:49,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:49,193 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:20:49,193 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:20:49,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:49,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 603 conjunts are in the unsatisfiable core [2019-08-05 10:20:49,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:51,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:51,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:20:51,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:20:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:20:51,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:20:51,873 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:20:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:56,073 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:20:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:20:56,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:20:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:56,075 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:20:56,075 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:20:56,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:20:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:20:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:20:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:20:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:20:56,078 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:20:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:56,078 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:20:56,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:20:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:20:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:20:56,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:56,079 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:20:56,079 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:20:56,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:56,521 WARN L254 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 611 conjunts are in the unsatisfiable core [2019-08-05 10:20:56,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:58,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:20:58,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:20:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:20:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:20:58,751 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:21:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:03,146 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:21:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:21:03,146 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:21:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:03,147 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:21:03,147 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:21:03,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:21:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:21:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:21:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:21:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:21:03,150 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:21:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:03,151 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:21:03,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:21:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:21:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:21:03,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:03,152 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:21:03,152 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:21:03,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:03,425 WARN L254 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 619 conjunts are in the unsatisfiable core [2019-08-05 10:21:03,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:21:05,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:21:05,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:21:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:21:05,785 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:21:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:10,531 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:21:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:21:10,532 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:21:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:10,533 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:21:10,533 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:21:10,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:21:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:21:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:21:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:21:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:21:10,536 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:21:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:10,536 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:21:10,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:21:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:21:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:21:10,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,537 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:21:10,537 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:21:10,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 627 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:13,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:13,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:21:13,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:21:13,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:21:13,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:21:13,539 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:21:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:18,166 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:21:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:21:18,166 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:21:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:18,167 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:21:18,167 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:21:18,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:21:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:21:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:21:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:21:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:21:18,170 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:21:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:18,171 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:21:18,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:21:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:21:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:21:18,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:18,171 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:21:18,172 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:21:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:18,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 635 conjunts are in the unsatisfiable core [2019-08-05 10:21:18,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:20,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:20,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:21:20,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:21:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:21:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:21:20,993 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:21:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:25,743 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:21:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:21:25,744 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:21:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:25,745 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:21:25,745 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:21:25,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:21:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:21:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:21:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:21:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:21:25,747 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:21:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:25,748 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:21:25,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:21:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:21:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:21:25,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:25,748 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:21:25,749 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:21:25,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:26,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 643 conjunts are in the unsatisfiable core [2019-08-05 10:21:26,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:28,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:28,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:21:28,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:21:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:21:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:21:28,919 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:21:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,871 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:21:33,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:21:33,872 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:21:33,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,873 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:21:33,873 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:21:33,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:21:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:21:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:21:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:21:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:21:33,875 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:21:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,876 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:21:33,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:21:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:21:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:21:33,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,876 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:21:33,877 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:21:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:34,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 651 conjunts are in the unsatisfiable core [2019-08-05 10:21:34,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:36,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:21:36,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:21:36,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:21:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:21:36,686 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. Received shutdown request... [2019-08-05 10:21:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:37,081 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:21:37,088 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:21:37,088 INFO L202 PluginConnector]: Adding new model functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:37 BoogieIcfgContainer [2019-08-05 10:21:37,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:37,090 INFO L168 Benchmark]: Toolchain (without parser) took 246502.91 ms. Allocated memory was 133.2 MB in the beginning and 519.6 MB in the end (delta: 386.4 MB). Free memory was 110.7 MB in the beginning and 340.3 MB in the end (delta: -229.6 MB). Peak memory consumption was 156.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:37,091 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.2 MB. Free memory is still 111.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:21:37,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.79 ms. Allocated memory is still 133.2 MB. Free memory was 110.3 MB in the beginning and 109.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:37,092 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 ms. Allocated memory is still 133.2 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:37,093 INFO L168 Benchmark]: RCFGBuilder took 313.03 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 97.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:37,093 INFO L168 Benchmark]: TraceAbstraction took 246125.35 ms. Allocated memory was 133.2 MB in the beginning and 519.6 MB in the end (delta: 386.4 MB). Free memory was 97.9 MB in the beginning and 340.3 MB in the end (delta: -242.4 MB). Peak memory consumption was 144.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:37,096 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.19 ms. Allocated memory is still 133.2 MB. Free memory is still 111.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.79 ms. Allocated memory is still 133.2 MB. Free memory was 110.3 MB in the beginning and 109.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.03 ms. Allocated memory is still 133.2 MB. Free memory was 109.0 MB in the beginning and 107.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 313.03 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 97.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246125.35 ms. Allocated memory was 133.2 MB in the beginning and 519.6 MB in the end (delta: 386.4 MB). Free memory was 97.9 MB in the beginning and 340.3 MB in the end (delta: -242.4 MB). Peak memory consumption was 144.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (85states) and FLOYD_HOARE automaton (currently 9 states, 84 states before enhancement),while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 246.0s OverallTime, 82 OverallIterations, 81 TraceHistogramMax, 142.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 0 SDslu, 3321 SDs, 0 SdLazy, 187656 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 116.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3485 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 91.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 81 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 96.2s InterpolantComputationTime, 3567 NumberOfCodeBlocks, 3567 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 3485 ConstructedInterpolants, 0 QuantifiedInterpolants, 575189 SizeOfPredicates, 10045 NumberOfNonLiveVariables, 30873 ConjunctsInSsa, 26814 ConjunctsInUnsatCore, 82 InterpolantComputations, 1 PerfectInterpolantSequences, 0/91881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown