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/20181015-LoopsPathprograms/simple_false-unreach-call4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:26:13,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:26:13,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:26:13,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:26:13,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:26:13,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:26:13,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:26:13,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:26:13,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:26:13,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:26:13,694 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:26:13,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:26:13,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:26:13,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:26:13,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:26:13,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:26:13,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:26:13,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:26:13,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:26:13,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:26:13,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:26:13,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:26:13,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:26:13,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:26:13,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:26:13,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:26:13,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:26:13,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:26:13,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:26:13,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:26:13,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:26:13,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:26:13,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:26:13,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:26:13,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:26:13,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:26:13,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:26:13,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:26:13,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:26:13,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:26:13,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:26:13,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:26:13,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:26:13,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:26:13,778 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:26:13,779 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:26:13,780 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call4.i_3.bpl [2019-08-05 10:26:13,780 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call4.i_3.bpl' [2019-08-05 10:26:13,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:26:13,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:26:13,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:13,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:26:13,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:26:13,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:13,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:26:13,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:26:13,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:26:13,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/1) ... [2019-08-05 10:26:13,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:26:13,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:26:13,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:26:13,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:26:13,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (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:26:13,930 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:26:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:26:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:26:14,190 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:26:14,190 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:26:14,191 INFO L202 PluginConnector]: Adding new model simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:14 BoogieIcfgContainer [2019-08-05 10:26:14,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:26:14,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:26:14,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:26:14,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:26:14,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:13" (1/2) ... [2019-08-05 10:26:14,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58645d1d and model type simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:26:14, skipping insertion in model container [2019-08-05 10:26:14,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:14" (2/2) ... [2019-08-05 10:26:14,201 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call4.i_3.bpl [2019-08-05 10:26:14,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:26:14,220 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:26:14,237 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:26:14,267 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:26:14,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:26:14,268 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:26:14,268 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:26:14,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:26:14,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:26:14,268 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:26:14,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:26:14,269 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:26:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:26:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:26:14,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:14,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:26:14,303 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:26:14,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:14,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:26:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:14,468 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:26:14,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:14,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:26:14,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:14,493 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:26:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:14,519 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:26:14,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:14,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:26:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:14,540 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:26:14,540 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:26:14,546 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:26:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:26:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:26:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:26:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:26:14,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:26:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:14,587 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:26:14,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:26:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:26:14,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:14,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:26:14,589 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:26:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:14,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:26:14,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:14,766 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:26:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:26:14,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:14,770 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:26:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:14,828 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:26:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:14,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:26:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:14,829 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:26:14,829 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:26:14,831 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:26:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:26:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:26:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:26:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:26:14,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:26:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:14,834 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:26:14,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:26:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:26:14,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:14,835 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:26:14,835 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:26:14,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:14,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:26:14,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:14,929 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:26:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:14,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:14,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:14,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:14,932 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:26:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:14,995 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:26:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:14,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:26:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:14,996 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:14,997 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:14,997 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:26:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:26:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:26:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:26:15,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:26:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:15,000 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:26:15,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:26:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:26:15,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:15,001 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:26:15,001 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:26:15,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:15,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:26:15,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:15,114 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:26:15,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:15,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:15,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:15,116 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:26:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:15,231 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:26:15,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:15,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:26:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:15,232 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:26:15,232 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:26:15,233 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:26:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:26:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:26:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:26:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:26:15,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:26:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:15,235 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:26:15,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:26:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:26:15,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:15,236 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:26:15,236 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:26:15,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:15,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:26:15,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:15,374 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:26:15,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:15,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:15,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:15,376 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:26:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:15,590 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:26:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:15,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:26:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:15,593 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:26:15,593 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:26:15,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:26:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:26:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:26:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:26:15,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:26:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:15,596 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:26:15,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:26:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:26:15,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:15,597 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:26:15,597 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:26:15,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:15,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:26:15,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:15,808 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:26:15,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:15,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:15,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:15,810 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:26:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:15,990 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:26:15,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:15,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:26:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:15,991 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:26:15,991 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:26:15,992 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:26:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:26:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:26:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:26:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:26:15,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:26:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:26:15,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:26:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:26:15,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:15,997 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:26:15,997 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:15,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:15,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:26:15,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:16,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:26:16,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:16,163 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:26:16,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:16,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:16,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:16,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:16,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:16,165 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:26:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:16,248 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:26:16,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:16,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:26:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:16,250 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:16,250 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:26:16,250 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:26:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:26:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:26:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:26:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:26:16,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:26:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:16,253 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:26:16,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:26:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:26:16,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:16,254 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:26:16,254 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:16,254 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:26:16,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:16,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:26:16,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:16,633 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:26:16,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:16,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:16,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:16,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:16,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:16,635 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:26:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:16,724 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:26:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:16,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:26:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:16,729 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:26:16,729 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:26:16,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:26:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:26:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:26:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:26:16,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:26:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:16,732 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:26:16,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:26:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:26:16,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:16,733 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:26:16,734 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:26:16,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:16,774 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:26:16,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:17,093 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:26:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:17,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:17,095 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:26:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:17,202 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:26:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:17,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:26:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:17,203 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:26:17,203 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:26:17,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:26:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:26:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:26:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:26:17,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:26:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:17,207 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:26:17,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:26:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:26:17,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:17,209 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:26:17,209 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:26:17,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:17,232 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:26:17,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:17,410 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:26:17,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:17,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:17,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:17,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:17,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:17,411 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:26:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:17,584 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:26:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:17,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:26:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:17,585 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:26:17,585 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:26:17,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:26:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:26:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:26:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:26:17,588 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:26:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:17,589 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:26:17,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:26:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:26:17,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:17,590 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:26:17,590 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:26:17,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:17,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:26:17,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:17,890 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:26:17,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:17,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:26:17,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:26:17,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:26:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:26:17,892 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:26:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:18,059 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:26:18,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:26:18,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:26:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:18,060 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:26:18,060 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:26:18,061 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:26:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:26:18,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:26:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:26:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:26:18,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:26:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:18,065 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:26:18,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:26:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:26:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:26:18,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:18,066 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:26:18,066 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:18,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:18,066 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:26:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:18,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:26:18,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:18,253 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:26:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:18,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:26:18,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:26:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:26:18,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:26:18,254 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:26:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:18,424 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:26:18,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:26:18,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:26:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:18,425 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:26:18,425 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:26:18,425 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:26:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:26:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:26:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:26:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:26:18,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:26:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:18,428 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:26:18,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:26:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:26:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:26:18,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:18,429 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:26:18,429 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:26:18,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:18,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:26:18,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:18,703 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:26:18,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:18,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:26:18,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:26:18,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:26:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:26:18,705 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:26:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:18,919 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:26:18,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:26:18,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:26:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:18,926 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:26:18,926 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:26:18,927 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:26:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:26:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:26:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:26:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:26:18,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:26:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:18,930 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:26:18,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:26:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:26:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:26:18,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:18,931 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:26:18,932 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:26:18,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:18,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:26:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:19,242 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:26:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:19,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:26:19,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:26:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:26:19,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:19,244 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:26:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:19,515 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:26:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:26:19,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:26:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:19,516 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:26:19,516 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:26:19,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:26:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:26:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:26:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:26:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:26:19,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:26:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:19,520 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:26:19,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:26:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:26:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:26:19,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:19,521 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:26:19,521 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:26:19,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:19,539 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:26:19,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:19,691 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:26:19,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:26:19,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:26:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:26:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:19,693 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:26:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:19,918 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:26:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:26:19,919 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:26:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:19,919 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:26:19,920 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:26:19,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:26:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:26:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:26:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:26:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:26:19,923 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:26:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:19,924 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:26:19,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:26:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:26:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:26:19,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:19,925 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:26:19,925 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:26:19,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:19,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:26:19,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:20,461 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:26:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:26:20,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:26:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:26:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:20,463 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:26:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:20,726 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:26:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:26:20,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:26:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:20,727 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:26:20,727 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:26:20,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:26:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:26:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:26:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:26:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:26:20,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:26:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:20,731 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:26:20,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:26:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:26:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:26:20,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:20,732 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:26:20,733 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:26:20,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:20,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:26:20,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:21,085 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:26:21,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:21,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:26:21,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:26:21,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:26:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:26:21,087 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:26:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:21,358 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:26:21,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:26:21,359 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:26:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:21,359 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:26:21,359 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:26:21,360 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:26:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:26:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:26:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:26:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:26:21,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:26:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:21,362 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:26:21,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:26:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:26:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:26:21,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:21,363 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:26:21,364 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:26:21,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:21,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:26:21,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:21,591 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:26:21,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:21,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:26:21,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:26:21,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:26:21,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:21,593 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:26:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:21,951 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:26:21,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:26:21,952 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:26:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:21,953 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:26:21,953 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:26:21,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:26:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:26:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:26:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:26:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:26:21,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:26:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:21,957 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:26:21,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:26:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:26:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:26:21,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:21,958 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:26:21,958 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:26:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:21,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:26:21,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:22,200 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:26:22,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:22,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:26:22,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:26:22,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:26:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:22,202 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:26:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:22,550 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:26:22,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:26:22,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:26:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:22,551 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:26:22,552 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:26:22,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:26:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:26:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:26:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:26:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:26:22,555 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:26:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:22,555 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:26:22,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:26:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:26:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:26:22,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:22,556 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:26:22,557 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:26:22,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:22,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:26:22,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:22,850 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:26:22,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:22,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:26:22,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:26:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:26:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:22,852 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:26:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:23,202 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:26:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:26:23,203 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:26:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:23,204 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:26:23,204 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:26:23,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:26:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:26:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:26:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:26:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:26:23,208 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:26:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:23,208 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:26:23,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:26:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:26:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:26:23,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:23,209 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:26:23,209 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:23,209 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:26:23,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:23,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:26:23,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:23,534 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:26:23,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:23,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:26:23,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:26:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:26:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:23,536 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:26:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:23,929 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:26:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:26:23,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:26:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:23,930 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:26:23,930 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:26:23,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:26:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:26:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:26:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:26:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:26:23,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:26:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:23,934 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:26:23,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:26:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:26:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:26:23,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:23,935 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:26:23,935 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:26:23,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:23,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:26:23,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:24,472 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:26:24,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:24,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:26:24,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:26:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:26:24,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:24,475 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:26:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:25,118 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:26:25,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:26:25,120 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:26:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:25,121 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:26:25,121 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:26:25,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:26:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:26:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:26:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:26:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:26:25,125 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:26:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:25,126 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:26:25,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:26:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:26:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:26:25,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:25,127 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:26:25,127 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:26:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:25,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:26:25,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:25,525 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:26:25,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:25,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:26:25,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:26:25,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:26:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:26:25,527 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:26:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:26,331 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:26:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:26:26,333 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:26:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:26,333 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:26:26,333 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:26:26,334 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:26:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:26:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:26:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:26:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:26:26,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:26:26,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:26,337 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:26:26,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:26:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:26:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:26:26,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:26,338 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:26:26,338 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:26:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:26,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:26:26,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:26,660 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:26:26,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:26:26,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:26:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:26:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:26,662 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:26:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:27,320 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:26:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:26:27,320 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:26:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:27,321 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:26:27,321 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:26:27,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:26:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:26:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:26:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:26:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:26:27,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:26:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:27,326 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:26:27,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:26:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:26:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:26:27,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:27,327 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:26:27,327 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:26:27,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:27,342 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:26:27,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:27,739 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:26:27,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:27,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:26:27,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:26:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:26:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:27,741 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:26:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:28,250 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:26:28,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:26:28,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:26:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:28,252 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:26:28,252 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:26:28,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:26:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:26:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:26:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:26:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:26:28,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:26:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:28,256 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:26:28,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:26:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:26:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:26:28,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:28,257 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:26:28,257 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:26:28,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:28,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:26:28,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:28,564 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:26:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:28,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:26:28,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:26:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:26:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:28,566 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:26:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:29,166 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:26:29,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:26:29,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:26:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:29,167 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:26:29,167 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:26:29,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:26:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:26:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:26:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:26:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:26:29,170 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:26:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:29,170 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:26:29,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:26:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:26:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:26:29,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:29,171 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:26:29,171 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:29,172 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:26:29,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:29,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:26:29,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:29,819 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:26:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:29,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:26:29,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:26:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:26:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:29,822 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:26:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:30,389 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:26:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:26:30,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:26:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:30,390 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:26:30,390 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:26:30,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:26:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:26:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:26:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:26:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:26:30,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:26:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:30,394 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:26:30,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:26:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:26:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:26:30,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:30,395 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:26:30,397 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:30,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:26:30,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:30,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:26:30,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:31,438 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:26:31,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:31,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:26:31,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:26:31,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:26:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:31,439 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:26:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:32,057 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:26:32,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:26:32,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:26:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:32,058 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:26:32,058 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:26:32,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:26:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:26:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:26:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:26:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:26:32,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:26:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:32,063 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:26:32,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:26:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:26:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:26:32,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:32,064 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:26:32,064 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:26:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:32,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:26:32,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:32,604 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:26:32,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:32,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:26:32,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:26:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:26:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:32,605 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:26:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:33,284 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:26:33,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:26:33,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:26:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:33,286 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:26:33,286 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:26:33,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:26:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:26:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:26:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:26:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:26:33,290 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:26:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:33,290 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:26:33,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:26:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:26:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:26:33,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:33,291 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:26:33,291 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:26:33,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:33,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:26:33,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:34,017 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:26:34,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:34,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:26:34,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:26:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:26:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:34,018 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:26:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:34,856 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:26:34,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:26:34,857 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:26:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:34,858 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:26:34,858 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:26:34,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:26:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:26:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:26:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:26:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:26:34,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:26:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:34,862 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:26:34,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:26:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:26:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:26:34,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:34,863 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:26:34,863 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:26:34,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:34,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:26:34,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:35,340 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:26:35,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:35,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:26:35,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:26:35,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:26:35,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:35,342 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:26:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:36,099 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:26:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:26:36,100 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:26:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:36,100 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:26:36,100 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:26:36,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:26:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:26:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:26:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:26:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:26:36,102 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:26:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:36,103 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:26:36,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:26:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:26:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:26:36,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:36,103 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:26:36,104 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:26:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:36,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:26:36,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:36,745 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:26:36,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:36,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:26:36,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:26:36,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:26:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:36,746 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:26:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:37,523 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:26:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:26:37,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:26:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:37,524 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:26:37,524 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:26:37,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:26:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:26:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:26:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:26:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:26:37,527 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:26:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:37,527 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:26:37,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:26:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:26:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:26:37,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:37,528 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:26:37,529 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:26:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:37,546 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:26:37,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:38,110 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:26:38,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:38,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:26:38,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:26:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:26:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:26:38,112 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:26:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:38,978 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:26:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:26:38,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:26:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:38,979 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:26:38,979 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:26:38,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:26:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:26:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:26:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:26:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:26:38,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:26:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:38,984 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:26:38,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:26:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:26:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:26:38,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:38,984 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:26:38,985 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:26:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:39,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:26:39,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,305 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:26:40,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:26:40,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:26:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:26:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:26:40,308 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:26:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:41,200 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:26:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:26:41,201 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:26:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:41,201 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:26:41,201 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:26:41,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:26:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:26:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:26:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:26:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:26:41,203 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:26:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:41,203 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:26:41,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:26:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:26:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:26:41,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:41,204 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:26:41,204 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:26:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:41,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:26:41,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:42,828 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:26:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:26:42,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:26:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:26:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:26:42,829 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:26:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:43,803 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:26:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:26:43,803 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:26:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:43,804 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:26:43,804 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:26:43,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:26:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:26:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:26:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:26:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:26:43,808 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:26:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:43,808 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:26:43,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:26:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:26:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:26:43,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:43,809 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:26:43,809 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:26:43,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:43,831 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:26:43,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:45,420 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:26:45,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:45,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:26:45,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:26:45,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:26:45,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:26:45,422 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:26:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:46,396 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:26:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:26:46,397 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:26:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:46,398 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:26:46,398 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:26:46,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:26:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:26:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:26:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:26:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:26:46,400 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:26:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:46,400 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:26:46,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:26:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:26:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:26:46,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:46,401 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:26:46,401 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:26:46,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:46,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:26:46,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:46,979 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:26:46,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:46,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:26:46,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:26:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:26:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:26:46,982 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:26:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:48,019 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:26:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:26:48,019 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:26:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:48,020 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:26:48,020 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:26:48,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:26:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:26:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:26:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:26:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:26:48,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:26:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:48,023 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:26:48,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:26:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:26:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:26:48,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:48,024 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:26:48,024 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:26:48,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:48,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:26:48,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:48,672 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:26:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:26:48,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:26:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:26:48,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:26:48,674 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:26:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:49,992 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:26:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:26:49,993 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:26:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:49,993 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:26:49,993 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:26:49,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:26:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:26:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:26:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:26:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:26:49,995 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:26:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:49,996 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:26:49,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:26:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:26:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:26:49,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:49,996 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:26:49,997 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:26:49,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:50,014 WARN L254 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:26:50,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:50,698 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:26:50,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:26:50,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:26:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:26:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:26:50,699 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:26:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:51,841 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:26:51,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:26:51,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:26:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:51,843 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:26:51,843 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:26:51,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:26:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:26:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:26:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:26:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:26:51,846 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:26:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:51,847 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:26:51,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:26:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:26:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:26:51,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:51,848 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:26:51,848 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:26:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:51,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:26:51,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:52,557 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:26:52,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:52,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:26:52,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:26:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:26:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:26:52,559 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:26:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,780 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:26:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:26:53,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:26:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,782 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:26:53,782 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:26:53,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:26:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:26:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:26:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:26:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:26:53,786 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:26:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,786 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:26:53,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:26:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:26:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:26:53,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,787 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:26:53,787 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:26:53,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:53,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:26:53,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:54,474 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:26:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:54,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:26:54,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:26:54,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:26:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:26:54,476 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:26:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:55,945 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:26:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:26:55,946 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:26:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:55,946 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:26:55,946 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:26:55,947 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:26:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:26:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:26:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:26:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:26:55,948 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:26:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:55,949 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:26:55,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:26:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:26:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:26:55,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:55,949 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:26:55,950 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:26:55,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:55,967 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:26:55,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:56,718 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:26:56,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:56,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:26:56,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:26:56,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:26:56,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:26:56,720 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:26:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:58,038 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:26:58,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:26:58,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:26:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:58,039 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:26:58,039 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:26:58,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:26:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:26:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:26:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:26:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:26:58,042 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:26:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:58,043 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:26:58,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:26:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:26:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:26:58,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:58,043 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:26:58,043 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:26:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:58,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:26:58,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:59,104 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:26:59,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:59,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:26:59,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:26:59,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:26:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:26:59,106 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:27:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:00,679 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:27:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:27:00,679 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:27:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:00,680 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:27:00,680 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:27:00,682 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:27:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:27:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:27:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:27:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:27:00,683 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:27:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:27:00,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:27:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:27:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:27:00,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:00,685 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:27:00,685 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:27:00,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:00,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:27:00,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:01,584 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:27:01,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:01,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:27:01,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:27:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:27:01,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:27:01,586 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:27:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:03,024 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:27:03,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:27:03,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:27:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:03,025 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:27:03,025 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:27:03,026 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:27:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:27:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:27:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:27:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:27:03,028 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:27:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:03,028 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:27:03,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:27:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:27:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:27:03,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:03,029 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:27:03,029 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:27:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:03,052 WARN L254 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:27:03,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:03,926 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:27:03,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:03,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:27:03,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:27:03,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:27:03,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:27:03,927 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:27:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:05,599 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:27:05,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:27:05,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:27:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:05,600 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:27:05,600 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:27:05,600 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:27:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:27:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:27:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:27:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:27:05,602 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:27:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:05,602 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:27:05,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:27:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:27:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:27:05,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:05,604 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:27:05,604 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:27:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:05,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:27:05,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:06,518 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:27:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:27:06,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:27:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:27:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:06,519 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:27:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:08,138 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:27:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:27:08,138 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:27:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:08,139 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:27:08,139 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:27:08,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:27:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:27:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:27:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:27:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:27:08,141 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:27:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:08,141 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:27:08,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:27:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:27:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:27:08,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:08,142 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:27:08,142 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:08,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:27:08,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:08,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:27:08,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:09,077 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:27:09,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:27:09,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:27:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:27:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:09,078 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:27:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:10,866 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:27:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:27:10,866 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:27:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:10,867 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:27:10,867 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:27:10,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:27:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:27:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:27:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:27:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:27:10,868 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:27:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:10,869 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:27:10,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:27:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:27:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:27:10,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:10,869 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:27:10,869 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:27:10,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:10,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:27:10,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:12,103 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:27:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:12,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:27:12,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:27:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:27:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:12,104 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:27:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:13,885 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:27:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:27:13,885 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:27:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:13,886 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:27:13,886 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:27:13,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:27:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:27:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:27:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:27:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:27:13,889 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:27:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:13,890 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:27:13,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:27:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:27:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:27:13,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:13,890 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:27:13,891 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:27:13,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:13,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:27:13,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:15,664 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:27:15,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:15,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:27:15,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:27:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:27:15,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:15,665 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:27:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:17,463 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:27:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:27:17,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:27:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:17,464 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:27:17,464 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:27:17,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:27:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:27:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:27:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:27:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:27:17,467 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:27:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:17,467 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:27:17,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:27:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:27:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:27:17,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:17,468 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:27:17,468 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:27:17,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:17,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:27:17,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:18,516 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:27:18,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:18,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:27:18,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:27:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:27:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:18,518 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:27:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:20,524 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:27:20,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:27:20,524 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:27:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:20,525 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:27:20,525 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:27:20,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:27:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:27:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:27:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:27:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:27:20,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:27:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:20,528 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:27:20,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:27:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:27:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:27:20,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:20,528 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:27:20,529 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:27:20,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:20,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:27:20,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:21,689 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:27:21,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:27:21,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:27:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:27:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:27:21,691 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:27:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:23,637 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:27:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:27:23,637 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:27:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:23,638 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:27:23,638 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:27:23,638 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:27:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:27:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:27:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:27:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:27:23,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:27:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:23,640 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:27:23,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:27:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:27:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:27:23,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:23,641 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:27:23,642 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:27:23,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:23,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:27:23,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:24,796 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:27:24,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:24,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:27:24,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:27:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:27:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:27:24,798 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:27:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:26,981 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:27:26,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:27:26,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:27:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:26,982 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:27:26,982 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:27:26,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:27:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:27:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:27:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:27:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:27:26,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:27:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:26,985 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:27:26,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:27:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:27:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:27:26,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:26,986 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:27:26,986 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:27:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:27,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:27:27,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:28,166 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:27:28,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:28,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:27:28,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:27:28,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:27:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:27:28,168 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:27:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:30,257 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:27:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:27:30,257 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:27:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:30,258 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:27:30,258 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:27:30,259 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:27:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:27:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:27:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:27:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:27:30,262 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:27:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:30,262 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:27:30,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:27:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:27:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:27:30,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:30,263 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:27:30,263 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:27:30,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:30,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:27:30,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:31,646 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:27:31,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:31,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:27:31,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:27:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:27:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:27:31,647 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:27:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:33,847 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:27:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:27:33,847 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:27:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:33,848 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:27:33,848 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:27:33,848 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:27:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:27:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:27:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:27:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:27:33,850 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:27:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:33,850 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:27:33,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:27:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:27:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:27:33,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:33,851 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:27:33,851 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:27:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:33,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:27:33,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:35,087 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:27:35,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:35,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:27:35,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:27:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:27:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:27:35,088 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:27:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:37,575 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:27:37,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:27:37,575 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:27:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:37,576 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:27:37,576 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:27:37,577 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:27:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:27:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:27:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:27:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:27:37,578 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:27:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:37,579 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:27:37,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:27:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:27:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:27:37,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:37,579 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:27:37,579 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:27:37,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:37,602 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:27:37,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:38,841 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:27:38,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:38,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:27:38,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:27:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:27:38,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:27:38,842 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:27:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:41,327 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:27:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:27:41,328 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:27:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:41,329 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:27:41,329 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:27:41,330 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:27:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:27:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:27:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:27:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:27:41,331 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:27:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:41,332 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:27:41,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:27:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:27:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:27:41,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:41,333 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:27:41,333 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:27:41,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:41,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:27:41,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:42,642 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:27:42,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:42,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:27:42,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:27:42,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:27:42,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:27:42,643 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:27:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:45,129 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:27:45,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:27:45,129 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:27:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:45,130 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:27:45,130 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:27:45,130 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:27:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:27:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:27:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:27:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:27:45,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:27:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:45,134 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:27:45,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:27:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:27:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:27:45,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:45,135 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:27:45,135 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:27:45,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:45,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:27:45,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:46,847 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:27:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:27:46,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:27:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:27:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:27:46,848 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:27:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:49,319 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:27:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:27:49,320 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:27:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:49,321 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:27:49,321 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:27:49,321 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:27:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:27:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:27:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:27:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:27:49,323 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:27:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:49,323 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:27:49,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:27:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:27:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:27:49,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:49,324 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:27:49,325 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:49,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:27:49,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:49,343 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:27:49,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:50,718 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:27:50,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:50,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:27:50,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:27:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:27:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:27:50,719 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:27:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:53,552 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:27:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:27:53,553 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:27:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:53,553 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:27:53,553 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:27:53,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:27:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:27:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:27:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:27:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:27:53,555 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:27:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:53,555 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:27:53,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:27:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:27:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:27:53,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:53,556 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:27:53,556 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:27:53,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:53,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:27:53,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:55,059 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:27:55,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:55,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:27:55,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:27:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:27:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:27:55,061 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:27:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:57,934 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:27:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:27:57,934 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:27:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:57,935 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:27:57,935 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:27:57,936 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:27:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:27:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:27:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:27:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:27:57,938 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:27:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:57,938 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:27:57,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:27:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:27:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:27:57,939 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:57,939 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:27:57,939 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:27:57,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:57,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:27:57,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:59,446 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:27:59,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:59,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:27:59,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:27:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:27:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:27:59,447 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:28:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:02,499 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:28:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:28:02,499 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:28:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:02,500 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:28:02,500 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:28:02,500 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:28:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:28:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:28:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:28:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:28:02,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:28:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:02,503 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:28:02,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:28:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:28:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:28:02,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:02,504 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:28:02,504 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:02,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:28:02,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:02,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:28:02,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:04,041 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:28:04,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:04,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:28:04,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:28:04,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:28:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:28:04,042 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:28:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:07,104 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:28:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:28:07,105 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:28:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:07,106 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:28:07,106 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:28:07,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:28:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:28:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:28:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:28:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:28:07,109 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:28:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:07,109 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:28:07,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:28:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:28:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:28:07,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:07,110 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:28:07,110 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:28:07,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:07,137 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:28:07,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:09,127 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:28:09,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:09,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:28:09,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:28:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:28:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:28:09,129 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:28:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:12,201 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:28:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:28:12,201 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:28:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:12,202 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:28:12,202 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:28:12,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:28:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:28:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:28:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:28:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:28:12,205 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:28:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:12,206 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:28:12,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:28:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:28:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:28:12,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:12,206 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:28:12,207 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:28:12,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:12,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:28:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:13,858 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:28:13,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:13,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:28:13,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:28:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:28:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:28:13,860 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:28:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:17,196 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:28:17,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:28:17,197 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:28:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:17,197 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:28:17,198 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:28:17,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:28:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:28:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:28:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:28:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:28:17,201 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:28:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:17,201 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:28:17,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:28:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:28:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:28:17,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:17,202 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:28:17,202 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:28:17,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:17,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:28:17,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:19,014 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:28:19,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:19,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:28:19,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:28:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:28:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:28:19,016 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:28:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:22,270 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:28:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:28:22,271 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:28:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:22,271 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:28:22,272 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:28:22,272 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:28:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:28:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:28:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:28:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:28:22,274 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:28:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:22,274 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:28:22,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:28:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:28:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:28:22,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:22,275 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:28:22,275 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:28:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:22,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:28:22,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:24,020 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:28:24,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:24,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:28:24,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:28:24,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:28:24,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:28:24,021 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:28:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:27,434 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:28:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:28:27,434 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:28:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:27,435 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:28:27,435 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:28:27,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:28:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:28:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:28:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:28:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:28:27,438 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:28:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:27,438 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:28:27,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:28:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:28:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:28:27,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:27,439 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:28:27,439 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:28:27,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:27,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:28:27,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:29,160 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:28:29,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:29,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:28:29,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:28:29,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:28:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:28:29,161 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:28:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:32,714 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:28:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:28:32,715 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:28:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:32,716 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:28:32,716 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:28:32,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:28:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:28:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:28:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:28:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:28:32,718 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:28:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:32,718 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:28:32,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:28:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:28:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:28:32,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:32,719 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:28:32,719 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:28:32,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:32,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:28:32,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:34,553 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:28:34,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:34,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:28:34,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:28:34,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:28:34,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:28:34,554 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:28:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:38,298 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:28:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:28:38,299 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:28:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:38,299 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:28:38,299 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:28:38,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:28:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:28:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:28:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:28:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:28:38,302 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:28:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:38,302 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:28:38,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:28:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:28:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:28:38,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:38,303 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:28:38,304 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:28:38,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:38,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:28:38,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:40,192 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:28:40,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:40,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:28:40,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:28:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:28:40,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:28:40,193 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:28:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:43,987 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:28:43,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:28:43,987 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:28:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:43,988 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:28:43,988 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:28:43,988 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:28:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:28:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:28:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:28:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:28:43,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:28:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:43,990 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:28:43,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:28:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:28:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:28:43,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:43,991 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:28:43,991 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:43,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:28:43,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:44,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:28:44,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:45,959 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:28:45,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:45,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:28:45,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:28:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:28:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:28:45,960 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:28:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:49,753 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:28:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:28:49,754 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:28:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:49,755 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:28:49,755 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:28:49,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:28:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:28:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:28:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:28:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:28:49,758 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:28:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:49,758 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:28:49,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:28:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:28:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:28:49,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:49,759 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:28:49,759 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:28:49,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:49,798 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:28:49,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:51,929 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:28:51,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:51,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:28:51,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:28:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:28:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:28:51,931 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:28:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:55,917 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:28:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:28:55,917 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:28:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:55,918 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:28:55,918 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:28:55,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:28:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:28:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:28:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:28:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:28:55,921 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:28:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:55,922 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:28:55,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:28:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:28:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:28:55,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:55,922 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:28:55,923 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:28:55,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:55,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:28:55,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:58,465 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:28:58,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:58,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:28:58,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:28:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:28:58,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:28:58,467 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:29:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:02,398 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:29:02,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:29:02,398 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:29:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:02,399 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:29:02,399 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:29:02,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:29:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:29:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:29:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:29:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:29:02,401 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:29:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:02,402 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:29:02,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:29:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:29:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:29:02,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:02,402 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:29:02,403 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:29:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:02,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:29:02,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:04,945 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:29:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:04,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:29:04,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:29:04,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:29:04,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:29:04,946 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:29:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:09,105 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:29:09,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:29:09,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:29:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:09,106 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:29:09,107 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:29:09,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:29:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:29:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:29:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:29:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:29:09,109 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:29:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:09,110 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:29:09,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:29:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:29:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:29:09,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:09,110 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:29:09,111 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:29:09,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:09,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:29:09,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:11,233 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:29:11,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:11,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:29:11,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:29:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:29:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:29:11,235 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:29:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:15,477 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:29:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:29:15,478 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:29:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:15,478 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:29:15,478 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:29:15,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:29:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:29:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:29:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:29:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:29:15,481 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:29:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:15,481 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:29:15,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:29:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:29:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:29:15,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:15,482 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:29:15,482 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:29:15,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:15,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:29:15,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:17,675 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:29:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:17,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:29:17,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:29:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:29:17,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:29:17,676 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:29:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:21,998 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:29:21,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:29:21,998 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:29:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:21,999 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:29:21,999 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:29:22,000 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:29:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:29:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:29:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:29:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:29:22,002 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:29:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:22,002 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:29:22,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:29:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:29:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:29:22,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:22,003 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:29:22,003 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:22,003 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:29:22,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:22,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:29:22,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:24,529 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:29:24,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:24,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:29:24,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:29:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:29:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:29:24,530 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:29:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:28,983 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:29:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:29:28,984 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:29:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:28,984 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:29:28,984 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:29:28,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:29:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:29:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:29:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:29:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:29:28,987 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:29:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:28,987 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:29:28,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:29:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:29:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:29:28,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:28,988 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:29:28,988 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:29:28,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:29,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:29:29,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:31,302 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:29:31,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:31,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:29:31,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:29:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:29:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:29:31,304 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:29:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:35,896 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:29:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:29:35,896 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:29:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:35,897 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:29:35,897 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:29:35,897 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:29:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:29:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:29:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:29:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:29:35,900 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:29:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:35,900 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:29:35,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:29:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:29:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:29:35,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:35,901 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:29:35,901 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:35,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:29:35,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:35,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:29:35,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:38,358 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:29:38,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:38,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:29:38,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:29:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:29:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:29:38,360 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:29:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:43,452 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:29:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:29:43,453 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:29:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:43,453 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:29:43,453 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:29:43,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:29:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:29:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:29:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:29:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:29:43,455 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:29:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:43,455 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:29:43,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:29:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:29:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:29:43,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:43,456 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:29:43,456 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:29:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:43,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:29:43,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:46,287 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:29:46,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:46,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:29:46,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:29:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:29:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:29:46,288 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:29:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:51,021 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:29:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:29:51,022 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:29:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:51,022 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:29:51,022 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:29:51,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:29:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:29:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:29:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:29:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:29:51,025 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:29:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:51,026 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:29:51,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:29:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:29:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:29:51,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:51,026 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:29:51,027 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:51,027 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:29:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:51,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:29:51,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:53,669 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:29:53,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:53,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:29:53,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:29:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:29:53,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:29:53,670 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:29:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:58,529 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:29:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:29:58,529 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:29:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:58,530 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:29:58,530 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:29:58,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:29:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:29:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:29:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:29:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:29:58,533 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:29:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:58,533 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:29:58,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:29:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:29:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:29:58,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:58,534 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:29:58,534 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:29:58,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:58,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:29:58,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:01,766 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:30:01,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:01,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:30:01,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:30:01,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:30:01,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:30:01,767 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:30:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:06,828 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:30:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:30:06,829 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:30:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:06,829 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:30:06,829 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:30:06,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:30:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:30:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:30:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:30:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:30:06,832 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:30:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:06,832 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:30:06,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:30:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:30:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:30:06,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:06,833 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:30:06,833 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:30:06,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:06,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:30:06,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:09,570 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:30:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:30:09,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:30:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:30:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:30:09,571 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:30:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:14,716 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:30:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:30:14,717 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:30:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:14,717 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:30:14,717 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:30:14,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:30:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:30:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:30:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:30:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:30:14,720 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:30:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:14,720 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:30:14,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:30:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:30:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:30:14,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:14,721 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:30:14,721 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:14,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:30:14,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:14,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:30:14,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:17,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:17,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:30:17,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:30:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:30:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:30:17,947 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:30:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:23,284 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:30:23,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:30:23,284 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:30:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:23,284 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:30:23,285 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:30:23,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:30:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:30:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:30:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:30:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:30:23,286 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:30:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:23,287 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:30:23,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:30:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:30:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:30:23,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:23,287 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:30:23,288 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:23,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-08-05 10:30:23,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:23,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:30:23,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:30:24,992 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:30:24,992 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:30:24,996 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:30:24,996 INFO L202 PluginConnector]: Adding new model simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:24 BoogieIcfgContainer [2019-08-05 10:30:24,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:24,998 INFO L168 Benchmark]: Toolchain (without parser) took 251189.16 ms. Allocated memory was 134.7 MB in the beginning and 203.9 MB in the end (delta: 69.2 MB). Free memory was 111.0 MB in the beginning and 80.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:24,998 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:24,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.87 ms. Allocated memory is still 134.7 MB. Free memory was 110.8 MB in the beginning and 109.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:25,000 INFO L168 Benchmark]: Boogie Preprocessor took 18.10 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:25,001 INFO L168 Benchmark]: RCFGBuilder took 332.03 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 98.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:25,002 INFO L168 Benchmark]: TraceAbstraction took 250803.35 ms. Allocated memory was 134.7 MB in the beginning and 203.9 MB in the end (delta: 69.2 MB). Free memory was 98.7 MB in the beginning and 80.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:25,007 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.87 ms. Allocated memory is still 134.7 MB. Free memory was 110.8 MB in the beginning and 109.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.10 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 108.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.03 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 98.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250803.35 ms. Allocated memory was 134.7 MB in the beginning and 203.9 MB in the end (delta: 69.2 MB). Free memory was 98.7 MB in the beginning and 80.1 MB in the end (delta: 18.5 MB). Peak memory consumption was 87.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 83,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 250.7s OverallTime, 84 OverallIterations, 83 TraceHistogramMax, 154.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 249 SDtfs, 0 SDslu, 3486 SDs, 0 SdLazy, 201026 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 83 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 92.0s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 83 NumberOfNonLiveVariables, 11288 ConjunctsInSsa, 7138 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown