java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:32,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:32,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:32,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:32,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:32,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:32,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:32,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:32,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:32,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:32,806 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:32,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:32,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:32,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:32,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:32,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:32,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:32,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:32,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:32,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:32,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:32,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:32,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:32,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:32,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:32,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:32,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:32,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:32,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:32,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:32,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:32,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:32,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:32,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:32,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:32,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:32,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:32,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:32,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:32,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:32,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:32,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:32,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:32,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:32,885 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:32,886 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:32,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl [2019-08-04 21:38:32,887 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string_concat-noarr.i_3.bpl' [2019-08-04 21:38:32,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:32,940 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:32,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:32,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:32,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:32,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:32,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:32,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:32,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:32,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... [2019-08-04 21:38:32,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:33,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:33,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:33,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:33,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:38:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:33,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:33,347 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:33,347 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-04 21:38:33,348 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:33 BoogieIcfgContainer [2019-08-04 21:38:33,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:33,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:33,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:33,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:33,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:32" (1/2) ... [2019-08-04 21:38:33,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3029c8c0 and model type string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:33, skipping insertion in model container [2019-08-04 21:38:33,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:33" (2/2) ... [2019-08-04 21:38:33,362 INFO L109 eAbstractionObserver]: Analyzing ICFG string_concat-noarr.i_3.bpl [2019-08-04 21:38:33,372 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:33,378 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:33,394 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:33,423 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:33,423 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:33,423 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:33,424 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:33,424 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:33,424 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:33,424 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:33,424 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:33,425 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-04 21:38:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:33,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:33,449 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-08-04 21:38:33,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:33,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:33,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:33,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:33,629 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-04 21:38:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,666 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:38:33,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:33,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-04 21:38:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,680 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:33,681 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:33,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:38:33,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-04 21:38:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,740 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:38:33,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:38:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:33,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,743 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-04 21:38:33,744 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-08-04 21:38:33,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:33,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:33,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:33,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:33,890 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-04 21:38:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,924 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:38:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:33,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-04 21:38:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,925 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:33,925 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:33,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:38:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:38:33,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-04 21:38:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,931 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:38:33,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:38:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:33,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,934 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-04 21:38:33,935 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-08-04 21:38:33,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:34,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:34,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:34,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:34,078 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-04 21:38:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,120 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:38:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:34,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-04 21:38:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,122 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:38:34,122 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:38:34,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:38:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:38:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:38:34,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-04 21:38:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,127 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:38:34,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:38:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:34,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,128 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-04 21:38:34,128 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2019-08-04 21:38:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:34,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:34,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:34,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:34,273 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2019-08-04 21:38:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,317 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:38:34,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:34,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-04 21:38:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,331 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:34,332 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:34,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:38:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:38:34,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-04 21:38:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,339 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:38:34,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:38:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:34,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,340 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-04 21:38:34,341 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2019-08-04 21:38:34,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:34,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:34,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:34,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:34,522 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2019-08-04 21:38:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,550 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:38:34,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:34,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-04 21:38:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,551 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:38:34,552 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:38:34,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-04 21:38:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:38:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:38:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:38:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:38:34,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-04 21:38:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,556 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:38:34,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:38:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:38:34,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,557 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-04 21:38:34,558 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2019-08-04 21:38:34,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:34,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:34,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:34,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:34,907 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-08-04 21:38:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:34,959 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:38:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:34,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-04 21:38:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:34,960 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:38:34,961 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:38:34,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-04 21:38:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:38:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:38:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:38:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:38:34,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-04 21:38:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:34,966 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:38:34,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:38:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:38:34,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:34,967 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-04 21:38:34,967 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2019-08-04 21:38:34,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:34,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:38:34,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:35,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:35,232 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2019-08-04 21:38:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:35,285 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:38:35,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:35,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-04 21:38:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:35,286 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:38:35,287 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:38:35,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:38:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:38:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:38:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:38:35,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-04 21:38:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:35,290 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:38:35,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:38:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:38:35,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:35,291 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-04 21:38:35,292 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2019-08-04 21:38:35,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:35,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:38:35,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:35,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:35,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:35,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:35,484 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-08-04 21:38:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:35,520 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:38:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:35,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-04 21:38:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:35,521 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:38:35,522 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:38:35,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:38:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:38:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:38:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:38:35,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-04 21:38:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:35,527 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:38:35,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:38:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:38:35,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:35,528 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-04 21:38:35,528 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2019-08-04 21:38:35,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:35,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:38:35,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:36,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:36,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:38:36,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:36,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:36,107 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2019-08-04 21:38:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:36,176 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:38:36,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:38:36,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-04 21:38:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:36,178 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:38:36,178 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:38:36,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:38:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:38:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:38:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:38:36,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-04 21:38:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:36,182 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:38:36,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:38:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:38:36,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:36,183 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-04 21:38:36,183 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2019-08-04 21:38:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:36,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:38:36,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:36,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:36,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:38:36,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:38:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:38:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:36,525 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2019-08-04 21:38:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:36,579 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:38:36,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:38:36,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-04 21:38:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:36,580 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:38:36,580 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:38:36,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:38:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:38:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:38:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:38:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:38:36,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-04 21:38:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:36,585 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:38:36,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:38:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:38:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:38:36,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:36,586 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-04 21:38:36,586 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:36,586 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2019-08-04 21:38:36,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:36,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:38:36,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:38:36,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:38:36,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:38:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:36,824 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-08-04 21:38:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:36,872 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:38:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:38:36,873 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-04 21:38:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:36,873 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:38:36,874 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:38:36,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:38:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:38:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:38:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:38:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:38:36,877 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-04 21:38:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:36,878 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:38:36,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:38:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:38:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:38:36,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:36,879 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-04 21:38:36,879 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2019-08-04 21:38:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:36,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:38:36,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:37,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:37,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:38:37,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:38:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:38:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:37,201 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-08-04 21:38:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:37,232 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:38:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:38:37,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-08-04 21:38:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:37,234 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:38:37,235 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:38:37,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:38:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:38:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:38:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:38:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:38:37,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-04 21:38:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:37,240 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:38:37,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:38:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:38:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:38:37,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:37,241 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-04 21:38:37,241 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2019-08-04 21:38:37,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:37,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:38:37,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:37,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:37,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:38:37,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:38:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:38:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:37,499 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-08-04 21:38:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:37,641 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:38:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:38:37,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-08-04 21:38:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:37,642 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:38:37,642 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:38:37,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:38:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:38:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:38:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:38:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:38:37,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-04 21:38:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:37,647 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:38:37,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:38:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:38:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:38:37,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:37,648 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-04 21:38:37,648 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2019-08-04 21:38:37,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:37,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:38:37,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:38,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:38:38,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:38:38,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:38:38,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:38:38,023 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-08-04 21:38:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,060 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:38:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:38:38,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-08-04 21:38:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,062 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:38:38,062 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:38:38,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:38:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:38:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:38:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:38:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:38:38,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-04 21:38:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,068 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:38:38,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:38:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:38:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:38:38,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,069 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-04 21:38:38,069 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2019-08-04 21:38:38,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:38,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:38:38,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:38:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:38:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:38,326 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2019-08-04 21:38:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,378 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:38:38,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:38:38,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-08-04 21:38:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,379 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:38:38,380 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:38:38,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:38:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:38:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:38:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:38:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:38:38,384 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-04 21:38:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,384 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:38:38,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:38:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:38:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:38:38,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,385 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-04 21:38:38,385 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2019-08-04 21:38:38,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:38,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:38,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:38:38,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:38:38,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:38:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:38:38,673 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2019-08-04 21:38:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,705 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:38:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:38:38,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-08-04 21:38:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,706 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:38:38,706 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:38:38,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:38:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:38:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:38:38,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:38:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:38:38,709 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-04 21:38:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,710 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:38:38,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:38:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:38:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:38:38,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,711 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-04 21:38:38,711 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2019-08-04 21:38:38,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:38:39,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:38:39,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:38:39,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:38:39,243 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2019-08-04 21:38:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:39,279 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:38:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:38:39,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-08-04 21:38:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:39,281 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:38:39,281 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:38:39,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:38:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:38:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:38:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:38:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:38:39,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-04 21:38:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:39,286 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:38:39,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:38:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:38:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:38:39,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:39,287 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-04 21:38:39,287 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2019-08-04 21:38:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:39,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:38:39,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:39,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:39,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:38:39,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:38:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:38:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:39,744 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2019-08-04 21:38:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:39,949 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:38:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:38:39,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-08-04 21:38:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:39,950 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:38:39,950 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:38:39,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:38:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:38:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:38:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:38:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:38:39,955 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-04 21:38:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:39,956 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:38:39,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:38:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:38:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:38:39,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:39,957 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-04 21:38:39,957 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:39,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2019-08-04 21:38:39,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:39,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:38:39,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:40,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:40,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:38:40,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:38:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:38:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:38:40,493 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2019-08-04 21:38:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,523 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:38:40,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:38:40,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-08-04 21:38:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,524 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:38:40,524 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:38:40,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:38:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:38:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:38:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:38:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:38:40,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-04 21:38:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,529 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:38:40,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:38:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:38:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:38:40,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,530 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-04 21:38:40,530 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2019-08-04 21:38:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:40,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:40,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:38:40,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:38:40,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:38:40,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:38:40,781 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2019-08-04 21:38:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,820 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:38:40,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:38:40,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-08-04 21:38:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,822 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:38:40,822 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:38:40,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:38:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:38:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:38:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:38:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:38:40,827 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-04 21:38:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,827 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:38:40,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:38:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:38:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:38:40,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,828 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-04 21:38:40,829 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2019-08-04 21:38:40,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:41,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:38:41,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:38:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:38:41,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:38:41,115 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2019-08-04 21:38:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,198 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:38:41,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:38:41,199 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-08-04 21:38:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,200 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:38:41,200 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:38:41,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:38:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:38:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:38:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:38:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:38:41,205 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-04 21:38:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,206 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:38:41,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:38:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:38:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:38:41,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,207 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-04 21:38:41,207 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2019-08-04 21:38:41,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:41,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:38:41,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:38:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:38:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:38:41,876 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2019-08-04 21:38:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,014 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:38:42,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:38:42,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-08-04 21:38:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,016 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:38:42,016 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:38:42,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:38:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:38:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:38:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:38:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:38:42,020 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-04 21:38:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,020 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:38:42,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:38:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:38:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:38:42,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,021 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-04 21:38:42,021 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,022 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2019-08-04 21:38:42,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:42,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:38:42,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:38:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:38:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:38:42,431 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2019-08-04 21:38:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,526 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:38:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:38:42,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-08-04 21:38:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,528 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:38:42,528 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:38:42,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:38:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:38:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:38:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:38:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:38:42,532 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-04 21:38:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,532 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:38:42,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:38:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:38:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:38:42,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,533 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-04 21:38:42,533 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2019-08-04 21:38:42,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:38:42,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:38:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:38:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:38:42,982 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2019-08-04 21:38:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,017 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:38:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:38:43,018 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-08-04 21:38:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,019 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:38:43,019 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:38:43,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:38:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:38:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:38:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:38:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:38:43,023 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-04 21:38:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,023 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:38:43,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:38:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:38:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:38:43,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,024 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-04 21:38:43,025 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2019-08-04 21:38:43,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:43,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:43,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:38:43,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:38:43,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:38:43,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:38:43,546 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2019-08-04 21:38:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,584 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:38:43,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:38:43,585 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-04 21:38:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,586 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:38:43,586 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:38:43,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:38:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:38:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:38:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:38:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:38:43,589 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-04 21:38:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,590 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:38:43,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:38:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:38:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:38:43,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,590 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-04 21:38:43,591 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2019-08-04 21:38:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:44,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:38:44,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:38:44,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:38:44,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:38:44,107 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2019-08-04 21:38:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:44,157 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:38:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:38:44,158 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-08-04 21:38:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:44,159 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:38:44,159 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:38:44,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:38:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:38:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:38:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:38:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:38:44,163 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-04 21:38:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:44,163 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:38:44,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:38:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:38:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:38:44,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:44,164 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-04 21:38:44,164 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2019-08-04 21:38:44,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:44,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:38:44,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:45,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:45,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:38:45,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:38:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:38:45,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:38:45,431 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2019-08-04 21:38:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:45,465 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:38:45,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:38:45,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-08-04 21:38:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:45,466 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:38:45,467 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:38:45,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:38:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:38:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:38:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:38:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:38:45,470 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-04 21:38:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:45,470 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:38:45,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:38:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:38:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:38:45,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:45,471 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-04 21:38:45,472 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:45,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2019-08-04 21:38:45,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:45,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:38:45,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:45,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:45,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:38:45,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:38:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:38:45,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:38:45,882 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2019-08-04 21:38:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:45,917 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:38:45,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:38:45,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-08-04 21:38:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:45,918 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:38:45,918 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:38:45,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:38:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:38:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:38:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:38:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:38:45,922 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-04 21:38:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:45,923 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:38:45,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:38:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:38:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:38:45,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:45,924 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-04 21:38:45,924 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2019-08-04 21:38:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:45,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:38:45,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:46,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:38:46,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:38:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:38:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:38:46,346 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2019-08-04 21:38:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:46,404 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:38:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:38:46,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-08-04 21:38:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:46,405 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:38:46,405 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:38:46,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:38:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:38:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:38:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:38:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:38:46,409 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-04 21:38:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:46,409 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:38:46,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:38:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:38:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:38:46,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,410 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-04 21:38:46,410 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2019-08-04 21:38:46,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:46,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:38:46,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:38:47,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:38:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:38:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:38:47,141 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2019-08-04 21:38:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,239 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:38:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:38:47,239 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-08-04 21:38:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,240 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:38:47,240 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:38:47,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:38:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:38:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:38:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:38:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:38:47,244 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-04 21:38:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,244 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:38:47,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:38:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:38:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:38:47,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,245 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-04 21:38:47,245 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2019-08-04 21:38:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:38:47,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:38:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:38:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:38:47,848 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2019-08-04 21:38:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,959 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:38:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:38:47,959 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-08-04 21:38:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,960 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:38:47,960 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:38:47,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:38:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:38:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:38:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:38:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:38:47,964 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-04 21:38:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,964 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:38:47,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:38:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:38:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:38:47,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,965 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-04 21:38:47,965 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2019-08-04 21:38:47,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:48,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:48,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:38:48,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:38:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:38:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:38:48,511 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2019-08-04 21:38:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:48,686 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:38:48,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:38:48,687 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-08-04 21:38:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:48,687 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:38:48,688 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:38:48,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:38:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:38:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:38:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:38:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:38:48,691 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-04 21:38:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:48,691 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:38:48,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:38:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:38:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:38:48,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:48,692 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-04 21:38:48,692 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2019-08-04 21:38:48,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:48,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:38:48,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:49,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:49,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:38:49,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:38:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:38:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:38:49,181 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2019-08-04 21:38:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,231 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:38:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:38:49,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-08-04 21:38:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,233 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:38:49,233 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:38:49,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:38:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:38:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:38:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:38:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:38:49,237 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-04 21:38:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,237 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:38:49,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:38:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:38:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:38:49,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,238 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-04 21:38:49,238 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2019-08-04 21:38:49,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:49,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:49,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:38:49,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:38:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:38:49,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:38:49,845 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2019-08-04 21:38:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:49,896 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:38:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:38:49,897 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-08-04 21:38:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:49,898 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:38:49,898 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:38:49,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:38:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:38:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:38:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:38:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:38:49,901 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-04 21:38:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:49,902 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:38:49,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:38:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:38:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:38:49,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:49,903 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-04 21:38:49,903 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2019-08-04 21:38:49,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:49,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:38:49,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:50,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:50,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:38:50,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:38:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:38:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:38:50,515 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2019-08-04 21:38:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:50,635 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:38:50,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:38:50,636 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-08-04 21:38:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:50,637 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:38:50,637 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:38:50,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:38:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:38:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:38:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:38:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:38:50,643 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-04 21:38:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:50,643 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:38:50,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:38:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:38:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:38:50,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:50,644 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-04 21:38:50,644 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:50,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:50,644 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2019-08-04 21:38:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:50,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:38:50,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:52,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:52,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:38:52,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:38:52,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:38:52,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:38:52,665 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2019-08-04 21:38:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:52,710 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:38:52,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:38:52,710 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-08-04 21:38:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:52,711 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:38:52,712 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:38:52,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:38:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:38:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:38:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:38:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:38:52,715 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-04 21:38:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:52,715 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:38:52,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:38:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:38:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:38:52,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:52,716 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-04 21:38:52,716 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:52,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2019-08-04 21:38:52,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:52,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:38:52,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:53,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:53,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:38:53,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:38:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:38:53,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:38:53,496 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2019-08-04 21:38:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:53,549 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:38:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:38:53,549 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-08-04 21:38:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:53,550 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:38:53,550 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:38:53,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:38:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:38:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:38:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:38:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:38:53,554 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-04 21:38:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:53,554 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:38:53,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:38:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:38:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:38:53,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:53,555 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-04 21:38:53,555 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2019-08-04 21:38:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:53,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:38:53,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:54,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:38:54,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:38:54,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:38:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:38:54,435 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2019-08-04 21:38:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:54,486 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:38:54,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:38:54,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-08-04 21:38:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:54,487 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:38:54,487 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:38:54,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:38:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:38:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:38:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:38:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:38:54,491 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-04 21:38:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:54,492 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:38:54,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:38:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:38:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:38:54,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:54,493 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-04 21:38:54,493 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2019-08-04 21:38:54,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:54,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:38:54,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:55,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:55,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:38:55,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:38:55,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:38:55,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:38:55,165 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2019-08-04 21:38:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:55,259 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:38:55,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:38:55,260 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-08-04 21:38:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:55,261 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:38:55,261 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:38:55,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 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-04 21:38:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:38:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:38:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:38:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:38:55,264 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-04 21:38:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:55,264 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:38:55,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:38:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:38:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:38:55,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,265 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-04 21:38:55,265 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2019-08-04 21:38:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:55,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:55,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:38:55,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:38:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:38:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:38:55,953 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2019-08-04 21:38:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,038 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:38:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:38:56,039 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-08-04 21:38:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,040 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:38:56,040 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:38:56,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:38:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:38:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:38:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:38:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:38:56,044 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-04 21:38:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,044 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:38:56,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:38:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:38:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:38:56,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,045 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-04 21:38:56,045 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2019-08-04 21:38:56,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:56,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:38:56,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:38:56,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:38:56,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:38:56,722 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2019-08-04 21:38:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,813 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-04 21:38:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:38:56,813 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-08-04 21:38:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,814 INFO L225 Difference]: With dead ends: 87 [2019-08-04 21:38:56,814 INFO L226 Difference]: Without dead ends: 87 [2019-08-04 21:38:56,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:38:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-04 21:38:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-04 21:38:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-04 21:38:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-04 21:38:56,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-04 21:38:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,818 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-04 21:38:56,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:38:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-04 21:38:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-04 21:38:56,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,818 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-04 21:38:56,819 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2019-08-04 21:38:56,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:38:57,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:38:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:38:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:38:57,664 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2019-08-04 21:38:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,713 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-04 21:38:57,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:38:57,714 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-08-04 21:38:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,715 INFO L225 Difference]: With dead ends: 89 [2019-08-04 21:38:57,715 INFO L226 Difference]: Without dead ends: 89 [2019-08-04 21:38:57,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:38:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-04 21:38:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-04 21:38:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-04 21:38:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-04 21:38:57,718 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-04 21:38:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,719 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-04 21:38:57,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:38:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-04 21:38:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-04 21:38:57,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,719 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-04 21:38:57,719 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2019-08-04 21:38:57,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:58,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:58,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:38:58,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:38:58,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:38:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:38:58,426 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2019-08-04 21:38:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,490 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-04 21:38:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:38:58,491 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-08-04 21:38:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,492 INFO L225 Difference]: With dead ends: 91 [2019-08-04 21:38:58,492 INFO L226 Difference]: Without dead ends: 91 [2019-08-04 21:38:58,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:38:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-04 21:38:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-04 21:38:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-04 21:38:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-04 21:38:58,496 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-04 21:38:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,496 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-04 21:38:58,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:38:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-04 21:38:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:38:58,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,497 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-04 21:38:58,497 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2019-08-04 21:38:58,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:58,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:38:58,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:38:59,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:38:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:38:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:38:59,789 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2019-08-04 21:38:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:59,844 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-04 21:38:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:38:59,845 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-08-04 21:38:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:59,846 INFO L225 Difference]: With dead ends: 93 [2019-08-04 21:38:59,846 INFO L226 Difference]: Without dead ends: 93 [2019-08-04 21:38:59,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:38:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-04 21:38:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-04 21:38:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:38:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-04 21:38:59,850 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-04 21:38:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:59,850 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-04 21:38:59,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:38:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-04 21:38:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-04 21:38:59,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:59,851 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-04 21:38:59,851 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2019-08-04 21:38:59,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:00,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:00,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:39:00,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:39:00,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:39:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:00,839 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2019-08-04 21:39:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,178 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-04 21:39:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:39:01,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-08-04 21:39:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,179 INFO L225 Difference]: With dead ends: 95 [2019-08-04 21:39:01,180 INFO L226 Difference]: Without dead ends: 95 [2019-08-04 21:39:01,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:39:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-04 21:39:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-04 21:39:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-04 21:39:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-04 21:39:01,182 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-04 21:39:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,182 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-04 21:39:01,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:39:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-04 21:39:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-04 21:39:01,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,183 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-04 21:39:01,183 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2019-08-04 21:39:01,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:02,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:02,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:39:02,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:39:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:39:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:39:02,452 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2019-08-04 21:39:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:02,510 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-04 21:39:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:39:02,511 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-08-04 21:39:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:02,512 INFO L225 Difference]: With dead ends: 97 [2019-08-04 21:39:02,512 INFO L226 Difference]: Without dead ends: 97 [2019-08-04 21:39:02,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:39:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-04 21:39:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-04 21:39:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-04 21:39:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-04 21:39:02,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-04 21:39:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:02,516 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-04 21:39:02,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:39:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-04 21:39:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-04 21:39:02,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:02,516 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-04 21:39:02,517 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2019-08-04 21:39:02,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:02,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:39:02,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:03,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:03,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:39:03,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:39:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:39:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:39:03,692 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2019-08-04 21:39:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:03,750 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-04 21:39:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:39:03,751 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-08-04 21:39:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:03,752 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:39:03,752 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:39:03,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:39:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:39:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-04 21:39:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:39:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-04 21:39:03,755 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-04 21:39:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:03,755 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-04 21:39:03,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:39:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-04 21:39:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-04 21:39:03,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:03,756 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-04 21:39:03,756 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2019-08-04 21:39:03,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:03,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:39:03,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:04,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:39:04,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:39:04,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:39:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:39:04,678 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2019-08-04 21:39:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,742 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-04 21:39:04,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:39:04,743 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-08-04 21:39:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,744 INFO L225 Difference]: With dead ends: 101 [2019-08-04 21:39:04,744 INFO L226 Difference]: Without dead ends: 101 [2019-08-04 21:39:04,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:39:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-04 21:39:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-04 21:39:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-04 21:39:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-04 21:39:04,748 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-04 21:39:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,748 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-04 21:39:04,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:39:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-04 21:39:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-04 21:39:04,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,749 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-04 21:39:04,749 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2019-08-04 21:39:04,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:05,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:39:05,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:39:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:39:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:39:05,726 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2019-08-04 21:39:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:05,787 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-04 21:39:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:39:05,788 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-08-04 21:39:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:05,789 INFO L225 Difference]: With dead ends: 103 [2019-08-04 21:39:05,789 INFO L226 Difference]: Without dead ends: 103 [2019-08-04 21:39:05,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:39:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-04 21:39:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-04 21:39:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-04 21:39:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-04 21:39:05,792 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-04 21:39:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:05,793 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-04 21:39:05,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:39:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-04 21:39:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-04 21:39:05,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:05,793 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-04 21:39:05,794 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2019-08-04 21:39:05,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:05,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:39:05,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:07,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:07,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:39:07,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:39:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:39:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:39:07,106 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2019-08-04 21:39:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:07,233 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-04 21:39:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:39:07,234 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-08-04 21:39:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:07,235 INFO L225 Difference]: With dead ends: 105 [2019-08-04 21:39:07,235 INFO L226 Difference]: Without dead ends: 105 [2019-08-04 21:39:07,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:39:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-04 21:39:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-04 21:39:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-04 21:39:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-04 21:39:07,238 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-04 21:39:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:07,238 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-04 21:39:07,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:39:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-04 21:39:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-04 21:39:07,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:07,239 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-04 21:39:07,239 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:07,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2019-08-04 21:39:07,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:07,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:39:07,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:08,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:08,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:39:08,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:39:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:39:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:39:08,313 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2019-08-04 21:39:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:08,449 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-04 21:39:08,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:39:08,450 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-08-04 21:39:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:08,452 INFO L225 Difference]: With dead ends: 107 [2019-08-04 21:39:08,452 INFO L226 Difference]: Without dead ends: 107 [2019-08-04 21:39:08,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:39:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-04 21:39:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-04 21:39:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-04 21:39:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-04 21:39:08,455 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-04 21:39:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:08,456 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-04 21:39:08,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:39:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-04 21:39:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-04 21:39:08,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:08,457 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-04 21:39:08,457 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2019-08-04 21:39:08,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:08,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:39:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:09,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:09,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:39:09,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:39:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:39:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:39:09,962 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2019-08-04 21:39:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:10,060 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-04 21:39:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:39:10,060 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-08-04 21:39:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:10,061 INFO L225 Difference]: With dead ends: 109 [2019-08-04 21:39:10,061 INFO L226 Difference]: Without dead ends: 109 [2019-08-04 21:39:10,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:39:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-04 21:39:10,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-04 21:39:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-04 21:39:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-04 21:39:10,066 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-04 21:39:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:10,066 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-04 21:39:10,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:39:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-04 21:39:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-04 21:39:10,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:10,067 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-04 21:39:10,067 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2019-08-04 21:39:10,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:10,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:39:10,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:11,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:39:11,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:39:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:39:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:39:11,404 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2019-08-04 21:39:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:11,476 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-04 21:39:11,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:39:11,477 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-08-04 21:39:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:11,478 INFO L225 Difference]: With dead ends: 111 [2019-08-04 21:39:11,478 INFO L226 Difference]: Without dead ends: 111 [2019-08-04 21:39:11,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:39:11,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-04 21:39:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-04 21:39:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-04 21:39:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-04 21:39:11,482 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-04 21:39:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:11,482 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-04 21:39:11,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:39:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-04 21:39:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-04 21:39:11,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:11,483 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-04 21:39:11,483 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:11,484 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2019-08-04 21:39:11,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:11,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:39:11,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:13,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:13,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:39:13,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:39:13,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:39:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:39:13,032 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2019-08-04 21:39:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:13,097 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-04 21:39:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:39:13,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-08-04 21:39:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:13,099 INFO L225 Difference]: With dead ends: 113 [2019-08-04 21:39:13,099 INFO L226 Difference]: Without dead ends: 113 [2019-08-04 21:39:13,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:39:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-04 21:39:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-04 21:39:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-04 21:39:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-04 21:39:13,102 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-04 21:39:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:13,103 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-04 21:39:13,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:39:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-04 21:39:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-04 21:39:13,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:13,104 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-04 21:39:13,104 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2019-08-04 21:39:13,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:13,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:39:13,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:14,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:14,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:39:14,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:39:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:39:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:39:14,508 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2019-08-04 21:39:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:14,672 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-04 21:39:14,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:39:14,673 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-08-04 21:39:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:14,674 INFO L225 Difference]: With dead ends: 115 [2019-08-04 21:39:14,674 INFO L226 Difference]: Without dead ends: 115 [2019-08-04 21:39:14,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:39:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-04 21:39:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-04 21:39:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-04 21:39:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-04 21:39:14,678 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-04 21:39:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:14,678 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-04 21:39:14,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:39:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-04 21:39:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-04 21:39:14,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:14,679 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-04 21:39:14,679 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:14,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2019-08-04 21:39:14,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:14,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:39:14,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:15,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:15,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:39:15,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:39:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:39:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:39:15,812 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2019-08-04 21:39:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:15,883 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-04 21:39:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:39:15,884 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-08-04 21:39:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:15,885 INFO L225 Difference]: With dead ends: 117 [2019-08-04 21:39:15,885 INFO L226 Difference]: Without dead ends: 117 [2019-08-04 21:39:15,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:39:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-04 21:39:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-04 21:39:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:39:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-04 21:39:15,888 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-04 21:39:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:15,889 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-04 21:39:15,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:39:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-04 21:39:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-04 21:39:15,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:15,890 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-04 21:39:15,890 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2019-08-04 21:39:15,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:15,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:39:15,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:17,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:17,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:39:17,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:39:17,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:39:17,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:39:17,144 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2019-08-04 21:39:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:17,239 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-04 21:39:17,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:39:17,240 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-08-04 21:39:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:17,240 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:39:17,241 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:39:17,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:39:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:39:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-04 21:39:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-04 21:39:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-04 21:39:17,242 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-04 21:39:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:17,243 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-04 21:39:17,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:39:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-04 21:39:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-04 21:39:17,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:17,243 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-04 21:39:17,243 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2019-08-04 21:39:17,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:17,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:39:17,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:20,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:39:20,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:39:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:39:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:39:20,279 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2019-08-04 21:39:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:20,362 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-04 21:39:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:39:20,363 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-08-04 21:39:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:20,364 INFO L225 Difference]: With dead ends: 121 [2019-08-04 21:39:20,364 INFO L226 Difference]: Without dead ends: 121 [2019-08-04 21:39:20,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:39:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-04 21:39:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-04 21:39:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:39:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-04 21:39:20,367 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-04 21:39:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:20,367 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-04 21:39:20,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:39:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-04 21:39:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-04 21:39:20,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,368 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-04 21:39:20,368 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2019-08-04 21:39:20,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:21,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:21,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:39:21,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:39:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:39:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:39:21,663 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2019-08-04 21:39:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:21,733 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-04 21:39:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:39:21,733 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-08-04 21:39:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:21,734 INFO L225 Difference]: With dead ends: 123 [2019-08-04 21:39:21,734 INFO L226 Difference]: Without dead ends: 123 [2019-08-04 21:39:21,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 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-04 21:39:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-04 21:39:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-04 21:39:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-04 21:39:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-04 21:39:21,738 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-04 21:39:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:21,738 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-04 21:39:21,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:39:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-04 21:39:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-04 21:39:21,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:21,739 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-04 21:39:21,739 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:21,740 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2019-08-04 21:39:21,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:21,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:39:21,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:23,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:39:23,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:39:23,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:39:23,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:39:23,470 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2019-08-04 21:39:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:23,655 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-04 21:39:23,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:39:23,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-08-04 21:39:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:23,657 INFO L225 Difference]: With dead ends: 125 [2019-08-04 21:39:23,657 INFO L226 Difference]: Without dead ends: 125 [2019-08-04 21:39:23,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:39:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-04 21:39:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-04 21:39:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-04 21:39:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-04 21:39:23,661 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-04 21:39:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:23,662 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-04 21:39:23,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:39:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-04 21:39:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-04 21:39:23,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:23,663 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-04 21:39:23,663 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2019-08-04 21:39:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:23,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:39:23,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:25,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:25,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:39:25,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:39:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:39:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:39:25,082 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2019-08-04 21:39:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:25,158 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-04 21:39:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:39:25,159 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-08-04 21:39:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:25,160 INFO L225 Difference]: With dead ends: 127 [2019-08-04 21:39:25,160 INFO L226 Difference]: Without dead ends: 127 [2019-08-04 21:39:25,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:39:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-04 21:39:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-08-04 21:39:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-04 21:39:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-04 21:39:25,163 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-04 21:39:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:25,164 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-04 21:39:25,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:39:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-04 21:39:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-04 21:39:25,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:25,164 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-04 21:39:25,165 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:25,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2019-08-04 21:39:25,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:25,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:39:25,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:26,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:26,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:39:26,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:39:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:39:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:39:26,558 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2019-08-04 21:39:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:26,637 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-04 21:39:26,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:39:26,638 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-08-04 21:39:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:26,638 INFO L225 Difference]: With dead ends: 129 [2019-08-04 21:39:26,638 INFO L226 Difference]: Without dead ends: 129 [2019-08-04 21:39:26,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 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-04 21:39:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-04 21:39:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-08-04 21:39:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-04 21:39:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-04 21:39:26,641 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-04 21:39:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:26,642 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-04 21:39:26,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:39:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-04 21:39:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-04 21:39:26,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:26,643 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-04 21:39:26,643 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:26,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2019-08-04 21:39:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:26,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-04 21:39:26,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:28,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:28,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:39:28,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:39:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:39:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:39:28,381 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2019-08-04 21:39:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:28,465 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-04 21:39:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:39:28,466 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-08-04 21:39:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:28,467 INFO L225 Difference]: With dead ends: 131 [2019-08-04 21:39:28,467 INFO L226 Difference]: Without dead ends: 131 [2019-08-04 21:39:28,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:39:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-04 21:39:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-08-04 21:39:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-08-04 21:39:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-08-04 21:39:28,470 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-08-04 21:39:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:28,470 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-08-04 21:39:28,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:39:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-08-04 21:39:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-08-04 21:39:28,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:28,471 INFO L399 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2019-08-04 21:39:28,472 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2019-08-04 21:39:28,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:28,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:39:28,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:39:30,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:39:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:39:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:39:30,004 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2019-08-04 21:39:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:30,138 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-04 21:39:30,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:39:30,139 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-08-04 21:39:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:30,140 INFO L225 Difference]: With dead ends: 133 [2019-08-04 21:39:30,140 INFO L226 Difference]: Without dead ends: 133 [2019-08-04 21:39:30,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 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-04 21:39:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-04 21:39:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-04 21:39:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-04 21:39:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-04 21:39:30,146 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-08-04 21:39:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:30,146 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-04 21:39:30,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:39:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-04 21:39:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-04 21:39:30,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:30,147 INFO L399 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2019-08-04 21:39:30,148 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2019-08-04 21:39:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:30,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-04 21:39:30,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:31,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:31,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:39:31,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:39:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:39:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:39:31,796 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2019-08-04 21:39:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:31,883 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-04 21:39:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:39:31,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-08-04 21:39:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:31,884 INFO L225 Difference]: With dead ends: 135 [2019-08-04 21:39:31,884 INFO L226 Difference]: Without dead ends: 135 [2019-08-04 21:39:31,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:39:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-04 21:39:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-08-04 21:39:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-04 21:39:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-08-04 21:39:31,888 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-08-04 21:39:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:31,889 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-08-04 21:39:31,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:39:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-08-04 21:39:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-04 21:39:31,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:31,890 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2019-08-04 21:39:31,890 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:31,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2019-08-04 21:39:31,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:31,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:39:31,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:33,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:33,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:39:33,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:39:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:39:33,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:39:33,873 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2019-08-04 21:39:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:33,979 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-04 21:39:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:39:33,979 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-08-04 21:39:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:33,980 INFO L225 Difference]: With dead ends: 137 [2019-08-04 21:39:33,981 INFO L226 Difference]: Without dead ends: 137 [2019-08-04 21:39:33,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:39:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-04 21:39:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-04 21:39:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-04 21:39:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-04 21:39:33,983 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-08-04 21:39:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:33,984 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-04 21:39:33,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:39:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-04 21:39:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-04 21:39:33,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:33,984 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2019-08-04 21:39:33,985 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2019-08-04 21:39:33,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:34,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:39:34,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:35,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:39:35,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:39:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:39:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:39:35,803 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2019-08-04 21:39:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:36,109 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-04 21:39:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:39:36,110 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-08-04 21:39:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:36,111 INFO L225 Difference]: With dead ends: 139 [2019-08-04 21:39:36,111 INFO L226 Difference]: Without dead ends: 139 [2019-08-04 21:39:36,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:39:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-04 21:39:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-08-04 21:39:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-04 21:39:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-08-04 21:39:36,115 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-08-04 21:39:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:36,115 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-08-04 21:39:36,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:39:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-08-04 21:39:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-04 21:39:36,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:36,116 INFO L399 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2019-08-04 21:39:36,116 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2019-08-04 21:39:36,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:36,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:39:36,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:38,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:38,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:39:38,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:39:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:39:38,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:39:38,001 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2019-08-04 21:39:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:38,159 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-04 21:39:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:39:38,159 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-08-04 21:39:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:38,161 INFO L225 Difference]: With dead ends: 141 [2019-08-04 21:39:38,161 INFO L226 Difference]: Without dead ends: 141 [2019-08-04 21:39:38,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:39:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-04 21:39:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-04 21:39:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-04 21:39:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-04 21:39:38,164 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-08-04 21:39:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:38,164 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-04 21:39:38,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:39:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-04 21:39:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-04 21:39:38,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:38,165 INFO L399 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2019-08-04 21:39:38,166 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2019-08-04 21:39:38,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:38,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-04 21:39:38,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:39,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:39,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:39:39,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:39:39,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:39:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:39:39,928 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2019-08-04 21:39:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:40,016 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-04 21:39:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:39:40,017 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-08-04 21:39:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:40,018 INFO L225 Difference]: With dead ends: 143 [2019-08-04 21:39:40,018 INFO L226 Difference]: Without dead ends: 143 [2019-08-04 21:39:40,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:39:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-04 21:39:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-08-04 21:39:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-04 21:39:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-08-04 21:39:40,022 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-08-04 21:39:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:40,022 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-08-04 21:39:40,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:39:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-08-04 21:39:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-04 21:39:40,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:40,022 INFO L399 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2019-08-04 21:39:40,023 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2019-08-04 21:39:40,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:40,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:39:40,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:41,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:41,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:39:41,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:39:41,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:39:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:39:41,751 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2019-08-04 21:39:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:41,866 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-04 21:39:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:39:41,867 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-08-04 21:39:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:41,868 INFO L225 Difference]: With dead ends: 145 [2019-08-04 21:39:41,868 INFO L226 Difference]: Without dead ends: 145 [2019-08-04 21:39:41,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:39:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-04 21:39:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-08-04 21:39:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-04 21:39:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-04 21:39:41,871 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-08-04 21:39:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:41,872 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-04 21:39:41,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:39:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-04 21:39:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-04 21:39:41,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:41,873 INFO L399 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2019-08-04 21:39:41,873 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2019-08-04 21:39:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:41,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-04 21:39:41,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:43,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:43,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:39:43,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:39:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:39:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:39:43,966 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2019-08-04 21:39:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:44,056 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-04 21:39:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:39:44,056 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-08-04 21:39:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:44,057 INFO L225 Difference]: With dead ends: 147 [2019-08-04 21:39:44,058 INFO L226 Difference]: Without dead ends: 147 [2019-08-04 21:39:44,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 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-04 21:39:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-04 21:39:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-08-04 21:39:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-04 21:39:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-08-04 21:39:44,061 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-08-04 21:39:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:44,061 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-08-04 21:39:44,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:39:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-08-04 21:39:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-04 21:39:44,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:44,062 INFO L399 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2019-08-04 21:39:44,062 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2019-08-04 21:39:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:44,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:39:44,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:45,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:45,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:39:45,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:39:45,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:39:45,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:45,974 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2019-08-04 21:39:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:46,091 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-04 21:39:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:39:46,091 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-08-04 21:39:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:46,093 INFO L225 Difference]: With dead ends: 149 [2019-08-04 21:39:46,093 INFO L226 Difference]: Without dead ends: 149 [2019-08-04 21:39:46,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-04 21:39:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-04 21:39:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-04 21:39:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-04 21:39:46,096 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-08-04 21:39:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:46,097 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-04 21:39:46,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:39:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-04 21:39:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-04 21:39:46,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:46,098 INFO L399 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2019-08-04 21:39:46,098 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2019-08-04 21:39:46,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:46,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:39:46,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:48,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:48,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:39:48,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:39:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:39:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:39:48,484 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2019-08-04 21:39:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:48,576 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-04 21:39:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:39:48,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-08-04 21:39:48,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:48,578 INFO L225 Difference]: With dead ends: 151 [2019-08-04 21:39:48,578 INFO L226 Difference]: Without dead ends: 151 [2019-08-04 21:39:48,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:39:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-04 21:39:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-04 21:39:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-04 21:39:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-08-04 21:39:48,582 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-08-04 21:39:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:48,582 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-08-04 21:39:48,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:39:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-08-04 21:39:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-04 21:39:48,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:48,583 INFO L399 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2019-08-04 21:39:48,583 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2019-08-04 21:39:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:48,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:39:48,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:39:50,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:39:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:39:50,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:39:50,982 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2019-08-04 21:39:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:51,079 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-04 21:39:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:39:51,080 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-08-04 21:39:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:51,081 INFO L225 Difference]: With dead ends: 153 [2019-08-04 21:39:51,081 INFO L226 Difference]: Without dead ends: 153 [2019-08-04 21:39:51,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:39:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-04 21:39:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-08-04 21:39:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-04 21:39:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-08-04 21:39:51,084 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-08-04 21:39:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:51,084 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-08-04 21:39:51,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:39:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-08-04 21:39:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-04 21:39:51,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:51,085 INFO L399 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2019-08-04 21:39:51,085 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2019-08-04 21:39:51,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:51,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-04 21:39:51,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:53,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:53,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:39:53,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:39:53,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:39:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:53,053 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2019-08-04 21:39:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:53,207 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-04 21:39:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:39:53,208 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-08-04 21:39:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:53,209 INFO L225 Difference]: With dead ends: 155 [2019-08-04 21:39:53,209 INFO L226 Difference]: Without dead ends: 155 [2019-08-04 21:39:53,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-04 21:39:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-04 21:39:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-04 21:39:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-08-04 21:39:53,211 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-08-04 21:39:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:53,211 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-08-04 21:39:53,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:39:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-08-04 21:39:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-08-04 21:39:53,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:53,212 INFO L399 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2019-08-04 21:39:53,213 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2019-08-04 21:39:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:53,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:39:53,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:55,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:39:55,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:39:55,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:39:55,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:39:55,487 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2019-08-04 21:39:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:55,593 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-04 21:39:55,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:39:55,593 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-08-04 21:39:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:55,594 INFO L225 Difference]: With dead ends: 157 [2019-08-04 21:39:55,594 INFO L226 Difference]: Without dead ends: 157 [2019-08-04 21:39:55,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:39:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-04 21:39:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-04 21:39:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-04 21:39:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-04 21:39:55,598 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-08-04 21:39:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:55,598 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-04 21:39:55,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:39:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-04 21:39:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-04 21:39:55,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:55,599 INFO L399 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2019-08-04 21:39:55,599 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2019-08-04 21:39:55,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:55,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-04 21:39:55,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:57,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:57,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:39:57,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:39:57,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:39:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:39:57,685 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2019-08-04 21:39:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:57,783 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-04 21:39:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:39:57,784 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-08-04 21:39:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:57,785 INFO L225 Difference]: With dead ends: 159 [2019-08-04 21:39:57,785 INFO L226 Difference]: Without dead ends: 159 [2019-08-04 21:39:57,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:39:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-04 21:39:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-04 21:39:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:39:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-08-04 21:39:57,788 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-08-04 21:39:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:57,788 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-08-04 21:39:57,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:39:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-08-04 21:39:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-04 21:39:57,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:57,789 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2019-08-04 21:39:57,789 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:57,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2019-08-04 21:39:57,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:57,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:39:57,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:00,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:00,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:00,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:40:00,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:40:00,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:40:00,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:40:00,183 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2019-08-04 21:40:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:00,295 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-04 21:40:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:40:00,296 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-08-04 21:40:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:00,297 INFO L225 Difference]: With dead ends: 161 [2019-08-04 21:40:00,297 INFO L226 Difference]: Without dead ends: 161 [2019-08-04 21:40:00,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:40:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-04 21:40:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-08-04 21:40:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-04 21:40:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-04 21:40:00,300 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-08-04 21:40:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:00,301 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-04 21:40:00,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:40:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-04 21:40:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-04 21:40:00,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:00,302 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2019-08-04 21:40:00,302 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2019-08-04 21:40:00,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:00,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:40:00,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:02,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:02,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:40:02,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:40:02,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:40:02,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:40:02,479 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2019-08-04 21:40:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:02,597 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-08-04 21:40:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:40:02,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-08-04 21:40:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:02,599 INFO L225 Difference]: With dead ends: 163 [2019-08-04 21:40:02,599 INFO L226 Difference]: Without dead ends: 163 [2019-08-04 21:40:02,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:40:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-04 21:40:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-08-04 21:40:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-04 21:40:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-08-04 21:40:02,603 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-08-04 21:40:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:02,603 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-08-04 21:40:02,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:40:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-08-04 21:40:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-08-04 21:40:02,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:02,604 INFO L399 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2019-08-04 21:40:02,605 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2019-08-04 21:40:02,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:02,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:40:02,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:05,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:05,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:40:05,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:40:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:40:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:40:05,248 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2019-08-04 21:40:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:05,363 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-08-04 21:40:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:40:05,364 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-08-04 21:40:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:05,365 INFO L225 Difference]: With dead ends: 165 [2019-08-04 21:40:05,365 INFO L226 Difference]: Without dead ends: 165 [2019-08-04 21:40:05,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:40:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-04 21:40:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-08-04 21:40:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-04 21:40:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-08-04 21:40:05,368 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-08-04 21:40:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:05,368 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-08-04 21:40:05,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:40:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-08-04 21:40:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-04 21:40:05,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:05,370 INFO L399 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2019-08-04 21:40:05,370 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2019-08-04 21:40:05,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:05,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-04 21:40:05,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:07,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:07,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:40:07,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:40:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:40:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:40:07,725 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2019-08-04 21:40:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:07,865 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-08-04 21:40:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:40:07,866 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-08-04 21:40:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:07,867 INFO L225 Difference]: With dead ends: 167 [2019-08-04 21:40:07,867 INFO L226 Difference]: Without dead ends: 167 [2019-08-04 21:40:07,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:40:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-04 21:40:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-04 21:40:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-04 21:40:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-08-04 21:40:07,870 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-08-04 21:40:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:07,871 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-08-04 21:40:07,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:40:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-08-04 21:40:07,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-04 21:40:07,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:07,872 INFO L399 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2019-08-04 21:40:07,872 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2019-08-04 21:40:07,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:07,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:40:07,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:10,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:10,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:40:10,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:40:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:40:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:40:10,381 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2019-08-04 21:40:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:10,494 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-08-04 21:40:10,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:40:10,495 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-08-04 21:40:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:10,496 INFO L225 Difference]: With dead ends: 169 [2019-08-04 21:40:10,496 INFO L226 Difference]: Without dead ends: 169 [2019-08-04 21:40:10,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:40:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-04 21:40:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-04 21:40:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-04 21:40:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-08-04 21:40:10,499 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-08-04 21:40:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:10,499 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-08-04 21:40:10,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:40:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-08-04 21:40:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-04 21:40:10,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:10,501 INFO L399 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2019-08-04 21:40:10,501 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2019-08-04 21:40:10,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:10,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-04 21:40:10,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:13,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:13,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:40:13,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:40:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:40:13,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:40:13,055 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2019-08-04 21:40:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:13,171 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-08-04 21:40:13,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-04 21:40:13,172 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-08-04 21:40:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:13,173 INFO L225 Difference]: With dead ends: 171 [2019-08-04 21:40:13,173 INFO L226 Difference]: Without dead ends: 171 [2019-08-04 21:40:13,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:40:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-04 21:40:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-08-04 21:40:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-04 21:40:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-08-04 21:40:13,176 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-08-04 21:40:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:13,177 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-08-04 21:40:13,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-04 21:40:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-08-04 21:40:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-08-04 21:40:13,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:13,178 INFO L399 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2019-08-04 21:40:13,178 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2019-08-04 21:40:13,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:13,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:40:13,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:15,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:15,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-04 21:40:15,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-04 21:40:15,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-04 21:40:15,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:40:15,850 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2019-08-04 21:40:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:15,977 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-08-04 21:40:15,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-04 21:40:15,977 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-08-04 21:40:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:15,979 INFO L225 Difference]: With dead ends: 173 [2019-08-04 21:40:15,979 INFO L226 Difference]: Without dead ends: 173 [2019-08-04 21:40:15,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-04 21:40:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-04 21:40:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-08-04 21:40:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-04 21:40:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-04 21:40:15,982 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-08-04 21:40:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:15,982 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-04 21:40:15,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-04 21:40:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-04 21:40:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-04 21:40:15,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:15,983 INFO L399 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2019-08-04 21:40:15,983 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2019-08-04 21:40:15,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:16,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:40:16,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:18,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-04 21:40:18,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-04 21:40:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-04 21:40:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:40:18,550 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2019-08-04 21:40:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:18,710 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-08-04 21:40:18,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-04 21:40:18,710 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-08-04 21:40:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:18,711 INFO L225 Difference]: With dead ends: 175 [2019-08-04 21:40:18,711 INFO L226 Difference]: Without dead ends: 175 [2019-08-04 21:40:18,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:40:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-04 21:40:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-04 21:40:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-04 21:40:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-08-04 21:40:18,715 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-08-04 21:40:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:18,716 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-08-04 21:40:18,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-04 21:40:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-08-04 21:40:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-04 21:40:18,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:18,717 INFO L399 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2019-08-04 21:40:18,717 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2019-08-04 21:40:18,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:18,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:40:18,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:21,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:21,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-04 21:40:21,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-04 21:40:21,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-04 21:40:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:40:21,463 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2019-08-04 21:40:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:21,587 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-08-04 21:40:21,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-04 21:40:21,587 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-08-04 21:40:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:21,588 INFO L225 Difference]: With dead ends: 177 [2019-08-04 21:40:21,589 INFO L226 Difference]: Without dead ends: 177 [2019-08-04 21:40:21,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-04 21:40:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-04 21:40:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-08-04 21:40:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-04 21:40:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-08-04 21:40:21,592 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-08-04 21:40:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:21,593 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-08-04 21:40:21,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-04 21:40:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-08-04 21:40:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-04 21:40:21,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:21,594 INFO L399 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2019-08-04 21:40:21,594 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2019-08-04 21:40:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:21,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-04 21:40:21,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:24,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:24,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-04 21:40:24,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-04 21:40:24,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-04 21:40:24,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:40:24,526 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2019-08-04 21:40:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:24,648 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-08-04 21:40:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-04 21:40:24,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-08-04 21:40:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:24,650 INFO L225 Difference]: With dead ends: 179 [2019-08-04 21:40:24,650 INFO L226 Difference]: Without dead ends: 179 [2019-08-04 21:40:24,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:40:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-04 21:40:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-08-04 21:40:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-04 21:40:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-08-04 21:40:24,653 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-08-04 21:40:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:24,653 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-08-04 21:40:24,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-04 21:40:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-08-04 21:40:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-08-04 21:40:24,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:24,654 INFO L399 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2019-08-04 21:40:24,654 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2019-08-04 21:40:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:24,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:40:24,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:27,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-04 21:40:27,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-04 21:40:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-04 21:40:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:40:27,384 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2019-08-04 21:40:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:27,496 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-08-04 21:40:27,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-04 21:40:27,497 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-08-04 21:40:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:27,498 INFO L225 Difference]: With dead ends: 181 [2019-08-04 21:40:27,498 INFO L226 Difference]: Without dead ends: 181 [2019-08-04 21:40:27,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-04 21:40:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-04 21:40:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-08-04 21:40:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-04 21:40:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-08-04 21:40:27,501 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-08-04 21:40:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:27,502 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-08-04 21:40:27,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-04 21:40:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-08-04 21:40:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-04 21:40:27,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:27,503 INFO L399 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2019-08-04 21:40:27,503 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2019-08-04 21:40:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:27,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-04 21:40:27,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:30,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:30,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-04 21:40:30,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-04 21:40:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-04 21:40:30,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:40:30,517 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2019-08-04 21:40:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:30,644 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-08-04 21:40:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-04 21:40:30,644 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-08-04 21:40:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:30,646 INFO L225 Difference]: With dead ends: 183 [2019-08-04 21:40:30,646 INFO L226 Difference]: Without dead ends: 183 [2019-08-04 21:40:30,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:40:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-04 21:40:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-08-04 21:40:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-04 21:40:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-08-04 21:40:30,649 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-08-04 21:40:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:30,649 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-08-04 21:40:30,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-04 21:40:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-08-04 21:40:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-08-04 21:40:30,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:30,650 INFO L399 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2019-08-04 21:40:30,650 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2019-08-04 21:40:30,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:30,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:40:30,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:33,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:33,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-04 21:40:33,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-04 21:40:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-04 21:40:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:40:33,535 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2019-08-04 21:40:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:33,658 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-08-04 21:40:33,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-04 21:40:33,658 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-08-04 21:40:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:33,659 INFO L225 Difference]: With dead ends: 185 [2019-08-04 21:40:33,660 INFO L226 Difference]: Without dead ends: 185 [2019-08-04 21:40:33,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-04 21:40:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-08-04 21:40:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-08-04 21:40:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-04 21:40:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-08-04 21:40:33,663 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-08-04 21:40:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:33,663 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-08-04 21:40:33,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-04 21:40:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-08-04 21:40:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-04 21:40:33,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:33,664 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2019-08-04 21:40:33,664 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2019-08-04 21:40:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:33,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:40:33,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:36,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-04 21:40:36,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-04 21:40:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-04 21:40:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:40:36,761 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2019-08-04 21:40:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:36,888 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-08-04 21:40:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-04 21:40:36,889 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-08-04 21:40:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:36,890 INFO L225 Difference]: With dead ends: 187 [2019-08-04 21:40:36,890 INFO L226 Difference]: Without dead ends: 187 [2019-08-04 21:40:36,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:40:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-04 21:40:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-08-04 21:40:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-04 21:40:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-08-04 21:40:36,894 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-08-04 21:40:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:36,894 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-08-04 21:40:36,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-04 21:40:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-08-04 21:40:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-08-04 21:40:36,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:36,896 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2019-08-04 21:40:36,896 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:36,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2019-08-04 21:40:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:37,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:40:37,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:40,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-04 21:40:40,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-04 21:40:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-04 21:40:40,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:40:40,238 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2019-08-04 21:40:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:40,390 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-08-04 21:40:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-04 21:40:40,390 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-08-04 21:40:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:40,391 INFO L225 Difference]: With dead ends: 189 [2019-08-04 21:40:40,391 INFO L226 Difference]: Without dead ends: 189 [2019-08-04 21:40:40,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-04 21:40:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-04 21:40:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-08-04 21:40:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-04 21:40:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-08-04 21:40:40,395 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-08-04 21:40:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:40,395 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-08-04 21:40:40,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-04 21:40:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-08-04 21:40:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-04 21:40:40,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:40,396 INFO L399 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2019-08-04 21:40:40,397 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2019-08-04 21:40:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:40,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-04 21:40:40,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:43,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-04 21:40:43,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-04 21:40:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-04 21:40:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:40:43,924 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2019-08-04 21:40:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:44,908 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-08-04 21:40:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-04 21:40:44,908 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-08-04 21:40:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:44,909 INFO L225 Difference]: With dead ends: 191 [2019-08-04 21:40:44,909 INFO L226 Difference]: Without dead ends: 191 [2019-08-04 21:40:44,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:40:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-04 21:40:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-08-04 21:40:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-08-04 21:40:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-08-04 21:40:44,911 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-08-04 21:40:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:44,912 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-08-04 21:40:44,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-04 21:40:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-08-04 21:40:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-08-04 21:40:44,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:44,913 INFO L399 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2019-08-04 21:40:44,913 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2019-08-04 21:40:44,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:45,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:40:45,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:48,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:48,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-04 21:40:48,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-04 21:40:48,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-04 21:40:48,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:40:48,003 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2019-08-04 21:40:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:48,143 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-08-04 21:40:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-04 21:40:48,144 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-08-04 21:40:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:48,145 INFO L225 Difference]: With dead ends: 193 [2019-08-04 21:40:48,145 INFO L226 Difference]: Without dead ends: 193 [2019-08-04 21:40:48,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-04 21:40:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-04 21:40:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-08-04 21:40:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-04 21:40:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-08-04 21:40:48,149 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-08-04 21:40:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:48,149 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-08-04 21:40:48,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-04 21:40:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-08-04 21:40:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-04 21:40:48,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:48,150 INFO L399 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2019-08-04 21:40:48,150 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:48,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2019-08-04 21:40:48,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:48,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-04 21:40:48,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:51,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-04 21:40:51,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-04 21:40:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-04 21:40:51,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:40:51,601 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2019-08-04 21:40:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:51,746 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-08-04 21:40:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-04 21:40:51,747 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-08-04 21:40:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:51,748 INFO L225 Difference]: With dead ends: 195 [2019-08-04 21:40:51,748 INFO L226 Difference]: Without dead ends: 195 [2019-08-04 21:40:51,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:40:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-04 21:40:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-08-04 21:40:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-04 21:40:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-08-04 21:40:51,752 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-08-04 21:40:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:51,752 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-08-04 21:40:51,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-04 21:40:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-08-04 21:40:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-04 21:40:51,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:51,753 INFO L399 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2019-08-04 21:40:51,753 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2019-08-04 21:40:51,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:51,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:40:51,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:55,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-04 21:40:55,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-04 21:40:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-04 21:40:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:40:55,247 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2019-08-04 21:40:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:55,376 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-08-04 21:40:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-04 21:40:55,377 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-08-04 21:40:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:55,378 INFO L225 Difference]: With dead ends: 197 [2019-08-04 21:40:55,378 INFO L226 Difference]: Without dead ends: 197 [2019-08-04 21:40:55,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-04 21:40:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-04 21:40:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-08-04 21:40:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-04 21:40:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-08-04 21:40:55,382 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-08-04 21:40:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:55,382 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-08-04 21:40:55,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-04 21:40:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-08-04 21:40:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-04 21:40:55,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:55,383 INFO L399 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2019-08-04 21:40:55,384 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2019-08-04 21:40:55,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:55,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:40:55,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:58,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:58,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-04 21:40:58,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-04 21:40:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-04 21:40:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:40:58,743 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2019-08-04 21:40:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:58,885 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-08-04 21:40:58,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-04 21:40:58,886 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-08-04 21:40:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:58,887 INFO L225 Difference]: With dead ends: 199 [2019-08-04 21:40:58,887 INFO L226 Difference]: Without dead ends: 199 [2019-08-04 21:40:58,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:40:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-04 21:40:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-08-04 21:40:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-04 21:40:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-08-04 21:40:58,890 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-08-04 21:40:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:58,890 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-08-04 21:40:58,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-04 21:40:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-08-04 21:40:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-04 21:40:58,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:58,891 INFO L399 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2019-08-04 21:40:58,891 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:58,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2019-08-04 21:40:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:58,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:40:58,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:02,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-04 21:41:02,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-04 21:41:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-04 21:41:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:41:02,246 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2019-08-04 21:41:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:02,419 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-08-04 21:41:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-04 21:41:02,420 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-08-04 21:41:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:02,421 INFO L225 Difference]: With dead ends: 201 [2019-08-04 21:41:02,421 INFO L226 Difference]: Without dead ends: 201 [2019-08-04 21:41:02,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-04 21:41:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-04 21:41:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-08-04 21:41:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-04 21:41:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-08-04 21:41:02,425 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-08-04 21:41:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:02,425 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-08-04 21:41:02,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-04 21:41:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-08-04 21:41:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-04 21:41:02,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:02,426 INFO L399 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2019-08-04 21:41:02,427 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2019-08-04 21:41:02,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:02,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-04 21:41:02,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:06,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:06,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-04 21:41:06,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-04 21:41:06,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-04 21:41:06,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:41:06,042 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2019-08-04 21:41:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:06,196 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-04 21:41:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-04 21:41:06,196 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-08-04 21:41:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:06,198 INFO L225 Difference]: With dead ends: 203 [2019-08-04 21:41:06,198 INFO L226 Difference]: Without dead ends: 203 [2019-08-04 21:41:06,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:41:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-04 21:41:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-08-04 21:41:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-04 21:41:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-08-04 21:41:06,201 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-08-04 21:41:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:06,201 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-08-04 21:41:06,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-04 21:41:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-08-04 21:41:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-08-04 21:41:06,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:06,202 INFO L399 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2019-08-04 21:41:06,202 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:06,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2019-08-04 21:41:06,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:06,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:41:06,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:09,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:41:09,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-04 21:41:09,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-04 21:41:09,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-04 21:41:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:41:09,774 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2019-08-04 21:41:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:09,974 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-08-04 21:41:09,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-04 21:41:09,975 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-08-04 21:41:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:09,976 INFO L225 Difference]: With dead ends: 205 [2019-08-04 21:41:09,976 INFO L226 Difference]: Without dead ends: 205 [2019-08-04 21:41:09,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-04 21:41:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-04 21:41:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-08-04 21:41:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-04 21:41:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-08-04 21:41:09,978 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-08-04 21:41:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:09,978 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-08-04 21:41:09,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-04 21:41:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-08-04 21:41:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-04 21:41:09,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:41:09,979 INFO L399 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2019-08-04 21:41:09,979 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:41:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:41:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2019-08-04 21:41:09,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:41:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:41:10,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:41:10,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:41:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 10100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:41:14,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:41:14,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2019-08-04 21:41:14,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-04 21:41:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-04 21:41:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:41:14,281 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2019-08-04 21:41:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:41:14,565 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-08-04 21:41:14,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-04 21:41:14,565 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-08-04 21:41:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:41:14,566 INFO L225 Difference]: With dead ends: 203 [2019-08-04 21:41:14,566 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:41:14,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:41:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:41:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:41:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:41:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:41:14,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2019-08-04 21:41:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:41:14,568 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:41:14,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-04 21:41:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:41:14,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:41:14,573 INFO L202 PluginConnector]: Adding new model string_concat-noarr.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:41:14 BoogieIcfgContainer [2019-08-04 21:41:14,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:41:14,575 INFO L168 Benchmark]: Toolchain (without parser) took 161634.85 ms. Allocated memory was 133.2 MB in the beginning and 698.4 MB in the end (delta: 565.2 MB). Free memory was 110.6 MB in the beginning and 238.6 MB in the end (delta: -128.0 MB). Peak memory consumption was 437.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:41:14,576 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-04 21:41:14,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.04 ms. Allocated memory is still 133.2 MB. Free memory was 110.4 MB in the beginning and 108.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:41:14,577 INFO L168 Benchmark]: Boogie Preprocessor took 21.97 ms. Allocated memory is still 133.2 MB. Free memory was 108.8 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:41:14,578 INFO L168 Benchmark]: RCFGBuilder took 348.62 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 97.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:41:14,578 INFO L168 Benchmark]: TraceAbstraction took 161223.73 ms. Allocated memory was 133.2 MB in the beginning and 698.4 MB in the end (delta: 565.2 MB). Free memory was 97.7 MB in the beginning and 238.6 MB in the end (delta: -140.9 MB). Peak memory consumption was 424.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:41:14,581 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.25 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 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 36.04 ms. Allocated memory is still 133.2 MB. Free memory was 110.4 MB in the beginning and 108.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.97 ms. Allocated memory is still 133.2 MB. Free memory was 108.8 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 348.62 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 97.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 161223.73 ms. Allocated memory was 133.2 MB in the beginning and 698.4 MB in the end (delta: 565.2 MB). Free memory was 97.7 MB in the beginning and 238.6 MB in the end (delta: -140.9 MB). Peak memory consumption was 424.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 161.1s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 0 SDslu, 6056 SDs, 0 SdLazy, 6257 SolverSat, 313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10403 GetRequests, 5252 SyntacticMatches, 0 SemanticMatches, 5151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 142.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 146.0s InterpolantComputationTime, 10504 NumberOfCodeBlocks, 10504 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 4223921 SizeOfPredicates, 300 NumberOfNonLiveVariables, 42521 ConjunctsInSsa, 5552 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10100/343400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...