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/cggmp2005_variant.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:37,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:37,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:37,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:37,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:37,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:37,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:37,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:37,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:37,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:37,942 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:37,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:37,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:37,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:37,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:37,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:37,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:37,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:37,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:37,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:37,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:37,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:37,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:37,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:37,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:37,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:37,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:37,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:37,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:37,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:37,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:37,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:37,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:37,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:37,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:37,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:37,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:37,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:37,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:37,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:37,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:38,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:38,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:38,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:38,060 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:38,061 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:38,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005_variant.c.i_3.bpl [2019-08-05 10:16:38,062 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/cggmp2005_variant.c.i_3.bpl' [2019-08-05 10:16:38,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:38,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:38,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:38,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:38,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:38,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:38,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:38,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:38,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:38,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... [2019-08-05 10:16:38,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:38,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:38,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:38,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:38,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:16:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:38,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:38,429 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:38,429 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:38,430 INFO L202 PluginConnector]: Adding new model cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:38 BoogieIcfgContainer [2019-08-05 10:16:38,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:38,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:38,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:38,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:38,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:38" (1/2) ... [2019-08-05 10:16:38,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71aa9e42 and model type cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:38, skipping insertion in model container [2019-08-05 10:16:38,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:38" (2/2) ... [2019-08-05 10:16:38,438 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.c.i_3.bpl [2019-08-05 10:16:38,448 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:38,455 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:38,471 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:38,497 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:38,498 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:38,499 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:38,499 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:38,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:38,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:38,499 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:38,499 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:38,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:16:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:16:38,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:16:38,529 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:16:38,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:38,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:38,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:38,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:38,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:38,688 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:16:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,735 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:16:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:38,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:16:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,748 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:16:38,748 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:16:38,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:16:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:16:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:16:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:16:38,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:16:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,784 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:16:38,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:16:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:16:38,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:16:38,786 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:16:38,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,957 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:16:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:39,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:39,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:16:39,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:39,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:39,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:39,086 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:16:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,145 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:16:39,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:39,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:16:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,146 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:16:39,147 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:16:39,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:16:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:16:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:16:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:16:39,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:16:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,151 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:16:39,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:16:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:16:39,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:39,152 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:16:39,152 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:16:39,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:39,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:16:39,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:39,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:39,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:39,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:39,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:39,334 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:16:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,419 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:16:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:39,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:16:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,420 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:16:39,421 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:16:39,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:16:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:16:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:16:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:16:39,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:16:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,424 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:16:39,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:16:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:16:39,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:39,425 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:16:39,425 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:39,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:16:39,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:39,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:16:39,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:39,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:39,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:39,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:39,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:39,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:39,737 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:16:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,912 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:16:39,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:39,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:16:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,914 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:16:39,914 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:16:39,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:16:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:16:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:16:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:16:39,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:16:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,917 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:16:39,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:16:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:16:39,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:39,918 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:16:39,918 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:16:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:39,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:16:39,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:40,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:40,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:40,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:40,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:40,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:40,156 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:16:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:40,240 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:16:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:40,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:16:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:40,241 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:16:40,242 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:16:40,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:16:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:16:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:16:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:16:40,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:16:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:40,245 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:16:40,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:16:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:16:40,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:40,246 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:16:40,247 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:16:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:40,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:16:40,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:40,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:40,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:40,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:16:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:16:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:40,577 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:16:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:40,715 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:16:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:16:40,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:16:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:40,718 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:16:40,718 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:16:40,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:16:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:16:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:16:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:16:40,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:16:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:40,721 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:16:40,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:16:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:16:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:16:40,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:40,722 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:16:40,723 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:16:40,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:40,749 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:16:40,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:41,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:41,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:16:41,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:16:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:16:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:41,319 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:16:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:41,438 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:16:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:16:41,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:16:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:41,439 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:16:41,439 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:16:41,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:16:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:16:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:16:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:16:41,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:16:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:41,443 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:16:41,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:16:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:16:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:41,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:41,444 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:16:41,444 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:16:41,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:41,475 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:16:41,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:41,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:16:41,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:16:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:16:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:41,768 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:16:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:41,888 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:16:41,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:16:41,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:16:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:41,890 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:16:41,891 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:16:41,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:16:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:16:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:16:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:16:41,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:16:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:41,895 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:16:41,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:16:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:16:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:16:41,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:41,896 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:16:41,897 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:16:41,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:41,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:16:41,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:42,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:42,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:16:42,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:16:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:16:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:16:42,252 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:16:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:42,385 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:16:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:16:42,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:16:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:42,387 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:16:42,387 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:16:42,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:16:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:16:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:16:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:16:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:16:42,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:16:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:42,391 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:16:42,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:16:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:16:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:16:42,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:42,392 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:16:42,393 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:16:42,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:42,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:16:42,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:42,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:42,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:16:42,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:16:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:16:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:16:42,724 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:16:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:42,892 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:16:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:16:42,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:16:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:42,893 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:16:42,893 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:16:42,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:16:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:16:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:16:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:16:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:16:42,898 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:16:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:42,898 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:16:42,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:16:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:16:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:16:42,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:42,899 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:16:42,899 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:42,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:42,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:16:42,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:42,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:16:42,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:43,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:43,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:16:43,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:16:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:16:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:16:43,345 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:16:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:43,495 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:16:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:16:43,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:16:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:43,501 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:16:43,501 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:16:43,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:16:43,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:16:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:16:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:16:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:16:43,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:16:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:43,505 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:16:43,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:16:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:16:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:16:43,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:43,506 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:16:43,506 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:43,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:16:43,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:43,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:16:43,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:44,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:44,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:16:44,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:16:44,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:16:44,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:16:44,146 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:16:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:44,303 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:16:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:16:44,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:16:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:44,304 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:16:44,304 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:16:44,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:16:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:16:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:16:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:16:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:16:44,308 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:16:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:44,308 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:16:44,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:16:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:16:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:16:44,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:44,309 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:16:44,309 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:16:44,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:44,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:16:44,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:44,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:44,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:16:44,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:16:44,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:16:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:16:44,631 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:16:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:44,826 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:16:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:16:44,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:16:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:44,832 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:16:44,832 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:16:44,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:16:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:16:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:16:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:16:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:16:44,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:16:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:44,838 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:16:44,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:16:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:16:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:16:44,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:44,839 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:16:44,839 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:16:44,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:44,882 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:16:44,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:45,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:45,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:16:45,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:16:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:16:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:16:45,143 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:16:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:45,453 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:16:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:16:45,454 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:16:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:45,455 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:16:45,455 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:16:45,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:16:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:16:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:16:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:16:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:16:45,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:16:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:45,460 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:16:45,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:16:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:16:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:16:45,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:45,461 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:16:45,461 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:16:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:45,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:16:45,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:45,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:45,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:16:45,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:16:45,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:16:45,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:16:45,850 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:16:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,245 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:16:46,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:16:46,245 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:16:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,246 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:16:46,247 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:16:46,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:16:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:16:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:16:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:16:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:16:46,251 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:16:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,251 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:16:46,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:16:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:16:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:16:46,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,252 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:16:46,253 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:16:46,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:46,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:16:46,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:16:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:16:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:16:46,634 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:16:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,886 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:16:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:16:46,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:16:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,888 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:16:46,888 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:16:46,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:16:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:16:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:16:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:16:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:16:46,893 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:16:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,893 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:16:46,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:16:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:16:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:16:46,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,895 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:16:46,895 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:16:46,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:47,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:16:47,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:16:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:16:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:16:47,377 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:16:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,658 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:16:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:16:47,658 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:16:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,659 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:16:47,659 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:16:47,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:16:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:16:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:16:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:16:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:16:47,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:16:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,664 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:16:47,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:16:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:16:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:16:47,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,665 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:16:47,665 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:16:47,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:16:48,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:16:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:16:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:16:48,001 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:16:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,393 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:16:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:16:48,395 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:16:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,396 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:16:48,396 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:16:48,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:16:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:16:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:16:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:16:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:16:48,400 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:16:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,400 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:16:48,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:16:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:16:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:16:48,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,401 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:16:48,401 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:16:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:16:48,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:16:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:16:48,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:48,847 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:16:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:49,201 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:16:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:16:49,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:16:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:49,202 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:16:49,203 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:16:49,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:16:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:16:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:16:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:16:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:16:49,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:16:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:49,214 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:16:49,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:16:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:16:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:16:49,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:49,215 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:16:49,216 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:16:49,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:49,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:16:49,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:49,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:16:49,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:16:49,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:16:49,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:16:49,694 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:16:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:50,068 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:16:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:16:50,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:16:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:50,069 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:16:50,069 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:16:50,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:16:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:16:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:16:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:16:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:16:50,073 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:16:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:50,074 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:16:50,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:16:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:16:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:16:50,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:50,075 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:16:50,075 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:16:50,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:50,099 WARN L254 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:16:50,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:51,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:16:51,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:16:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:16:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:16:51,001 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:16:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,411 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:16:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:16:51,412 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:16:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,413 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:16:51,413 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:16:51,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:16:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:16:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:16:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:16:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:16:51,417 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:16:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,417 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:16:51,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:16:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:16:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:16:51,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:51,418 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:16:51,419 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:51,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:51,419 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:16:51,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:51,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:16:51,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:52,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:52,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:16:52,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:16:52,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:16:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:16:52,218 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:16:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:52,732 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:16:52,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:16:52,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:16:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:52,735 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:16:52,735 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:16:52,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:16:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:16:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:16:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:16:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:16:52,739 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:16:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:52,739 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:16:52,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:16:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:16:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:16:52,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:52,740 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:16:52,740 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:16:52,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:52,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:16:52,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:54,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:54,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:16:54,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:16:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:16:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:16:54,283 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:16:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:55,161 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:16:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:16:55,163 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:16:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:55,164 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:16:55,164 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:16:55,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:16:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:16:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:16:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:16:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:16:55,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:16:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:55,167 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:16:55,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:16:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:16:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:16:55,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:55,168 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:16:55,168 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:16:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:55,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:16:55,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:56,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:56,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:16:56,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:16:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:16:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:16:56,488 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:16:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:57,596 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:16:57,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:16:57,596 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:16:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:57,597 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:16:57,597 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:16:57,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:16:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:16:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:16:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:16:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:16:57,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:16:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:57,602 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:16:57,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:16:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:16:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:16:57,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:57,603 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:16:57,603 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:16:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:57,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:16:57,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:16:58,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:16:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:16:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:16:58,184 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:16:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:58,733 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:16:58,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:16:58,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:16:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:58,734 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:16:58,734 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:16:58,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:16:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:16:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:16:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:16:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:16:58,738 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:16:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:58,739 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:16:58,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:16:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:16:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:16:58,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:58,740 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:16:58,740 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:16:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:58,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:16:58,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:59,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:59,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:16:59,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:16:59,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:16:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:16:59,524 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:17:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:00,182 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:17:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:17:00,183 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:17:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:00,183 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:17:00,184 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:17:00,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:17:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:17:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:17:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:17:00,187 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:17:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:00,187 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:17:00,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:17:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:17:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:17:00,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:00,188 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:17:00,188 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:17:00,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:00,216 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:17:00,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:17:00,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:17:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:17:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:00,843 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:17:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:01,561 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:17:01,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:17:01,562 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:17:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:01,563 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:17:01,563 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:17:01,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:17:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:17:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:17:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:17:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:17:01,567 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:17:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:01,567 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:17:01,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:17:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:17:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:17:01,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:01,568 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:17:01,569 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:17:01,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:01,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:17:01,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:17:02,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:17:02,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:17:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:02,281 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:17:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:02,960 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:17:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:17:02,960 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:17:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:02,961 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:17:02,961 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:17:02,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:17:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:17:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:17:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:17:02,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:17:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:02,966 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:17:02,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:17:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:17:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:17:02,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:02,967 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:17:02,967 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:17:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:02,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:17:02,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:03,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:03,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:17:03,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:17:03,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:17:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:03,618 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:17:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:04,383 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:17:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:17:04,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:17:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:04,385 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:17:04,385 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:17:04,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:17:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:17:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:17:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:17:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:17:04,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:17:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:04,390 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:17:04,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:17:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:17:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:17:04,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:04,391 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:17:04,391 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:17:04,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:04,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:17:04,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:05,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:05,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:17:05,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:17:05,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:17:05,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:05,068 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:17:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:05,840 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:17:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:17:05,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:17:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:05,841 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:17:05,842 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:17:05,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:17:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:17:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:17:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:17:05,846 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:17:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:05,846 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:17:05,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:17:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:17:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:17:05,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:05,847 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:17:05,847 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:17:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:05,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:17:05,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:06,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:06,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:17:06,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:17:06,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:17:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:06,771 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:17:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:07,588 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:17:07,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:17:07,588 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:17:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:07,589 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:17:07,589 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:17:07,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:17:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:17:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:17:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:17:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:17:07,593 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:17:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:07,594 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:17:07,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:17:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:17:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:17:07,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:07,594 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:17:07,595 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:17:07,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:07,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:17:07,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:08,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:17:08,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:17:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:17:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:08,379 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:17:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:09,233 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:17:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:17:09,234 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:17:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:09,234 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:17:09,235 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:17:09,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:17:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:17:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:17:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:17:09,237 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:17:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:09,238 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:17:09,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:17:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:17:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:17:09,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:09,238 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:17:09,239 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:17:09,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:09,277 WARN L254 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:17:09,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:10,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:17:10,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:17:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:17:10,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:10,081 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:17:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:11,005 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:17:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:17:11,005 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:17:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:11,005 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:17:11,006 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:17:11,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:17:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:17:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:17:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:17:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:17:11,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:17:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:11,009 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:17:11,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:17:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:17:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:17:11,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:11,009 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:17:11,010 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:17:11,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:11,049 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:17:11,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:12,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:12,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:17:12,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:17:12,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:17:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:12,154 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:17:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:13,140 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:17:13,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:17:13,140 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:17:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:13,141 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:17:13,141 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:17:13,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:17:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:17:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:17:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:17:13,144 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:17:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:13,144 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:17:13,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:17:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:17:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:17:13,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:13,145 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:17:13,145 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:17:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:13,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:17:13,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:13,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:13,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:17:13,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:17:13,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:17:13,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:13,967 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:17:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:14,982 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:17:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:17:14,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:17:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:14,983 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:17:14,983 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:17:14,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:17:14,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:17:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:17:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:17:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:17:14,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:17:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:14,987 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:17:14,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:17:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:17:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:17:14,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:14,989 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:17:14,989 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:17:14,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:15,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:17:15,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:16,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:16,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:17:16,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:17:16,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:17:16,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:16,347 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:17:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:17,464 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:17:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:17:17,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:17:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:17,465 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:17:17,466 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:17:17,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:17:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:17:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:17:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:17:17,469 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:17:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:17,470 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:17:17,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:17:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:17:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:17:17,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:17,471 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:17:17,471 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:17,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:17,472 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:17:17,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:17,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:17:17,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:18,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:18,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:17:18,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:17:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:17:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:17:18,531 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:17:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:19,667 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:17:19,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:17:19,667 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:17:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:19,668 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:17:19,668 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:17:19,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:17:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:17:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:17:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:17:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:17:19,672 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:17:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:19,672 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:17:19,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:17:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:17:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:17:19,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:19,673 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:17:19,673 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:17:19,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:19,713 WARN L254 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-05 10:17:19,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:20,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:20,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:17:20,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:17:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:17:20,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:17:20,734 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:17:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:22,136 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:17:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:17:22,136 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:17:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:22,137 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:17:22,137 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:17:22,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:17:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:17:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:17:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:17:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:17:22,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:17:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:22,141 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:17:22,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:17:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:17:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:17:22,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:22,142 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:17:22,142 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:22,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:17:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:22,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:17:22,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:23,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:23,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:17:23,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:17:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:17:23,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:23,161 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:17:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:24,437 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:17:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:17:24,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:17:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:24,438 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:17:24,439 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:17:24,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:17:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:17:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:17:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:17:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:17:24,442 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:17:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:24,443 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:17:24,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:17:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:17:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:17:24,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:24,443 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:17:24,444 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:17:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:24,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 10:17:24,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:25,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:25,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:17:25,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:17:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:17:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:17:25,532 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:17:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:26,997 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:17:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:17:26,998 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:17:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:26,998 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:17:26,998 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:17:27,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:17:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:17:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:17:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:17:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:17:27,002 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:17:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:27,002 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:17:27,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:17:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:17:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:17:27,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:27,003 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:17:27,003 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:17:27,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:27,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:17:27,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:28,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:17:28,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:17:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:17:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:17:28,404 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:17:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:29,820 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:17:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:17:29,828 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:17:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:29,828 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:17:29,828 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:17:29,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:17:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:17:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:17:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:17:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:17:29,831 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:17:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:29,832 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:17:29,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:17:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:17:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:17:29,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:29,833 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:17:29,833 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:17:29,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:29,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-05 10:17:29,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:31,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:31,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:17:31,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:17:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:17:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:31,092 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:17:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:32,641 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:17:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:17:32,642 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:17:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:32,642 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:17:32,642 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:17:32,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:17:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:17:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:17:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:17:32,645 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:17:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:32,646 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:17:32,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:17:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:17:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:17:32,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:32,647 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:17:32,647 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:17:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:32,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:17:32,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:33,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:33,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:17:33,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:17:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:17:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:33,848 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:17:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,337 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:17:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:17:35,338 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:17:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,338 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:17:35,339 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:17:35,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:17:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:17:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:17:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:17:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:17:35,342 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:17:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,343 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:17:35,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:17:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:17:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:17:35,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,344 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:17:35,345 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:17:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,411 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:17:37,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:17:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:17:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:17:37,366 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:17:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,940 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:17:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:17:38,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:17:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,941 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:17:38,941 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:17:38,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:17:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:17:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:17:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:17:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:17:38,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:17:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,944 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:17:38,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:17:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:17:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:17:38,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,945 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:17:38,945 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:17:38,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:39,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:17:39,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:40,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:40,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:17:40,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:17:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:17:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:40,216 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:17:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:41,944 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:17:41,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:17:41,944 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:17:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:41,944 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:17:41,945 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:17:41,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:17:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:17:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:17:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:17:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:17:41,947 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:17:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:41,947 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:17:41,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:17:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:17:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:17:41,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:41,948 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:17:41,948 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:17:41,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:42,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-05 10:17:42,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:43,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:43,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:17:43,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:17:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:17:43,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:43,408 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:17:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:45,095 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:17:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:17:45,095 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:17:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:45,096 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:17:45,096 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:17:45,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:17:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:17:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:17:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:17:45,099 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:17:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:45,099 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:17:45,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:17:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:17:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:17:45,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:45,100 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:17:45,100 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:17:45,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:45,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:17:45,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:46,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:46,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:17:46,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:17:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:17:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:46,508 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:17:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:48,418 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:17:48,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:17:48,419 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:17:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:48,420 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:17:48,420 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:17:48,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:17:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:17:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:17:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:17:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:17:48,422 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:17:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:48,422 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:17:48,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:17:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:17:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:17:48,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:48,423 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:17:48,424 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:17:48,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:48,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 10:17:48,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:49,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:49,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:17:49,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:17:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:17:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:17:49,843 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:17:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:51,694 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:17:51,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:17:51,694 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:17:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:51,695 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:17:51,695 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:17:51,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:17:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:17:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:17:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:17:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:17:51,699 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:17:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:51,699 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:17:51,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:17:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:17:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:17:51,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:51,700 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:17:51,700 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:17:51,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:51,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:17:51,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:53,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:53,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:17:53,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:17:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:17:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:17:53,394 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:17:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:55,337 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:17:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:17:55,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:17:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:55,339 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:17:55,339 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:17:55,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:17:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:17:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:17:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:17:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:17:55,342 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:17:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:55,342 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:17:55,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:17:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:17:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:17:55,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:55,343 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:17:55,343 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:17:55,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:55,400 WARN L254 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-05 10:17:55,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:17:56,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:17:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:17:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:17:56,911 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:17:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:59,047 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:17:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:17:59,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:17:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:59,048 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:17:59,048 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:17:59,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:17:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:17:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:17:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:17:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:17:59,052 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:17:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:59,052 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:17:59,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:17:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:17:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:17:59,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:59,053 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:17:59,053 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:17:59,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:59,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 10:17:59,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:00,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:00,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:18:00,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:18:00,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:18:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:00,643 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:18:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:02,845 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:18:02,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:18:02,845 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:18:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:02,847 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:18:02,847 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:18:02,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:18:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:18:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:18:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:18:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:18:02,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:18:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:02,850 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:18:02,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:18:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:18:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:18:02,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:02,851 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:18:02,851 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:18:02,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:02,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 315 conjunts are in the unsatisfiable core [2019-08-05 10:18:02,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:04,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:04,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:18:04,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:18:04,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:18:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:04,420 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:18:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:06,595 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:18:06,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:18:06,595 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:18:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:06,596 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:18:06,596 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:18:06,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:18:06,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:18:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:18:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:18:06,599 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:18:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:06,599 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:18:06,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:18:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:18:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:18:06,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:06,600 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:18:06,600 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:18:06,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:06,659 WARN L254 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 321 conjunts are in the unsatisfiable core [2019-08-05 10:18:06,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:08,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:08,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:18:08,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:18:08,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:18:08,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:18:08,574 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:18:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,875 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:18:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:18:10,876 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:18:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,877 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:18:10,877 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:18:10,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:18:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:18:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:18:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:18:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:18:10,880 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:18:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,881 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:18:10,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:18:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:18:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:18:10,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,881 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:18:10,882 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:18:10,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:10,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 327 conjunts are in the unsatisfiable core [2019-08-05 10:18:10,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:12,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:12,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:18:12,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:18:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:18:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:12,841 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:18:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:15,147 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:18:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:18:15,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:18:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:15,148 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:18:15,149 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:18:15,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:18:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:18:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:18:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:18:15,151 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:18:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:15,152 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:18:15,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:18:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:18:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:18:15,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:15,152 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:18:15,153 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:18:15,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:15,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 333 conjunts are in the unsatisfiable core [2019-08-05 10:18:15,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:18:16,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:18:16,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:18:16,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:18:16,901 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:18:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,393 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:18:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:18:19,393 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:18:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,394 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:18:19,394 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:18:19,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:18:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:18:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:18:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:18:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:18:19,397 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:18:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,397 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:18:19,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:18:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:18:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:18:19,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,398 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:18:19,398 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:18:19,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 339 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:21,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:21,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:18:21,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:18:21,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:18:21,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:18:21,219 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:18:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:23,891 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:18:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:18:23,892 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:18:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:23,893 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:18:23,893 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:18:23,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:18:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:18:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:18:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:18:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:18:23,896 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:18:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:23,897 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:18:23,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:18:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:18:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:18:23,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:23,897 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:18:23,898 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:18:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:23,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 345 conjunts are in the unsatisfiable core [2019-08-05 10:18:23,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:25,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:25,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:18:25,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:18:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:18:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:18:25,787 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:18:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:28,531 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:18:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:18:28,531 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:18:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:28,532 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:18:28,532 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:18:28,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:18:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:18:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:18:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:18:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:18:28,536 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:18:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:28,536 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:18:28,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:18:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:18:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:18:28,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:28,537 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:18:28,537 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:18:28,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:28,624 WARN L254 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 351 conjunts are in the unsatisfiable core [2019-08-05 10:18:28,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:18:30,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:18:30,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:18:30,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:18:30,477 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:18:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:33,223 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:18:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:18:33,224 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:18:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:33,224 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:18:33,225 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:18:33,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:18:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:18:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:18:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:18:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:18:33,228 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:18:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:33,228 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:18:33,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:18:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:18:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:18:33,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:33,229 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:18:33,229 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:18:33,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:33,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 357 conjunts are in the unsatisfiable core [2019-08-05 10:18:33,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:35,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:35,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:18:35,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:18:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:18:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:18:35,466 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:18:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:38,371 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:18:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:18:38,371 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:18:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:38,371 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:18:38,371 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:18:38,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:18:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:18:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:18:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:18:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:18:38,373 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:18:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:38,373 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:18:38,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:18:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:18:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:18:38,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:38,374 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:18:38,374 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:38,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:18:38,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:38,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 363 conjunts are in the unsatisfiable core [2019-08-05 10:18:38,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:40,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:40,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:18:40,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:18:40,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:18:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:18:40,570 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:18:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:43,645 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:18:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:18:43,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:18:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:43,646 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:18:43,647 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:18:43,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:18:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:18:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:18:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:18:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:18:43,649 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:18:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:43,650 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:18:43,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:18:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:18:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:18:43,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:43,650 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:18:43,650 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:18:43,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:43,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 369 conjunts are in the unsatisfiable core [2019-08-05 10:18:43,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:45,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:45,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:18:45,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:18:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:18:45,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:18:45,834 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:18:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:48,856 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:18:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:18:48,856 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:18:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:48,857 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:18:48,857 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:18:48,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:18:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:18:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:18:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:18:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:18:48,860 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:18:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:48,860 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:18:48,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:18:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:18:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:18:48,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:48,861 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:18:48,862 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:18:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:48,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 375 conjunts are in the unsatisfiable core [2019-08-05 10:18:48,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:51,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:51,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:18:51,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:18:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:18:51,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:18:51,054 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:18:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:54,265 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:18:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:18:54,265 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:18:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:54,266 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:18:54,266 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:18:54,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:18:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:18:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:18:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:18:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:18:54,269 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:18:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:54,269 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:18:54,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:18:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:18:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:18:54,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:54,270 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:18:54,271 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:18:54,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:54,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 381 conjunts are in the unsatisfiable core [2019-08-05 10:18:54,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:56,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:56,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:18:56,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:18:56,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:18:56,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:18:56,527 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:18:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:59,768 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:18:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:18:59,769 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:18:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:59,770 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:18:59,770 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:18:59,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:18:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:18:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:18:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:18:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:18:59,772 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:18:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:59,773 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:18:59,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:18:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:18:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:18:59,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:59,773 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:18:59,774 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:18:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:59,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 387 conjunts are in the unsatisfiable core [2019-08-05 10:18:59,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:02,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:02,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:19:02,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:19:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:19:02,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:02,114 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:19:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:05,548 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:19:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:19:05,548 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:19:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:05,549 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:19:05,549 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:19:05,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:19:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:19:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:19:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:19:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:19:05,552 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:19:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:05,553 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:19:05,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:19:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:19:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:19:05,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:05,554 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:19:05,554 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:05,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:19:05,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:05,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 393 conjunts are in the unsatisfiable core [2019-08-05 10:19:05,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:08,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:08,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:19:08,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:19:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:19:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:08,704 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:19:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:12,194 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:19:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:19:12,195 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:19:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:12,195 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:19:12,196 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:19:12,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:19:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:19:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:19:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:19:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:19:12,198 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:19:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:12,199 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:19:12,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:19:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:19:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:19:12,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:12,199 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:19:12,200 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:19:12,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 399 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:15,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:15,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:19:15,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:19:15,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:19:15,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:15,076 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:19:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:18,555 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:19:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:19:18,556 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:19:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:18,556 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:19:18,557 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:19:18,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:19:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:19:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:19:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:19:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:19:18,559 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:19:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:18,560 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:19:18,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:19:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:19:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:19:18,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:18,561 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:19:18,561 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:19:18,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:18,669 WARN L254 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 405 conjunts are in the unsatisfiable core [2019-08-05 10:19:18,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:21,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:21,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:19:21,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:19:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:19:21,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:21,761 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:19:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:25,483 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:19:25,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:19:25,483 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:19:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:25,484 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:19:25,484 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:19:25,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:19:25,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:19:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:19:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:19:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:19:25,487 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:19:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:25,487 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:19:25,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:19:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:19:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:19:25,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:25,488 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:19:25,488 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:19:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:25,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 411 conjunts are in the unsatisfiable core [2019-08-05 10:19:25,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:28,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:28,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:19:28,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:19:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:19:28,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:19:28,136 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:19:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:31,978 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:19:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:19:31,978 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:19:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:31,979 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:19:31,979 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:19:31,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:19:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:19:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:19:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:19:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:19:31,982 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:19:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:31,982 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:19:31,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:19:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:19:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:19:31,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:31,983 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:19:31,983 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:19:31,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:32,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 417 conjunts are in the unsatisfiable core [2019-08-05 10:19:32,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:34,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:34,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:19:34,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:19:34,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:19:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:19:34,843 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:19:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:38,602 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:19:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:19:38,602 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:19:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:38,603 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:19:38,603 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:19:38,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:19:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:19:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:19:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:19:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:19:38,606 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:19:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:38,606 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:19:38,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:19:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:19:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:19:38,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:38,607 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:19:38,608 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:19:38,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:38,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 423 conjunts are in the unsatisfiable core [2019-08-05 10:19:38,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:19:41,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:19:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:19:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:19:41,689 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:19:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:45,771 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:19:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:19:45,772 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:19:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:45,773 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:19:45,773 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:19:45,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:19:45,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:19:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:19:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:19:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:19:45,776 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:19:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:45,776 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:19:45,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:19:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:19:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:19:45,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:45,777 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:19:45,778 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:45,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:19:45,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:45,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 429 conjunts are in the unsatisfiable core [2019-08-05 10:19:46,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:48,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:48,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:19:48,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:19:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:19:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:19:48,724 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:19:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:52,845 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:19:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:19:52,846 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:19:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:52,847 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:19:52,847 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:19:52,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:19:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:19:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:19:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:19:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:19:52,850 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:19:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:52,851 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:19:52,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:19:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:19:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:19:52,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:52,852 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:19:52,852 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:19:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:53,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 435 conjunts are in the unsatisfiable core [2019-08-05 10:19:53,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:56,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:56,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:19:56,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:19:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:19:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:19:56,196 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:20:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:00,455 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:20:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:20:00,456 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:20:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:00,457 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:20:00,457 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:20:00,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:20:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:20:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:20:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:20:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:20:00,460 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:20:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:00,460 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:20:00,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:20:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:20:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:20:00,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:00,461 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:20:00,461 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:20:00,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:00,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 441 conjunts are in the unsatisfiable core [2019-08-05 10:20:00,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:04,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:04,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:20:04,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:20:04,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:20:04,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:20:04,045 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:20:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:08,401 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:20:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:20:08,401 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:20:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:08,402 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:20:08,402 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:20:08,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:20:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:20:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:20:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:20:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:20:08,405 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:20:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:08,405 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:20:08,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:20:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:20:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:20:08,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:08,406 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:20:08,406 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:20:08,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:08,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 447 conjunts are in the unsatisfiable core [2019-08-05 10:20:08,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:11,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:11,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:20:11,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:20:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:20:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:20:11,642 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:20:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:16,062 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:20:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:20:16,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:20:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:16,064 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:20:16,064 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:20:16,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:20:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:20:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:20:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:20:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:20:16,067 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:20:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:16,067 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:20:16,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:20:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:20:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:20:16,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:16,067 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:20:16,068 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:20:16,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:16,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 453 conjunts are in the unsatisfiable core [2019-08-05 10:20:16,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:21,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:20:21,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:20:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:20:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:21,228 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:20:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:25,729 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:20:25,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:20:25,730 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:20:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:25,730 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:20:25,730 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:20:25,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:20:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:20:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:20:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:20:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:20:25,732 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:20:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:25,733 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:20:25,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:20:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:20:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:20:25,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:25,734 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:20:25,734 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:20:25,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:25,870 WARN L254 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 459 conjunts are in the unsatisfiable core [2019-08-05 10:20:25,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:28,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:28,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:20:28,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:20:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:20:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:20:28,918 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:20:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:33,479 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:20:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:20:33,480 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:20:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:33,480 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:20:33,481 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:20:33,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:20:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:20:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:20:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:20:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:20:33,483 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:20:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:33,484 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:20:33,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:20:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:20:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:20:33,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:33,485 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:20:33,485 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:33,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:20:33,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:33,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 465 conjunts are in the unsatisfiable core [2019-08-05 10:20:33,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:36,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:36,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:20:36,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:20:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:20:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:20:36,917 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:20:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:41,768 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:20:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:20:41,769 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:20:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:41,770 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:20:41,770 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:20:41,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:20:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:20:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:20:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:20:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:20:41,773 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:20:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:41,773 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:20:41,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:20:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:20:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:20:41,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:41,773 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:20:41,774 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:20:41,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:42,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 471 conjunts are in the unsatisfiable core [2019-08-05 10:20:42,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:45,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:45,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:20:45,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:20:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:20:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:20:45,298 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. Received shutdown request... [2019-08-05 10:20:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:20:49,329 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:20:49,335 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:20:49,336 INFO L202 PluginConnector]: Adding new model cggmp2005_variant.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:20:49 BoogieIcfgContainer [2019-08-05 10:20:49,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:20:49,338 INFO L168 Benchmark]: Toolchain (without parser) took 251233.45 ms. Allocated memory was 141.0 MB in the beginning and 366.0 MB in the end (delta: 224.9 MB). Free memory was 108.2 MB in the beginning and 324.7 MB in the end (delta: -216.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:49,339 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 109.4 MB in the beginning and 109.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:20:49,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.39 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:49,340 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 ms. Allocated memory is still 141.0 MB. Free memory was 106.4 MB in the beginning and 105.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:49,341 INFO L168 Benchmark]: RCFGBuilder took 263.76 ms. Allocated memory is still 141.0 MB. Free memory was 105.2 MB in the beginning and 95.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:20:49,343 INFO L168 Benchmark]: TraceAbstraction took 250903.92 ms. Allocated memory was 141.0 MB in the beginning and 366.0 MB in the end (delta: 224.9 MB). Free memory was 95.6 MB in the beginning and 324.7 MB in the end (delta: -229.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:20:49,345 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.23 ms. Allocated memory is still 141.0 MB. Free memory was 109.4 MB in the beginning and 109.2 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 38.39 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.50 ms. Allocated memory is still 141.0 MB. Free memory was 106.4 MB in the beginning and 105.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 263.76 ms. Allocated memory is still 141.0 MB. Free memory was 105.2 MB in the beginning and 95.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250903.92 ms. Allocated memory was 141.0 MB in the beginning and 366.0 MB in the end (delta: 224.9 MB). Free memory was 95.6 MB in the beginning and 324.7 MB in the end (delta: -229.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and FLOYD_HOARE automaton (currently 61 states, 80 states before enhancement),while ReachableStatesComputation was computing reachable states (59 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 250.8s OverallTime, 78 OverallIterations, 77 TraceHistogramMax, 135.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 0 SDslu, 3003 SDs, 0 SdLazy, 165762 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3159 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3081 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 77 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 110.0s InterpolantComputationTime, 3237 NumberOfCodeBlocks, 3237 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 3159 ConstructedInterpolants, 77 QuantifiedInterpolants, 1835920 SizeOfPredicates, 385 NumberOfNonLiveVariables, 22581 ConjunctsInSsa, 18713 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79079 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown