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/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:05:13,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:05:13,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:05:13,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:05:13,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:05:13,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:05:13,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:05:13,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:05:13,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:05:13,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:05:13,745 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:05:13,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:05:13,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:05:13,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:05:13,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:05:13,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:05:13,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:05:13,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:05:13,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:05:13,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:05:13,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:05:13,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:05:13,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:05:13,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:05:13,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:05:13,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:05:13,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:05:13,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:05:13,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:05:13,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:05:13,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:05:13,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:05:13,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:05:13,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:05:13,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:05:13,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:05:13,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:05:13,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:05:13,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:05:13,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:05:13,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:05:13,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:05:13,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:05:13,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:05:13,842 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:05:13,842 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:05:13,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_5.bpl [2019-08-05 11:05:13,843 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_5.bpl' [2019-08-05 11:05:13,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:05:13,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:05:13,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:13,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:05:13,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:05:13,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:13,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:05:13,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:05:13,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:05:13,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/1) ... [2019-08-05 11:05:13,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:05:13,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:05:13,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:05:13,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:05:13,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05: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 11:05:14,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:05:14,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:05:14,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:05:14,313 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:05:14,313 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:05:14,314 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:14 BoogieIcfgContainer [2019-08-05 11:05:14,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:05:14,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:05:14,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:05:14,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:05:14,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:13" (1/2) ... [2019-08-05 11:05:14,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a834af and model type array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:05:14, skipping insertion in model container [2019-08-05 11:05:14,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:14" (2/2) ... [2019-08-05 11:05:14,327 INFO L109 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i_5.bpl [2019-08-05 11:05:14,338 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:05:14,347 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:05:14,364 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:05:14,387 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:05:14,387 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:05:14,387 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:05:14,388 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:05:14,388 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:05:14,388 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:05:14,388 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:05:14,388 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:05:14,388 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:05:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:05:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:05:14,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:14,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:05:14,410 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:14,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 11:05:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:14,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:14,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:05:14,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:05:14,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:05:14,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:05:14,582 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:05:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:14,622 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:05:14,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:05:14,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:05:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:14,636 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:05:14,636 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:05:14,638 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 11:05:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:05:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:05:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:05:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:05:14,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:05:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:14,684 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:05:14,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:05:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:05:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:05:14,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:14,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:05:14,685 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 11:05:14,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:14,855 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 11:05:14,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:14,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:05:14,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:14,859 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:05:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:14,922 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:05:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:05:14,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:05:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:14,923 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:05:14,923 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:05:14,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:05:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:05:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:05:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:05:14,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:05:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:14,927 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:05:14,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:05:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:05:14,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:14,928 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:05:14,928 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 11:05:14,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,046 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 11:05:15,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:05:15,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:05:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:05:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:15,049 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:05:15,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,101 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:05:15,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:05:15,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:05:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,103 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:05:15,103 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:05:15,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:05:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:05:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:05:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:05:15,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:05:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,107 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:05:15,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:05:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:05:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:05:15,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,108 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:05:15,109 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 11:05:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:15,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:05:15,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,270 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 11:05:15,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:05:15,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:05:15,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:05:15,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:05:15,272 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:05:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,324 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:05:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:05:15,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:05:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,325 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:05:15,325 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:05:15,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:05:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:05:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:05:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:05:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:05:15,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:05:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,329 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:05:15,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:05:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:05:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:05:15,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,330 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:05:15,330 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 11:05:15,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:15,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:05:15,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,530 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 11:05:15,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:05:15,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:05:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:05:15,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:15,532 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:05:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,601 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:05:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:05:15,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:05:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,604 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:05:15,604 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:05:15,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:05:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:05:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:05:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:05:15,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:05:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,610 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:05:15,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:05:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:05:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:05:15,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,610 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:05:15,611 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 11:05:15,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:15,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:05:15,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:15,913 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 11:05:15,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:05:15,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:05:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:05:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:15,915 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:05:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,959 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:05:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:05:15,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:05:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,963 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:05:15,963 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:05:15,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:05:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:05:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:05:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:05:15,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:05:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,967 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:05:15,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:05:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:05:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:05:15,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,967 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:05:15,968 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 11:05:15,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:16,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:05:16,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:16,212 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 11:05:16,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:16,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:05:16,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:05:16,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:05:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:16,215 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:05:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:16,254 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:05:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:05:16,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:05:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:16,255 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:05:16,256 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:05:16,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:05:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:05:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:05:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:05:16,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:05:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:16,259 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:05:16,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:05:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:05:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:05:16,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:16,260 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:05:16,260 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 11:05:16,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:16,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:05:16,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:16,520 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 11:05:16,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:16,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:05:16,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:05:16,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:05:16,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:05:16,522 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:05:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:16,555 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:05:16,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:05:16,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:05:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:16,557 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:05:16,557 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:05:16,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:05:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:05:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:05:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:05:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:05:16,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:05:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:16,561 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:05:16,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:05:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:05:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:05:16,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:16,562 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:05:16,562 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:16,563 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 11:05:16,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:16,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:05:16,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,033 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 11:05:17,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:05:17,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:05:17,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:05:17,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:05:17,035 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:05:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:17,068 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:05:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:05:17,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:05:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:17,070 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:05:17,070 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:05:17,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:05:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:05:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:05:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:05:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:05:17,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:05:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:17,075 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:05:17,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:05:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:05:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:05:17,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:17,076 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:05:17,076 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:17,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 11:05:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:17,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:05:17,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,378 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 11:05:17,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:05:17,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:05:17,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:05:17,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:05:17,380 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:05:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:17,416 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:05:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:05:17,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:05:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:17,417 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:05:17,417 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:05:17,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:05:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:05:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:05:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:05:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:05:17,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:05:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:17,421 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:05:17,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:05:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:05:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:05:17,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:17,422 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:05:17,422 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 11:05:17,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:17,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:05:17,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,676 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 11:05:17,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:05:17,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:05:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:05:17,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:05:17,678 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 11:05:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:17,715 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:05:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:05:17,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:05:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:17,717 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:05:17,717 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:05:17,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:05:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:05:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:05:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:05:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:05:17,721 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:05:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:17,721 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:05:17,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:05:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:05:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:05:17,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:17,722 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:05:17,722 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 11:05:17,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:17,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:05:17,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:18,099 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 11:05:18,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:05:18,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:05:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:05:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:05:18,102 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 11:05:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:18,160 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:05:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:05:18,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:05:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:18,161 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:05:18,162 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:05:18,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:05:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:05:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:05:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:05:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:05:18,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:05:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:18,165 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:05:18,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:05:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:05:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:05:18,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:18,166 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:05:18,166 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 11:05:18,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:18,389 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 11:05:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:05:18,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:05:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:05:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:18,391 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 11:05:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:18,415 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:05:18,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:05:18,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:05:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:18,416 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:05:18,416 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:05:18,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:05:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:05:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:05:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:05:18,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:05:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:18,420 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:05:18,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:05:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:05:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:05:18,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:18,421 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:05:18,421 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 11:05:18,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:18,688 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 11:05:18,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:18,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:05:18,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:05:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:05:18,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:05:18,690 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 11:05:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:18,719 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:05:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:05:18,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:05:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:18,720 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:05:18,720 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:05:18,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:05:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:05:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:05:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:05:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:05:18,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:05:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:18,724 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:05:18,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:05:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:05:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:05:18,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:18,725 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:05:18,725 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 11:05:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:19,500 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 11:05:19,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:19,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:05:19,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:05:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:05:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:05:19,502 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 11:05:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:19,609 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:05:19,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:05:19,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:05:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:19,611 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:05:19,611 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:05:19,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:05:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:05:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:05:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:05:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:05:19,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:05:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:19,614 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:05:19,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:05:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:05:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:05:19,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:19,615 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:05:19,616 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 11:05:19,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:19,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:05:19,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:20,255 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 11:05:20,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:20,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:05:20,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:05:20,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:05:20,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:05:20,258 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 11:05:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:20,435 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:05:20,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:05:20,436 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:05:20,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:20,437 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:05:20,437 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:05:20,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:05:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:05:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:05:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:05:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:05:20,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:05:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:20,446 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:05:20,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:05:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:05:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:05:20,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:20,447 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:05:20,448 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 11:05:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:20,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:05:20,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,608 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 11:05:21,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:21,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:05:21,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:05:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:05:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:05:21,610 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 11:05:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:21,653 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:05:21,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:05:21,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:05:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:21,655 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:05:21,655 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:05:21,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:05:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:05:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:05:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:05:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:05:21,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:05:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:21,659 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:05:21,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:05:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:05:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:05:21,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:21,660 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:05:21,660 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 11:05:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,986 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 11:05:21,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:05:21,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:05:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:05:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:05:21,988 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 11:05:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,209 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:05:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:05:22,211 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:05:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,212 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:05:22,212 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:05:22,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:05:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:05:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:05:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:05:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:05:22,215 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:05:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,216 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:05:22,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:05:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:05:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:05:22,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,217 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:05:22,217 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 11:05:22,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:22,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:05:22,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:22,475 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 11:05:22,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:05:22,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:05:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:05:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:05:22,477 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 11:05:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,575 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:05:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:05:22,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:05:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,576 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:05:22,576 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:05:22,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:05:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:05:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:05:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:05:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:05:22,580 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:05:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,580 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:05:22,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:05:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:05:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:05:22,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,581 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:05:22,581 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 11:05:22,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:22,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:05:22,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:22,847 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 11:05:22,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:22,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:05:22,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:05:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:05:22,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:05:22,848 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 11:05:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,890 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:05:22,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:05:22,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:05:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,892 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:05:22,892 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:05:22,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:05:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:05:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:05:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:05:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:05:22,896 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:05:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,897 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:05:22,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:05:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:05:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:05:22,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,898 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:05:22,899 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 11:05:22,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:22,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:05:22,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:23,280 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 11:05:23,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:23,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:23,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:05:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:05:23,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:23,282 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 11:05:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:23,318 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:05:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:05:23,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 11:05:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:23,318 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:05:23,319 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:05:23,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:05:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:05:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:05:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:05:23,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 11:05:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:23,321 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:05:23,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:05:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:05:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:05:23,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:23,322 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 11:05:23,323 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 11:05:23,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:23,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:05:23,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:23,724 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 11:05:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:23,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:23,726 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 11:05:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:23,786 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:05:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:23,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 11:05:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:23,789 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:05:23,789 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:05:23,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:05:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:05:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:05:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:05:23,792 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 11:05:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:23,792 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:05:23,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:05:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:05:23,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:23,793 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 11:05:23,794 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 11:05:23,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:23,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:05:23,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:24,261 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 11:05:24,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:24,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:24,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:24,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:24,263 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 11:05:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:24,325 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:05:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:24,326 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 11:05:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:24,327 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:05:24,327 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:05:24,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:05:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:05:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:05:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:05:24,331 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 11:05:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:24,331 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:05:24,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:05:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:05:24,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:24,332 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 11:05:24,332 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 11:05:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:24,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:05:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:24,814 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 11:05:24,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:24,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:24,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:24,816 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 11:05:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:24,895 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:05:24,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:24,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 11:05:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:24,895 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:05:24,895 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:05:24,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:05:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:05:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:05:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:05:24,898 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 11:05:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:24,899 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:05:24,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:05:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:05:24,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:24,900 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 11:05:24,900 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 11:05:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:24,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:05:24,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:25,748 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 11:05:25,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:25,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:25,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:25,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:25,750 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 11:05:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:25,797 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:05:25,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:25,797 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 11:05:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:25,798 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:05:25,798 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:05:25,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:05:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:05:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:05:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:05:25,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 11:05:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:25,802 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:05:25,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:05:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:05:25,803 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:25,803 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 11:05:25,803 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:25,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 11:05:25,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:25,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:05:25,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:26,462 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 11:05:26,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:26,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:05:26,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:05:26,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:05:26,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:26,465 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 11:05:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:26,500 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:05:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:05:26,501 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 11:05:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:26,502 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:05:26,502 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:05:26,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:05:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:05:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:05:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:05:26,505 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 11:05:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:26,505 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:05:26,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:05:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:05:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:05:26,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:26,506 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 11:05:26,506 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 11:05:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:26,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:05:26,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:27,580 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 11:05:27,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:27,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:05:27,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:05:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:05:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:27,581 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 11:05:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:27,731 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:05:27,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:05:27,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 11:05:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:27,732 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:05:27,732 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:05:27,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:05:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:05:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:05:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:05:27,737 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 11:05:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:27,738 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:05:27,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:05:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:05:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:05:27,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:27,739 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 11:05:27,739 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 11:05:27,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:27,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:05:27,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:28,302 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 11:05:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:28,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:05:28,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:05:28,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:05:28,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:28,304 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 11:05:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:28,349 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:05:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:05:28,349 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 11:05:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:28,350 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:05:28,350 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:05:28,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:05:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:05:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:05:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:05:28,355 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 11:05:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:28,355 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:05:28,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:05:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:05:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:05:28,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:28,356 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 11:05:28,358 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 11:05:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:28,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:05:28,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:28,850 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 11:05:28,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:28,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:05:28,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:05:28,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:05:28,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:28,852 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 11:05:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:28,915 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:05:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:05:28,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 11:05:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:28,919 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:05:28,919 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:05:28,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:28,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:05:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:05:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:05:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:05:28,922 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 11:05:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:28,923 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:05:28,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:05:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:05:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:05:28,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:28,924 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 11:05:28,924 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 11:05:28,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:28,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:05:28,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:29,398 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 11:05:29,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:29,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:05:29,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:05:29,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:05:29,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:29,400 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 11:05:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:29,490 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:05:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:05:29,491 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 11:05:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:29,491 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:05:29,492 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:05:29,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:05:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:05:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:05:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:05:29,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 11:05:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:29,496 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:05:29,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:05:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:05:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:05:29,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:29,497 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 11:05:29,497 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 11:05:29,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:29,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:05:29,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:30,387 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 11:05:30,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:30,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:05:30,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:05:30,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:05:30,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:30,388 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 11:05:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:30,442 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:05:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:05:30,442 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 11:05:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:30,443 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:05:30,443 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:05:30,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:05:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:05:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:05:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:05:30,446 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 11:05:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:30,447 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:05:30,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:05:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:05:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:05:30,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:30,448 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 11:05:30,448 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 11:05:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:30,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:05:30,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:31,379 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 11:05:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:05:31,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:05:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:05:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:31,381 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 11:05:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:31,419 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:05:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:05:31,420 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 11:05:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:31,420 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:05:31,421 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:05:31,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:05:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:05:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:05:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:05:31,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 11:05:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:31,425 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:05:31,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:05:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:05:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:05:31,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:31,426 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 11:05:31,426 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:31,426 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 11:05:31,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:31,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:05:31,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:32,622 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 11:05:32,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:05:32,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:05:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:05:32,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:32,624 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 11:05:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:32,665 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:05:32,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:05:32,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 11:05:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:32,666 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:05:32,666 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:05:32,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:05:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:05:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:05:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:05:32,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 11:05:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:32,671 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:05:32,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:05:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:05:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:05:32,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:32,672 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 11:05:32,672 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 11:05:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:32,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:05:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:33,383 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 11:05:33,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:33,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:05:33,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:05:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:05:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:33,384 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 11:05:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:33,426 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:05:33,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:05:33,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 11:05:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:33,427 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:05:33,427 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:05:33,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:05:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:05:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:05:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:05:33,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 11:05:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:33,431 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:05:33,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:05:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:05:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:05:33,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:33,431 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 11:05:33,431 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 11:05:33,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:33,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:05:33,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:34,282 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 11:05:34,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:34,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:05:34,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:05:34,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:05:34,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:34,284 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 11:05:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,371 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:05:34,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:05:34,371 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 11:05:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,372 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:05:34,372 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:05:34,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:05:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:05:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:05:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:05:34,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 11:05:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,375 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:05:34,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:05:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:05:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:05:34,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,375 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 11:05:34,376 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 11:05:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:34,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:05:34,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:36,483 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 11:05:36,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:36,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:05:36,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:05:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:05:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:36,485 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 11:05:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:36,733 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:05:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:05:36,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 11:05:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:36,735 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:05:36,735 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:05:36,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:05:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:05:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:05:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:05:36,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 11:05:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:36,738 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:05:36,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:05:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:05:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:05:36,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:36,739 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 11:05:36,739 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 11:05:36,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:36,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:05:36,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:37,731 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 11:05:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:37,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:05:37,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:05:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:05:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:37,734 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 11:05:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,779 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:05:37,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:05:37,779 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 11:05:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,780 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:05:37,780 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:05:37,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:05:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:05:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:05:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:05:37,784 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 11:05:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,784 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:05:37,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:05:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:05:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:05:37,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,785 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 11:05:37,785 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 11:05:37,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:37,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:05:37,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,570 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 11:05:38,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:38,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:05:38,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:05:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:05:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:05:38,572 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 11:05:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:38,620 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:05:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:05:38,620 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 11:05:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:38,621 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:05:38,621 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:05:38,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:05:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:05:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:05:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:05:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:05:38,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 11:05:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:38,625 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:05:38,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:05:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:05:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:05:38,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:38,625 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 11:05:38,626 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 11:05:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:38,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:05:38,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:39,366 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 11:05:39,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:05:39,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:05:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:05:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:05:39,368 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 11:05:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:39,420 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:05:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:05:39,420 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 11:05:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:39,421 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:05:39,421 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:05:39,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:05:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:05:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:05:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:05:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:05:39,425 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 11:05:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:39,425 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:05:39,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:05:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:05:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:39,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:39,426 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 11:05:39,426 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 11:05:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:39,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:05:39,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:40,686 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 11:05:40,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:40,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:05:40,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:05:40,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:05:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:05:40,688 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 11:05:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:40,741 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:05:40,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:05:40,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 11:05:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:40,742 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:05:40,742 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:05:40,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:05:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:05:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:05:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:05:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:05:40,745 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 11:05:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:40,746 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:05:40,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:05:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:05:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:05:40,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:40,746 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 11:05:40,747 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:40,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:40,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 11:05:40,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:40,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:05:40,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:41,621 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 11:05:41,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:41,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:05:41,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:05:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:05:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:05:41,623 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 11:05:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:41,716 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:05:41,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:05:41,716 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 11:05:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:41,717 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:05:41,717 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:05:41,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:05:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:05:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:05:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:05:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:05:41,719 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 11:05:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:41,719 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:05:41,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:05:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:05:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:41,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:41,720 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 11:05:41,720 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 11:05:41,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:41,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:05:41,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,685 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 11:05:42,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:05:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:05:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:05:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:42,687 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 11:05:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:42,768 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:05:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:05:42,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 11:05:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:42,769 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:05:42,769 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:05:42,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:05:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:05:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:05:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:05:42,771 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 11:05:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:42,771 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:05:42,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:05:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:05:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:05:42,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:42,772 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 11:05:42,772 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 11:05:42,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:43,623 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 11:05:43,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:43,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:05:43,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:05:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:05:43,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:43,625 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 11:05:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:43,686 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:05:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:05:43,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 11:05:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:43,687 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:05:43,687 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:05:43,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:05:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:05:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:05:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:05:43,690 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 11:05:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:43,690 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:05:43,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:05:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:05:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:43,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:43,692 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 11:05:43,692 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 11:05:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:43,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:05:43,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:44,566 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 11:05:44,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:44,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:05:44,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:05:44,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:05:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:05:44,568 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 11:05:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:44,626 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:05:44,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:05:44,627 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 11:05:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:44,627 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:05:44,627 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:05:44,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:05:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:05:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:05:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:05:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:05:44,629 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 11:05:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:44,629 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:05:44,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:05:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:05:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:05:44,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:44,630 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 11:05:44,630 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 11:05:44,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:44,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:05:44,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:45,806 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 11:05:45,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:45,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:05:45,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:05:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:05:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:45,808 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 11:05:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:45,890 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:05:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:05:45,891 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 11:05:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:45,892 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:05:45,892 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:05:45,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:05:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:05:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:05:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:05:45,895 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 11:05:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:45,895 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:05:45,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:05:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:05:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:45,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:45,896 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 11:05:45,896 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 11:05:45,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:45,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:05:45,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:46,963 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 11:05:46,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:46,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:05:46,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:05:46,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:05:46,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:05:46,965 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 11:05:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:47,237 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:05:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:05:47,237 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 11:05:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:47,238 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:05:47,238 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:05:47,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:05:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:05:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:05:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:05:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:05:47,241 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 11:05:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:47,241 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:05:47,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:05:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:05:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:05:47,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:47,242 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 11:05:47,242 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 11:05:47,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:47,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:05:47,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:48,157 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 11:05:48,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:48,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:05:48,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:05:48,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:05:48,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:05:48,159 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 11:05:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:48,245 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:05:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:05:48,246 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 11:05:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:48,247 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:05:48,247 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:05:48,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:05:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:05:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:05:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:05:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:05:48,248 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 11:05:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:48,249 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:05:48,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:05:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:05:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:05:48,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:48,249 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 11:05:48,249 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 11:05:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:48,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:05:48,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:49,385 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 11:05:49,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:49,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:05:49,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:05:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:05:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:05:49,386 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 11:05:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:49,450 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:05:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:05:49,451 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 11:05:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:49,451 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:05:49,452 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:05:49,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:05:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:05:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:05:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:05:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:05:49,454 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 11:05:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:49,454 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:05:49,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:05:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:05:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:05:49,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:49,455 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 11:05:49,455 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 11:05:49,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:05:49,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:50,413 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 11:05:50,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:50,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:05:50,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:05:50,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:05:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:05:50,415 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 11:05:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:50,524 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:05:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:05:50,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 11:05:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:50,524 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:05:50,525 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:05:50,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:05:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:05:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:05:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:05:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:05:50,526 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 11:05:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:50,527 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:05:50,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:05:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:05:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:05:50,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:50,528 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 11:05:50,528 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 11:05:50,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:50,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:05:50,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:51,680 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 11:05:51,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:51,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:05:51,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:05:51,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:05:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:05:51,681 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 11:05:51,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:51,744 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:05:51,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:05:51,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 11:05:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:51,745 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:05:51,745 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:05:51,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:05:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:05:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:05:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:05:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:05:51,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 11:05:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:51,749 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:05:51,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:05:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:05:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:05:51,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:51,750 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 11:05:51,750 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 11:05:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:51,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:05:51,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:52,925 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 11:05:52,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:05:52,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:05:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:05:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:05:52,927 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 11:05:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:53,000 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:05:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:05:53,000 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 11:05:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:53,001 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:05:53,001 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:05:53,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:05:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:05:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:05:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:05:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:05:53,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 11:05:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:53,005 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:05:53,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:05:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:05:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:05:53,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:53,006 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 11:05:53,006 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 11:05:53,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:53,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:05:53,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:54,641 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 11:05:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:05:54,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:05:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:05:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:05:54,643 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 11:05:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:54,742 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:05:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:05:54,742 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 11:05:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:54,743 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:05:54,743 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:05:54,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:05:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:05:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:05:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:05:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:05:54,746 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 11:05:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:54,746 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:05:54,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:05:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:05:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:05:54,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:54,747 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 11:05:54,748 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 11:05:54,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:54,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:05:54,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:56,164 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 11:05:56,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:56,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:05:56,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:05:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:05:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:05:56,166 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 11:05:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:56,235 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:05:56,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:05:56,235 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 11:05:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:56,236 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:05:56,236 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:05:56,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:05:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:05:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:05:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:05:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:05:56,240 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 11:05:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:56,240 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:05:56,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:05:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:05:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:05:56,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:56,241 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 11:05:56,241 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 11:05:56,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:56,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:56,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:57,469 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 11:05:57,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:57,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:05:57,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:05:57,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:05:57,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:05:57,470 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 11:05:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:57,537 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:05:57,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:05:57,538 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 11:05:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:57,539 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:05:57,539 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:05:57,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:05:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:05:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:05:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:05:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:05:57,542 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 11:05:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:57,542 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:05:57,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:05:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:05:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:05:57,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:57,543 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 11:05:57,543 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 11:05:57,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:57,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:57,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:59,391 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 11:05:59,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:59,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:05:59,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:05:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:05:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:05:59,392 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 11:05:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:59,475 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:05:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:05:59,475 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 11:05:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:59,476 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:05:59,476 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:05:59,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:05:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:05:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:05:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:05:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:05:59,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 11:05:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:59,479 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:05:59,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:05:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:05:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:05:59,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:59,480 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 11:05:59,480 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 11:05:59,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:59,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:05:59,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:00,810 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 11:06:00,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:00,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:06:00,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:06:00,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:06:00,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:06:00,811 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 11:06:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:00,966 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:06:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:06:00,966 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 11:06:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:00,967 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:06:00,967 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:06:00,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:06:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:06:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:06:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:06:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:06:00,969 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 11:06:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:00,970 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:06:00,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:06:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:06:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:06:00,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:00,971 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 11:06:00,971 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 11:06:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:01,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:06:01,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:02,267 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 11:06:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:06:02,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:06:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:06:02,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:06:02,269 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 11:06:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:02,343 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:06:02,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:06:02,343 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 11:06:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:02,344 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:06:02,344 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:06:02,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:06:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:06:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:06:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:06:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:06:02,346 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 11:06:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:02,346 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:06:02,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:06:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:06:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:06:02,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:02,347 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 11:06:02,347 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 11:06:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:02,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:06:02,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:03,614 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 11:06:03,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:03,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:06:03,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:06:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:06:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:06:03,615 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 11:06:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:03,692 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:06:03,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:06:03,692 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 11:06:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:03,693 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:06:03,693 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:06:03,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:06:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:06:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:06:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:06:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:06:03,696 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 11:06:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:03,697 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:06:03,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:06:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:06:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:06:03,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:03,698 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 11:06:03,698 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 11:06:03,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:03,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:06:03,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:05,040 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 11:06:05,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:05,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:06:05,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:06:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:06:05,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:06:05,041 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 11:06:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:05,122 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:06:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:06:05,122 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 11:06:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:05,123 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:06:05,123 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:06:05,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:06:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:06:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:06:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:06:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:06:05,126 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 11:06:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:05,126 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:06:05,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:06:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:06:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:06:05,127 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:05,127 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 11:06:05,127 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 11:06:05,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:05,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:06:05,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:06,992 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 11:06:06,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:06,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:06:06,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:06:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:06:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:06:06,993 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 11:06:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:07,090 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:06:07,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:06:07,091 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 11:06:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:07,091 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:06:07,091 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:06:07,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:06:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:06:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:06:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:06:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:06:07,093 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 11:06:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:07,094 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:06:07,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:06:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:06:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:06:07,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:07,094 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 11:06:07,094 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 11:06:07,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:07,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:06:07,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:08,495 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 11:06:08,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:08,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:06:08,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:06:08,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:06:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:06:08,496 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 11:06:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:08,579 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:06:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:06:08,579 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 11:06:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:08,580 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:06:08,580 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:06:08,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:06:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:06:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:06:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:06:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:06:08,583 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 11:06:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:08,583 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:06:08,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:06:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:06:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:06:08,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:08,584 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 11:06:08,584 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 11:06:08,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:08,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:06:08,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:10,028 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 11:06:10,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:10,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:06:10,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:06:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:06:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:06:10,030 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 11:06:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:10,148 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:06:10,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:06:10,148 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 11:06:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:10,149 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:06:10,149 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:06:10,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:06:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:06:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:06:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:06:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:06:10,152 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 11:06:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:10,152 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:06:10,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:06:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:06:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:06:10,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:10,153 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 11:06:10,153 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 11:06:10,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:10,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:06:10,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:12,029 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 11:06:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:06:12,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:06:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:06:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:06:12,031 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 11:06:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:12,116 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:06:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:06:12,116 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 11:06:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:12,117 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:06:12,117 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:06:12,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:06:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:06:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:06:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:06:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:06:12,120 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 11:06:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:12,121 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:06:12,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:06:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:06:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:06:12,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:12,121 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 11:06:12,122 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 11:06:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:12,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:06:12,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:13,693 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 11:06:13,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:13,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:06:13,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:06:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:06:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:06:13,694 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 11:06:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:13,783 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:06:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:06:13,785 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 11:06:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:13,785 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:06:13,785 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:06:13,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:06:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:06:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:06:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:06:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:06:13,788 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 11:06:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:13,789 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:06:13,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:06:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:06:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:06:13,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:13,789 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 11:06:13,790 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 11:06:13,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:13,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:06:13,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:15,332 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 11:06:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:15,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:06:15,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:06:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:06:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:06:15,334 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 11:06:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:15,422 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:06:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:06:15,423 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 11:06:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:15,424 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:06:15,424 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:06:15,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:06:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:06:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:06:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:06:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:06:15,427 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 11:06:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:15,427 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:06:15,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:06:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:06:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:06:15,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:15,428 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 11:06:15,428 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 11:06:15,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:15,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:06:15,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:17,455 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 11:06:17,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:17,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:06:17,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:06:17,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:06:17,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:06:17,456 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 11:06:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:17,543 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:06:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:06:17,543 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 11:06:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:17,544 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:06:17,544 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:06:17,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:06:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:06:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:06:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:06:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:06:17,547 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 11:06:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:17,548 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:06:17,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:06:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:06:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:06:17,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:17,549 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 11:06:17,549 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 11:06:17,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:17,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:06:17,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:19,273 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 11:06:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:06:19,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:06:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:06:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:06:19,274 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 11:06:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:19,361 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:06:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:06:19,362 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 11:06:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:19,362 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:06:19,363 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:06:19,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:06:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:06:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:06:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:06:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:06:19,365 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 11:06:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:19,366 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:06:19,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:06:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:06:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:06:19,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:19,366 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 11:06:19,366 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 11:06:19,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:19,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:06:19,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,111 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 11:06:21,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:21,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:06:21,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:06:21,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:06:21,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:06:21,112 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 11:06:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:21,220 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:06:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:06:21,221 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 11:06:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:21,222 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:06:21,222 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:06:21,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:06:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:06:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:06:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:06:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:06:21,224 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 11:06:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:21,225 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:06:21,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:06:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:06:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:06:21,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:21,226 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 11:06:21,226 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 11:06:21,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:23,220 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 11:06:23,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:23,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:06:23,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:06:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:06:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:06:23,222 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 11:06:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:23,364 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:06:23,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:06:23,364 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 11:06:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:23,365 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:06:23,365 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:06:23,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:06:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:06:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:06:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:06:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:06:23,367 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 11:06:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:23,368 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:06:23,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:06:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:06:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:06:23,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:23,368 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 11:06:23,369 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 11:06:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:23,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:06:23,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:25,423 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 11:06:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:25,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:06:25,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:06:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:06:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:06:25,425 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 11:06:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:25,524 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:06:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:06:25,524 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 11:06:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:25,525 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:06:25,526 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:06:25,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:06:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:06:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:06:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:06:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:06:25,529 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 11:06:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:25,529 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:06:25,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:06:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:06:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:06:25,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:25,530 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 11:06:25,530 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:25,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 11:06:25,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:25,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:06:25,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:27,722 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 11:06:27,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:06:27,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:06:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:06:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:06:27,724 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 11:06:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:27,824 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:06:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:06:27,825 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 11:06:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:27,826 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:06:27,826 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:06:27,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:06:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:06:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:06:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:06:27,829 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 11:06:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:27,829 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:06:27,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:06:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:06:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:06:27,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:27,830 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 11:06:27,830 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:27,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 11:06:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:27,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:06:27,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:30,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:30,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:06:30,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:06:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:06:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:06:30,077 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 11:06:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:30,173 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:06:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:06:30,174 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 11:06:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:30,175 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:06:30,175 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:06:30,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:06:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:06:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:06:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:06:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:06:30,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 11:06:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:30,180 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:06:30,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:06:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:06:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:06:30,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:30,180 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 11:06:30,181 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 11:06:30,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:30,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:06:30,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:33,412 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 11:06:33,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:33,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:06:33,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:06:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:06:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:06:33,414 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 11:06:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:33,511 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:06:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:06:33,512 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 11:06:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:33,513 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:06:33,513 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:06:33,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:06:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:06:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:06:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:06:33,516 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 11:06:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:33,516 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:06:33,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:06:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:06:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:06:33,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:33,517 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 11:06:33,517 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 11:06:33,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:33,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:06:33,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:35,485 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 11:06:35,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:35,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:06:35,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:06:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:06:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:06:35,487 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 11:06:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:35,589 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:06:35,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:06:35,590 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 11:06:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:35,591 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:06:35,591 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:06:35,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:06:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:06:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:06:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:06:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:06:35,594 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 11:06:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:35,594 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:06:35,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:06:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:06:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:06:35,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:35,595 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 11:06:35,595 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 11:06:35,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:35,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:06:35,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:37,918 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 11:06:37,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:37,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:06:37,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:06:37,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:06:37,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:06:37,920 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 11:06:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:38,027 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:06:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:06:38,028 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 11:06:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:38,028 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:06:38,029 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:06:38,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:06:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:06:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:06:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:06:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:06:38,032 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 11:06:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:38,032 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:06:38,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:06:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:06:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:06:38,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:38,033 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 11:06:38,033 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 11:06:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:38,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:06:38,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:40,203 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 11:06:40,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:40,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:06:40,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:06:40,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:06:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:06:40,205 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 11:06:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:40,310 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:06:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:06:40,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 11:06:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:40,311 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:06:40,311 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:06:40,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:06:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:06:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:06:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:06:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:06:40,312 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 11:06:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:40,313 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:06:40,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:06:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:06:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:06:40,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:40,313 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 11:06:40,313 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 11:06:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:40,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:06:40,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:42,758 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 11:06:42,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:42,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:06:42,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:06:42,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:06:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:06:42,759 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 11:06:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:42,865 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:06:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:06:42,865 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 11:06:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:42,866 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:06:42,866 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:06:42,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:06:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:06:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:06:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:06:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:06:42,869 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 11:06:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:42,870 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:06:42,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:06:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:06:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:06:42,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:42,871 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 11:06:42,871 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 11:06:42,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:42,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:06:42,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:45,122 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 11:06:45,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:45,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:06:45,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:06:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:06:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:06:45,124 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 11:06:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:45,826 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:06:45,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:06:45,826 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 11:06:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:45,826 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:06:45,827 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:06:45,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:06:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:06:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:06:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:06:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:06:45,828 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 11:06:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:45,829 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:06:45,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:06:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:06:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:06:45,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:45,829 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 11:06:45,829 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 11:06:45,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:45,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:06:45,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:48,339 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 11:06:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:06:48,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:06:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:06:48,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:06:48,341 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 11:06:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:48,448 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:06:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:06:48,449 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 11:06:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:48,450 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:06:48,450 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:06:48,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:06:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:06:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:06:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:06:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:06:48,453 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 11:06:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:48,453 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:06:48,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:06:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:06:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:06:48,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:48,454 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 11:06:48,455 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 11:06:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:48,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:06:48,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:50,734 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 11:06:50,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:50,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:06:50,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:06:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:06:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:06:50,736 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 11:06:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:50,853 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:06:50,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:06:50,854 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 11:06:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:50,854 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:06:50,855 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:06:50,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:06:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:06:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:06:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:06:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:06:50,857 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 11:06:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:50,857 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:06:50,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:06:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:06:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:06:50,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:50,858 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 11:06:50,858 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 11:06:50,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:50,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1555 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:06:50,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:53,806 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 11:06:53,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:53,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:06:53,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:06:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:06:53,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:06:53,808 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 11:06:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:53,925 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:06:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:06:53,925 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 11:06:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:53,926 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:06:53,926 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:06:53,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:06:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:06:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:06:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:06:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:06:53,928 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 11:06:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:53,928 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:06:53,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:06:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:06:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:06:53,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:53,929 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 11:06:53,929 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:53,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 11:06:53,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:54,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:06:54,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:56,351 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 11:06:56,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:56,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:06:56,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:06:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:06:56,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:06:56,353 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 11:06:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:56,470 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:06:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:06:56,471 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 11:06:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:56,471 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:06:56,472 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:06:56,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:06:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:06:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:06:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:06:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:06:56,474 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 11:06:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:56,474 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:06:56,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:06:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:06:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:06:56,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:56,475 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 11:06:56,475 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 11:06:56,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:56,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1593 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:06:56,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:59,266 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 11:06:59,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:59,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:06:59,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:06:59,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:06:59,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:06:59,268 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 11:06:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:59,384 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:06:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:06:59,385 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 11:06:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:59,386 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:06:59,386 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:06:59,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:06:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:06:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:06:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:06:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:06:59,389 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 11:06:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:59,389 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:06:59,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:06:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:06:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:06:59,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:59,390 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 11:06:59,390 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-08-05 11:06:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:59,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:06:59,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:01,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:01,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:07:01,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:07:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:07:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:07:01,920 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 11:07:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:02,176 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:07:02,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:07:02,177 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 11:07:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:02,178 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:07:02,178 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:07:02,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:07:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:07:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:07:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:07:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:07:02,181 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 11:07:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:02,182 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:07:02,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:07:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:07:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:07:02,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:02,182 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 11:07:02,183 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-08-05 11:07:02,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:02,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1631 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:07:02,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:04,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:04,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:07:04,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:07:04,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:07:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:07:04,999 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 11:07:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:05,119 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:07:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:07:05,119 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 11:07:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:05,120 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:07:05,120 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:07:05,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:07:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:07:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:07:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:07:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:07:05,123 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 11:07:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:05,123 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:07:05,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:07:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:07:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:07:05,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:05,124 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 11:07:05,124 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-08-05 11:07:05,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:05,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1650 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:07:05,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:07,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:07,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:07:07,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:07:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:07:07,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:07:07,999 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 11:07:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:08,188 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:07:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:07:08,188 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 11:07:08,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:08,189 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:07:08,189 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:07:08,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:07:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:07:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:07:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:07:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:07:08,193 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 11:07:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:08,193 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:07:08,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:07:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:07:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:07:08,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:08,194 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 11:07:08,194 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-08-05 11:07:08,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:08,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1669 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:07:08,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:10,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:10,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:07:10,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:07:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:07:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:07:10,931 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 11:07:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:11,069 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:07:11,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:07:11,069 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 11:07:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:11,070 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:07:11,070 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:07:11,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:07:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:07:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:07:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:07:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:07:11,072 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 11:07:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:11,072 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:07:11,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:07:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:07:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:07:11,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:11,073 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 11:07:11,073 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:11,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-08-05 11:07:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:11,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:07:11,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:14,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:07:14,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:07:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:07:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:07:14,131 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 11:07:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:14,267 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:07:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:07:14,267 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 11:07:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:14,268 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:07:14,268 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:07:14,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:07:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:07:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:07:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:07:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:07:14,270 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 11:07:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:14,270 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:07:14,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:07:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:07:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:07:14,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:14,271 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 11:07:14,271 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-08-05 11:07:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:14,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:07:14,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:17,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:17,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:07:17,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:07:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:07:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:07:17,211 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 11:07:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:17,341 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:07:17,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:07:17,341 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 11:07:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:17,342 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:07:17,342 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:07:17,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:07:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:07:17,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:07:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:07:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:07:17,344 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 11:07:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:17,344 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:07:17,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:07:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:07:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:07:17,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:17,345 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 11:07:17,346 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:17,346 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-08-05 11:07:17,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:17,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:07:17,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:20,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:20,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:07:20,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:07:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:07:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:07:20,614 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 11:07:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:20,753 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:07:20,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:07:20,754 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 11:07:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:20,754 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:07:20,755 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:07:20,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:07:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:07:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:07:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:07:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:07:20,757 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 11:07:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:20,758 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:07:20,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:07:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:07:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:07:20,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:20,759 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 11:07:20,759 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:20,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:20,759 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-08-05 11:07:20,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:20,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1745 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:07:20,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:24,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:24,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:07:24,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:07:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:07:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:07:24,015 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 11:07:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:24,164 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:07:24,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:07:24,165 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 11:07:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:24,165 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:07:24,166 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:07:24,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:07:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:07:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:07:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:07:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:07:24,169 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 11:07:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:24,169 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:07:24,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:07:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:07:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:07:24,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:24,170 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 11:07:24,170 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-08-05 11:07:24,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:24,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:07:24,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:27,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:27,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:07:27,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:07:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:07:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:07:27,287 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 11:07:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:27,431 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:07:27,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:07:27,432 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 11:07:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:27,432 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:07:27,433 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:07:27,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:07:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:07:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:07:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:07:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:07:27,436 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 11:07:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:27,436 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:07:27,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:07:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:07:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:07:27,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:27,437 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 11:07:27,437 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-08-05 11:07:27,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:27,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:07:27,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:30,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:30,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:07:30,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:07:30,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:07:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:07:30,915 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 11:07:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:31,052 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:07:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:07:31,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 11:07:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:31,053 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:07:31,053 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:07:31,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:07:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:07:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:07:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:07:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:07:31,055 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 11:07:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:31,055 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:07:31,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:07:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:07:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:07:31,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:31,056 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 11:07:31,056 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-08-05 11:07:31,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:31,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1802 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:07:31,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:34,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:34,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:07:34,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:07:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:07:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:07:34,578 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 11:07:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:34,749 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:07:34,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:07:34,750 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 11:07:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:34,751 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:07:34,751 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:07:34,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:07:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:07:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:07:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:07:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:07:34,753 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 11:07:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:34,753 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:07:34,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:07:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:07:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:07:34,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:34,754 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 11:07:34,755 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:34,755 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-08-05 11:07:34,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:34,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:07:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:38,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:38,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:07:38,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:07:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:07:38,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:07:38,966 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 11:07:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,118 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:07:39,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:07:39,119 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 11:07:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,120 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:07:39,120 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:07:39,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:07:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:07:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:07:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:07:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:07:39,121 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 11:07:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,122 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:07:39,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:07:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:07:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:07:39,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,122 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 11:07:39,122 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-08-05 11:07:39,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1840 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:42,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:42,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:07:42,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:07:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:07:42,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:07:42,493 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 11:07:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:42,644 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:07:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:07:42,644 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 11:07:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:42,645 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:07:42,645 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:07:42,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:07:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:07:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:07:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:07:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:07:42,648 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 11:07:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:42,649 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:07:42,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:07:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:07:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:07:42,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:42,650 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 11:07:42,650 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-08-05 11:07:42,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:42,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1859 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:07:42,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:07:46,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:07:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:07:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:07:46,371 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 11:07:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:46,530 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:07:46,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:07:46,530 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 11:07:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:46,531 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:07:46,531 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:07:46,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:07:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:07:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:07:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:07:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:07:46,534 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 11:07:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:46,534 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:07:46,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:07:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:07:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:07:46,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:46,535 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 11:07:46,535 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:46,536 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-08-05 11:07:46,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:46,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:07:46,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:50,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:50,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:07:50,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:07:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:07:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:07:50,382 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 11:07:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:50,546 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:07:50,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:07:50,547 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 11:07:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:50,548 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:07:50,548 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:07:50,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:07:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:07:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:07:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:07:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:07:50,550 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 11:07:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:50,550 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:07:50,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:07:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:07:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:07:50,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:50,551 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 11:07:50,551 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-08-05 11:07:50,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:50,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:07:50,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:54,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:54,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:07:54,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:07:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:07:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:07:54,487 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 11:07:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,274 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:07:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:07:55,275 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 11:07:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,276 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:07:55,276 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:07:55,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:07:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:07:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:07:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:07:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:07:55,280 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 11:07:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,280 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:07:55,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:07:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:07:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:07:55,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,281 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 11:07:55,281 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-08-05 11:07:55,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:07:59,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:07:59,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:07:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:07:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:07:59,395 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 11:07:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,573 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:07:59,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:07:59,574 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 11:07:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,574 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:07:59,574 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:07:59,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:07:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:07:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:07:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:07:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:07:59,578 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 11:07:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,578 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:07:59,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:07:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:07:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:07:59,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,579 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 11:07:59,579 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-08-05 11:07:59,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:03,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:08:03,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:08:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:08:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:08:03,340 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 11:08:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,506 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:08:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:08:03,506 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 11:08:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,507 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:08:03,508 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:08:03,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:08:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:08:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:08:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:08:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:08:03,512 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 11:08:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,512 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:08:03,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:08:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:08:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:08:03,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,513 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 11:08:03,513 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-08-05 11:08:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1954 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:07,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:07,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:08:07,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:08:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:08:07,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:08:07,455 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 11:08:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:07,633 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:08:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:08:07,634 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 11:08:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:07,635 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:08:07,635 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:08:07,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:08:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:08:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:08:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:08:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:08:07,638 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 11:08:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:07,638 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:08:07,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:08:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:08:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:08:07,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:07,639 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 11:08:07,640 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:07,640 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-08-05 11:08:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:07,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:08:07,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:11,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:11,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:08:11,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:08:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:08:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:08:11,940 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 11:08:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:12,121 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:08:12,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:08:12,122 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 11:08:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:12,122 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:08:12,122 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:08:12,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:08:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:08:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:08:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:08:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:08:12,125 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 11:08:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:12,125 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:08:12,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:08:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:08:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:08:12,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:12,126 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 11:08:12,127 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-08-05 11:08:12,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:12,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:08:12,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:16,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:16,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:08:16,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:08:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:08:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:08:16,948 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 11:08:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:17,119 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:08:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:08:17,120 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 11:08:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:17,120 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:08:17,121 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:08:17,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:08:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:08:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:08:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:08:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:08:17,124 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 11:08:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:17,125 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:08:17,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:08:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:08:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:08:17,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:17,126 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 11:08:17,126 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-08-05 11:08:17,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:17,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:08:17,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:21,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:21,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:08:21,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:08:21,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:08:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:08:21,455 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 11:08:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,637 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:08:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:08:21,637 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 11:08:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,638 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:08:21,638 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:08:21,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:08:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:08:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:08:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:08:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:08:21,641 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 11:08:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,641 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:08:21,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:08:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:08:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:08:21,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,642 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 11:08:21,642 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-08-05 11:08:21,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 2030 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:25,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:25,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:08:25,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:08:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:08:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:08:25,971 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 11:08:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:26,162 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:08:26,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:08:26,163 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 11:08:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:26,163 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:08:26,164 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:08:26,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:08:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:08:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:08:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:08:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:08:26,167 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 11:08:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:26,168 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:08:26,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:08:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:08:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:08:26,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:26,169 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 11:08:26,169 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:26,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-08-05 11:08:26,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:26,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 2049 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:08:26,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:30,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:30,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:08:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:08:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:08:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:08:30,490 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 11:08:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:30,690 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:08:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:08:30,691 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 11:08:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:30,691 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:08:30,691 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:08:30,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:08:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:08:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:08:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:08:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:08:30,694 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 11:08:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:30,695 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:08:30,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:08:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:08:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:08:30,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:30,696 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 11:08:30,696 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-08-05 11:08:30,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:30,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 2068 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:08:30,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:35,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:35,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:08:35,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:08:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:08:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:08:35,223 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 11:08:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:35,472 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:08:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:08:35,473 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 11:08:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:35,473 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:08:35,473 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:08:35,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:08:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:08:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:08:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:08:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:08:35,476 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 11:08:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:35,476 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:08:35,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:08:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:08:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:08:35,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:35,477 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 11:08:35,477 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-08-05 11:08:35,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:35,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 2087 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:08:35,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:40,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:40,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:08:40,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:08:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:08:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:08:40,122 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 11:08:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:40,301 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:08:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:08:40,301 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 11:08:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:40,302 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:08:40,302 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:08:40,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:08:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:08:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:08:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:08:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:08:40,305 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 11:08:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:40,305 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:08:40,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:08:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:08:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:08:40,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:40,306 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 11:08:40,307 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-08-05 11:08:40,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:40,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:08:40,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:45,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:45,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:08:45,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:08:45,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:08:45,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:08:45,042 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 11:08:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:45,250 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:08:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:08:45,250 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 11:08:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:45,251 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:08:45,251 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:08:45,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:08:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:08:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:08:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:08:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:08:45,253 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 11:08:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:45,254 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:08:45,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:08:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:08:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:08:45,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:45,255 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 11:08:45,255 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:45,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-08-05 11:08:45,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:45,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:08:45,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:49,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:49,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:08:49,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:08:49,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:08:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:08:49,632 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 11:08:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:49,870 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:08:49,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:08:49,871 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 11:08:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:49,871 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:08:49,871 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:08:49,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:08:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:08:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:08:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:08:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:08:49,874 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 11:08:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:49,874 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:08:49,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:08:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:08:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:08:49,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:49,875 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 11:08:49,876 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-08-05 11:08:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:50,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 2144 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:08:50,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:08:54,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:08:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:08:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:08:54,410 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 11:08:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:54,612 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:08:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:08:54,613 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 11:08:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:54,614 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:08:54,614 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:08:54,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:08:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:08:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:08:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:08:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:08:54,617 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 11:08:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:54,617 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:08:54,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:08:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:08:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:08:54,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:54,618 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 11:08:54,618 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2019-08-05 11:08:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:54,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 2163 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:08:54,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:59,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:59,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:08:59,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:08:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:08:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:08:59,423 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 11:08:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:59,637 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:08:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:08:59,638 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 11:08:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:59,638 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:08:59,638 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:08:59,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:08:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:08:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:08:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:08:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:08:59,641 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 11:08:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:59,641 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:08:59,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:08:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:08:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:08:59,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:59,641 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 11:08:59,642 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:59,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1605587820, now seen corresponding path program 113 times [2019-08-05 11:08:59,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:59,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:08:59,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:04,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:04,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:09:04,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:09:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:09:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:09:04,524 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 11:09:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:04,735 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:09:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:09:04,735 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 11:09:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:04,736 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:09:04,736 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:09:04,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:09:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:09:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:09:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:09:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:09:04,740 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 11:09:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:04,740 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:09:04,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:09:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:09:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:09:04,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:04,741 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 11:09:04,741 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1766383325, now seen corresponding path program 114 times [2019-08-05 11:09:04,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:04,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 2201 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:09:04,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:09:09,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:09:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:09:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:09:09,893 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 11:09:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:10,089 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:09:10,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:09:10,089 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 11:09:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:10,090 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:09:10,090 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:09:10,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:09:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:09:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:09:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:09:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:09:10,094 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 11:09:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:10,094 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:09:10,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:09:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:09:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:09:10,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:10,095 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 11:09:10,095 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1076693580, now seen corresponding path program 115 times [2019-08-05 11:09:10,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:10,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 2220 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:09:10,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:09:12,318 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:09:12,319 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:09:12,324 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:09:12,324 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:12 BoogieIcfgContainer [2019-08-05 11:09:12,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:12,327 INFO L168 Benchmark]: Toolchain (without parser) took 238444.71 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 112.1 MB in the beginning and 579.4 MB in the end (delta: -467.4 MB). Peak memory consumption was 761.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:12,328 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:12,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.19 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:12,329 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:12,329 INFO L168 Benchmark]: RCFGBuilder took 374.48 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 98.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:12,330 INFO L168 Benchmark]: TraceAbstraction took 238008.62 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 97.6 MB in the beginning and 579.4 MB in the end (delta: -481.8 MB). Peak memory consumption was 746.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:12,332 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.19 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.03 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 374.48 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 98.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238008.62 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 97.6 MB in the beginning and 579.4 MB in the end (delta: -481.8 MB). Peak memory consumption was 746.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 83). Cancelled while BasicCegarLoop was analyzing trace of length 119 with TraceHistMax 115,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 237.9s OverallTime, 116 OverallIterations, 115 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 345 SDtfs, 225 SDslu, 0 SDs, 0 SdLazy, 6785 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6785 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6670 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 115 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 213.5s InterpolantComputationTime, 6900 NumberOfCodeBlocks, 6900 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 6785 ConstructedInterpolants, 0 QuantifiedInterpolants, 1567565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 128570 ConjunctsInSsa, 6785 ConjunctsInUnsatCore, 115 InterpolantComputations, 1 PerfectInterpolantSequences, 0/253460 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown