java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:28:38,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:28:38,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:28:38,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:28:38,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:28:38,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:28:38,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:28:38,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:28:38,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:28:38,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:28:38,143 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:28:38,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:28:38,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:28:38,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:28:38,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:28:38,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:28:38,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:28:38,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:28:38,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:28:38,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:28:38,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:28:38,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:28:38,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:28:38,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:28:38,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:28:38,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:28:38,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:28:38,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:28:38,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:28:38,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:28:38,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:28:38,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:28:38,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:28:38,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:28:38,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:28:38,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:28:38,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:28:38,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:28:38,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:28:38,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:28:38,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:28:38,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:28:38,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:28:38,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:28:38,242 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:28:38,243 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:28:38,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl [2019-08-05 10:28:38,244 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl' [2019-08-05 10:28:38,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:28:38,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:28:38,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:28:38,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:28:38,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:28:38,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:28:38,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:28:38,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:28:38,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:28:38,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/1) ... [2019-08-05 10:28:38,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:28:38,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:28:38,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:28:38,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:28:38,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28: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:28:38,425 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:28:38,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:28:38,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:28:38,605 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:28:38,605 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:28:38,606 INFO L202 PluginConnector]: Adding new model phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:28:38 BoogieIcfgContainer [2019-08-05 10:28:38,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:28:38,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:28:38,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:28:38,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:28:38,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:28:38" (1/2) ... [2019-08-05 10:28:38,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512aa1be and model type phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:28:38, skipping insertion in model container [2019-08-05 10:28:38,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:28:38" (2/2) ... [2019-08-05 10:28:38,615 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_false-unreach-call1.i_3.bpl [2019-08-05 10:28:38,624 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:28:38,632 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:28:38,648 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:28:38,674 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:28:38,675 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:28:38,675 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:28:38,675 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:28:38,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:28:38,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:28:38,676 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:28:38,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:28:38,676 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:28:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:28:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:28:38,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:38,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:28:38,702 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:38,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:28:38,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:38,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:28:38,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:38,837 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:28:38,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:28:38,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:28:38,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:28:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:28:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:28:38,862 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:28:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:38,899 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:28:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:28:38,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:28:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:38,912 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:28:38,912 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:28:38,915 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:28:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:28:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:28:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:28:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:28:38,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:28:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:38,946 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:28:38,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:28:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:28:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:28:38,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:38,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:28:38,948 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:38,948 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:28:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:38,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:28:38,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:39,105 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:28:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:28:39,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:28:39,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:28:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:28:39,109 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:28:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:39,162 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:28:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:28:39,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:28:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:39,164 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:28:39,164 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:28:39,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:28:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:28:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:28:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:28:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:28:39,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:28:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:39,168 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:28:39,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:28:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:28:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:28:39,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:39,169 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:28:39,169 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:39,170 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:28:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:39,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:28:39,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:39,287 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:28:39,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:39,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:28:39,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:28:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:28:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:28:39,289 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:28:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:39,347 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:28:39,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:28:39,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:28:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:39,349 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:28:39,349 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:28:39,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:28:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:28:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:28:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:28:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:28:39,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:28:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:39,353 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:28:39,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:28:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:28:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:28:39,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:39,353 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:28:39,354 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:28:39,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:39,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:28:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:39,466 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:28:39,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:39,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:28:39,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:28:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:28:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:28:39,468 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:28:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:39,577 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:28:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:28:39,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:28:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:39,578 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:28:39,578 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:28:39,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:28:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:28:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:28:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:28:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:28:39,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:28:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:39,581 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:28:39,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:28:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:28:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:28:39,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:39,582 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:28:39,582 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:28:39,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:39,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:28:39,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:39,741 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:28:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:39,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:28:39,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:28:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:28:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:28:39,743 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:28:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:39,929 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:28:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:28:39,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:28:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:39,931 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:28:39,931 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:28:39,932 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:28:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:28:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:28:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:28:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:28:39,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:28:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:39,935 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:28:39,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:28:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:28:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:28:39,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:39,936 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:28:39,936 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:28:39,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:39,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:28:39,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:40,101 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:28:40,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:40,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:28:40,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:28:40,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:28:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:28:40,104 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:28:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:40,276 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:28:40,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:28:40,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:28:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:40,278 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:28:40,278 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:28:40,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:28:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:28:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:28:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:28:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:28:40,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:28:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:40,281 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:28:40,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:28:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:28:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:28:40,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:40,282 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:28:40,285 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:28:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:40,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:28:40,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:40,431 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:28:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:40,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:28:40,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:28:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:28:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:28:40,433 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:28:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:40,513 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:28:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:28:40,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:28:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:40,515 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:28:40,517 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:28:40,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:28:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:28:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:28:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:28:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:28:40,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:28:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:40,520 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:28:40,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:28:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:28:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:28:40,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:40,521 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:28:40,521 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:28:40,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:40,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:28:40,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:40,947 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:28:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:28:40,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:28:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:28:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:28:40,949 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:28:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:41,040 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:28:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:28:41,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:28:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:41,041 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:28:41,041 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:28:41,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:28:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:28:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:28:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:28:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:28:41,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:28:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:41,044 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:28:41,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:28:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:28:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:28:41,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:41,045 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:28:41,045 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:28:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:41,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:28:41,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:41,432 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:28:41,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:41,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:28:41,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:28:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:28:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:28:41,434 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:28:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:41,533 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:28:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:28:41,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:28:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:41,535 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:28:41,535 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:28:41,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:28:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:28:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:28:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:28:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:28:41,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:28:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:41,539 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:28:41,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:28:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:28:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:28:41,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:41,540 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:28:41,541 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:28:41,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:41,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:28:41,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:41,725 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:28:41,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:41,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:28:41,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:28:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:28:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:28:41,726 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:28:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:41,920 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:28:41,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:28:41,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:28:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:41,922 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:28:41,922 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:28:41,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:28:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:28:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:28:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:28:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:28:41,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:28:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:41,926 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:28:41,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:28:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:28:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:28:41,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:41,927 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:28:41,927 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:28:41,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:41,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:28:41,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:42,312 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:28:42,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:28:42,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:28:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:28:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:28:42,314 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:28:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:42,536 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:28:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:28:42,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:28:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:42,544 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:28:42,544 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:28:42,545 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:28:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:28:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:28:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:28:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:28:42,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:28:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:42,547 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:28:42,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:28:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:28:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:28:42,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:42,548 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:28:42,549 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:28:42,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:42,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:28:42,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:42,756 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:28:42,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:28:42,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:28:42,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:28:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:28:42,757 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:28:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:42,902 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:28:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:28:42,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:28:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:42,904 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:28:42,904 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:28:42,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:28:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:28:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:28:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:28:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:28:42,908 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:28:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:42,908 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:28:42,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:28:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:28:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:28:42,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:42,909 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:28:42,909 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:42,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:42,910 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:28:42,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:42,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:28:42,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:43,158 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:28:43,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:43,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:28:43,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:28:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:28:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:28:43,160 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:28:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:43,336 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:28:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:28:43,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:28:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:43,343 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:28:43,343 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:28:43,344 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:28:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:28:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:28:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:28:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:28:43,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:28:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:43,347 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:28:43,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:28:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:28:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:28:43,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:43,348 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:28:43,349 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:28:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:43,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:28:43,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:43,675 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:28:43,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:43,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:28:43,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:28:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:28:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:28:43,677 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:28:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:43,856 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:28:43,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:28:43,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:28:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:43,858 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:28:43,858 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:28:43,859 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:28:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:28:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:28:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:28:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:28:43,862 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:28:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:43,862 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:28:43,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:28:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:28:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:28:43,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:43,863 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:28:43,864 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:28:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:43,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:28:43,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:44,087 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:28:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:28:44,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:28:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:28:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:28:44,088 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:28:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:44,302 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:28:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:28:44,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:28:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:44,303 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:28:44,304 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:28:44,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:28:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:28:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:28:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:28:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:28:44,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:28:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:44,308 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:28:44,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:28:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:28:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:28:44,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:44,309 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:28:44,309 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:28:44,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:44,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:28:44,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:45,231 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:28:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:28:45,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:28:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:28:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:28:45,233 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:28:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:45,493 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:28:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:28:45,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:28:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:45,495 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:28:45,495 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:28:45,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:28:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:28:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:28:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:28:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:28:45,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:28:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:45,500 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:28:45,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:28:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:28:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:28:45,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:45,501 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:28:45,501 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:28:45,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:45,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:28:45,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:46,026 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:28:46,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:46,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:28:46,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:28:46,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:28:46,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:28:46,029 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:28:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:46,285 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:28:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:28:46,285 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:28:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:46,286 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:28:46,286 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:28:46,287 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:28:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:28:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:28:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:28:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:28:46,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:28:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:46,291 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:28:46,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:28:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:28:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:28:46,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:46,292 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:28:46,292 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:28:46,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:46,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:28:46,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:46,495 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:28:46,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:46,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:28:46,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:28:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:28:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:28:46,497 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:28:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:46,852 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:28:46,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:28:46,853 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:28:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:46,854 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:28:46,854 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:28:46,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:28:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:28:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:28:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:28:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:28:46,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:28:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:46,858 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:28:46,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:28:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:28:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:28:46,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:46,859 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:28:46,859 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:28:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:46,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:28:46,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:47,154 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:28:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:28:47,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:28:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:28:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:28:47,156 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:28:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:47,652 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:28:47,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:28:47,652 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:28:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:47,653 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:28:47,653 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:28:47,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:28:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:28:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:28:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:28:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:28:47,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:28:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:47,658 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:28:47,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:28:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:28:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:28:47,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:47,659 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:28:47,659 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:28:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:47,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:28:47,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:47,919 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:28:47,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:47,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:28:47,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:28:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:28:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:28:47,921 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:28:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:48,275 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:28:48,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:28:48,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:28:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:48,282 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:28:48,282 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:28:48,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:28:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:28:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:28:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:28:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:28:48,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:28:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:48,285 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:28:48,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:28:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:28:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:28:48,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:48,286 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:28:48,286 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:28:48,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:48,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:28:48,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:48,566 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:28:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:48,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:28:48,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:28:48,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:28:48,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:28:48,569 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:28:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:48,939 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:28:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:28:48,940 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:28:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:48,941 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:28:48,941 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:28:48,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:28:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:28:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:28:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:28:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:28:48,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:28:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:48,944 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:28:48,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:28:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:28:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:28:48,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:48,945 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:28:48,945 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:28:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:48,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:28:48,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:49,414 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:28:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:49,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:28:49,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:28:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:28:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:28:49,415 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:28:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:49,863 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:28:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:28:49,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:28:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:49,866 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:28:49,866 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:28:49,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:28:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:28:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:28:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:28:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:28:49,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:28:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:49,869 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:28:49,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:28:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:28:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:28:49,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:49,871 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:28:49,871 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:28:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:49,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:28:49,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:50,204 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:28:50,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:28:50,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:28:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:28:50,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:28:50,206 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:28:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:51,050 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:28:51,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:28:51,052 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:28:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:51,052 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:28:51,052 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:28:51,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:28:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:28:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:28:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:28:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:28:51,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:28:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:51,056 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:28:51,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:28:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:28:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:28:51,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:51,056 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:28:51,057 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:28:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:51,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:28:51,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:51,590 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:28:51,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:51,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:28:51,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:28:51,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:28:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:28:51,591 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:28:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:52,259 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:28:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:28:52,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:28:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:52,260 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:28:52,260 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:28:52,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:28:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:28:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:28:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:28:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:28:52,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:28:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:52,266 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:28:52,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:28:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:28:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:28:52,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:52,267 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:28:52,268 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:28:52,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:52,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:28:52,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:52,896 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:28:52,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:52,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:28:52,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:28:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:28:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:28:52,898 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:28:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:53,400 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:28:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:28:53,401 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:28:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:53,401 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:28:53,402 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:28:53,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:28:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:28:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:28:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:28:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:28:53,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:28:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:53,406 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:28:53,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:28:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:28:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:28:53,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:53,407 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:28:53,408 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:28:53,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:53,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:28:53,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:53,728 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:28:53,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:53,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:28:53,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:28:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:28:53,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:28:53,730 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:28:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:54,243 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:28:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:28:54,243 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:28:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:54,244 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:28:54,244 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:28:54,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:28:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:28:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:28:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:28:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:28:54,247 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:28:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:54,248 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:28:54,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:28:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:28:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:28:54,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:54,249 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:28:54,249 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:28:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:54,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:28:54,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:55,587 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:28:55,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:55,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:28:55,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:28:55,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:28:55,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:28:55,589 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:28:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:56,163 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:28:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:28:56,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:28:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:56,165 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:28:56,165 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:28:56,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:28:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:28:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:28:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:28:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:28:56,169 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:28:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:56,169 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:28:56,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:28:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:28:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:28:56,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:56,170 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:28:56,170 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:28:56,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:56,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:28:56,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:56,611 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:28:56,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:56,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:28:56,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:28:56,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:28:56,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:28:56,612 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:28:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:57,233 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:28:57,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:28:57,234 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:28:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:57,234 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:28:57,234 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:28:57,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:28:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:28:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:28:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:28:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:28:57,238 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:28:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:57,239 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:28:57,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:28:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:28:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:28:57,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:57,239 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:28:57,240 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:28:57,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:57,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:28:57,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:57,912 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:28:57,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:57,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:28:57,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:28:57,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:28:57,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:28:57,913 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:28:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:28:58,571 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:28:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:28:58,571 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:28:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:28:58,572 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:28:58,572 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:28:58,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:28:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:28:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:28:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:28:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:28:58,576 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:28:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:28:58,576 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:28:58,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:28:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:28:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:28:58,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:28:58,577 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:28:58,577 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:28:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:28:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:28:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:28:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:28:58,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:28:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:28:59,578 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:28:59,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:28:59,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:28:59,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:28:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:28:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:28:59,580 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:29:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:00,259 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:29:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:29:00,260 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:29:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:00,260 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:29:00,261 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:29:00,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:29:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:29:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:29:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:29:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:29:00,265 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:29:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:00,265 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:29:00,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:29:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:29:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:29:00,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:00,266 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:29:00,266 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:29:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:00,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:29:00,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:00,710 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:29:00,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:00,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:29:00,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:29:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:29:00,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:29:00,712 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:29:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:01,425 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:29:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:29:01,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:29:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:01,426 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:29:01,426 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:29:01,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:29:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:29:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:29:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:29:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:29:01,430 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:29:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:01,430 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:29:01,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:29:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:29:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:29:01,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:01,431 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:29:01,431 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:29:01,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:01,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:29:01,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:01,959 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:29:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:01,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:29:01,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:29:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:29:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:29:01,961 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:29:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:02,766 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:29:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:29:02,766 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:29:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:02,767 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:29:02,767 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:29:02,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:29:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:29:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:29:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:29:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:29:02,772 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:29:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:02,772 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:29:02,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:29:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:29:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:29:02,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:02,773 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:29:02,773 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:29:02,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:02,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:29:02,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:03,426 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:29:03,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:03,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:29:03,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:29:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:29:03,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:29:03,428 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:29:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:04,290 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:29:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:29:04,290 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:29:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:04,291 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:29:04,291 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:29:04,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:29:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:29:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:29:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:29:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:29:04,295 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:29:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:04,296 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:29:04,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:29:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:29:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:29:04,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:04,296 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:29:04,297 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:29:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:04,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:29:04,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:05,659 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:29:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:29:05,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:29:05,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:29:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:29:05,661 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:29:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:06,517 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:29:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:29:06,518 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:29:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:06,518 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:29:06,518 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:29:06,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:29:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:29:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:29:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:29:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:29:06,521 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:29:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:06,522 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:29:06,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:29:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:29:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:29:06,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:06,522 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:29:06,523 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:29:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:06,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:29:06,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:07,187 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:29:07,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:07,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:29:07,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:29:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:29:07,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:29:07,188 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:29:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:08,244 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:29:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:29:08,245 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:29:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:08,246 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:29:08,246 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:29:08,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:29:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:29:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:29:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:29:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:29:08,249 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:29:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:08,250 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:29:08,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:29:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:29:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:29:08,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:08,250 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:29:08,251 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:29:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:08,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:29:08,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:08,930 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:29:08,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:08,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:29:08,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:29:08,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:29:08,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:29:08,932 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:29:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:09,945 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:29:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:29:09,946 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:29:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:09,946 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:29:09,947 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:29:09,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:29:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:29:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:29:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:29:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:29:09,950 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:29:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:09,950 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:29:09,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:29:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:29:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:29:09,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:09,951 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:29:09,951 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:09,951 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:29:09,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:09,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:29:09,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:10,696 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:29:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:29:10,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:29:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:29:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:29:10,698 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:29:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:11,749 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:29:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:29:11,750 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:29:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:11,750 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:29:11,750 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:29:11,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:29:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:29:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:29:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:29:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:29:11,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:29:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:11,754 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:29:11,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:29:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:29:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:29:11,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:11,755 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:29:11,755 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:29:11,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:11,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:29:11,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:12,550 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:29:12,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:12,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:29:12,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:29:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:29:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:29:12,552 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:29:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:13,787 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:29:13,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:29:13,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:29:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:13,788 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:29:13,789 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:29:13,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:29:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:29:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:29:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:29:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:29:13,792 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:29:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:13,792 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:29:13,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:29:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:29:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:29:13,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:13,793 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:29:13,793 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:29:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:13,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:29:13,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:14,562 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:29:14,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:14,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:29:14,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:29:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:29:14,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:29:14,564 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:29:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:15,708 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:29:15,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:29:15,708 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:29:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:15,709 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:29:15,709 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:29:15,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:29:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:29:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:29:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:29:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:29:15,712 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:29:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:15,713 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:29:15,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:29:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:29:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:29:15,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:15,713 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:29:15,714 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:29:15,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:15,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:29:15,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:16,454 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:29:16,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:16,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:29:16,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:29:16,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:29:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:29:16,456 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:29:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:17,724 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:29:17,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:29:17,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:29:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:17,725 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:29:17,725 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:29:17,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:29:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:29:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:29:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:29:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:29:17,728 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:29:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:17,729 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:29:17,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:29:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:29:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:29:17,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:17,729 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:29:17,730 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:29:17,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:17,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:29:17,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:18,754 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:29:18,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:18,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:29:18,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:29:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:29:18,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:29:18,756 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:29:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:20,002 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:29:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:29:20,002 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:29:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:20,003 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:29:20,003 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:29:20,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:29:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:29:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:29:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:29:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:29:20,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:29:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:20,006 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:29:20,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:29:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:29:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:29:20,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:20,007 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:29:20,007 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:29:20,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:20,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:29:20,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:20,836 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:29:20,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:20,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:29:20,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:29:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:29:20,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:29:20,839 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:29:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:22,137 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:29:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:29:22,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:29:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:22,138 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:29:22,138 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:29:22,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:29:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:29:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:29:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:29:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:29:22,141 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:29:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:22,141 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:29:22,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:29:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:29:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:29:22,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:22,142 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:29:22,142 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:29:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:22,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:29:22,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:23,440 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:29:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:23,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:29:23,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:29:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:29:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:29:23,442 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:29:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:24,850 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:29:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:29:24,850 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:29:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:24,851 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:29:24,851 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:29:24,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:29:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:29:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:29:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:29:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:29:24,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:29:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:24,855 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:29:24,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:29:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:29:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:29:24,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:24,856 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:29:24,856 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:29:24,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:24,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:29:24,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:25,701 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:29:25,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:29:25,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:29:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:29:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:29:25,702 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:29:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:27,118 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:29:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:29:27,118 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:29:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:27,119 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:29:27,119 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:29:27,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:29:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:29:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:29:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:29:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:29:27,122 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:29:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:27,123 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:29:27,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:29:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:29:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:29:27,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:27,124 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:29:27,125 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:29:27,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:27,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:29:27,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:28,185 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:29:28,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:28,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:29:28,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:29:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:29:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:29:28,186 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:29:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:29,869 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:29:29,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:29:29,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:29:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:29,870 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:29:29,871 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:29:29,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:29:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:29:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:29:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:29:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:29:29,874 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:29:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:29,874 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:29:29,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:29:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:29:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:29:29,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:29,875 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:29:29,876 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:29:29,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:29,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:29:29,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:30,768 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:29:30,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:30,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:29:30,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:29:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:29:30,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:29:30,770 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:29:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:32,343 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:29:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:29:32,343 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:29:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:32,344 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:29:32,344 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:29:32,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:29:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:29:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:29:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:29:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:29:32,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:29:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:32,347 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:29:32,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:29:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:29:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:29:32,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:32,348 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:29:32,348 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:29:32,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:32,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:29:32,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:33,469 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:29:33,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:33,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:29:33,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:29:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:29:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:29:33,470 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:29:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:35,230 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:29:35,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:29:35,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:29:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:35,236 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:29:35,236 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:29:35,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:29:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:29:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:29:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:29:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:29:35,238 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:29:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:35,238 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:29:35,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:29:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:29:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:29:35,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:35,239 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:29:35,239 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:29:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:35,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:29:35,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:36,724 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:29:36,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:36,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:29:36,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:29:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:29:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:29:36,725 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:29:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:38,487 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:29:38,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:29:38,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:29:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:38,488 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:29:38,488 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:29:38,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:29:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:29:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:29:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:29:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:29:38,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:29:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:38,492 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:29:38,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:29:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:29:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:29:38,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:38,493 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:29:38,493 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:29:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:38,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:29:38,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:39,714 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:29:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:29:39,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:29:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:29:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:29:39,716 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:29:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:41,498 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:29:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:29:41,498 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:29:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:41,499 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:29:41,499 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:29:41,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:29:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:29:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:29:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:29:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:29:41,502 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:29:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:41,503 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:29:41,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:29:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:29:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:29:41,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:41,503 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:29:41,504 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:29:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:41,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:29:41,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:42,595 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:29:42,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:42,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:29:42,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:29:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:29:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:29:42,596 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:29:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:44,610 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:29:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:29:44,610 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:29:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:44,611 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:29:44,611 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:29:44,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:29:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:29:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:29:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:29:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:29:44,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:29:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:44,615 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:29:44,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:29:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:29:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:29:44,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:44,616 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:29:44,616 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:29:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:44,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:29:44,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:45,669 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:29:45,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:45,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:29:45,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:29:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:29:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:29:45,671 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:29:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:47,613 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:29:47,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:29:47,614 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:29:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:47,615 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:29:47,615 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:29:47,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:29:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:29:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:29:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:29:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:29:47,617 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:29:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:47,617 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:29:47,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:29:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:29:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:29:47,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:47,618 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:29:47,618 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:29:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:47,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:29:47,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:49,280 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:29:49,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:49,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:29:49,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:29:49,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:29:49,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:29:49,281 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:29:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:51,286 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:29:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:29:51,287 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:29:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:51,288 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:29:51,288 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:29:51,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:29:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:29:51,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:29:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:29:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:29:51,290 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:29:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:51,290 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:29:51,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:29:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:29:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:29:51,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:51,291 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:29:51,291 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:51,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:51,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:29:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:51,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:29:51,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:52,533 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:29:52,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:52,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:29:52,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:29:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:29:52,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:29:52,535 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:29:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:54,783 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:29:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:29:54,784 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:29:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:54,785 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:29:54,785 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:29:54,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:29:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:29:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:29:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:29:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:29:54,788 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:29:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:54,789 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:29:54,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:29:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:29:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:29:54,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:54,789 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:29:54,790 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:29:54,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:54,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:29:54,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:55,962 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:29:55,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:55,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:29:55,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:29:55,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:29:55,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:29:55,964 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:29:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:29:58,080 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:29:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:29:58,081 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:29:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:29:58,082 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:29:58,082 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:29:58,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:29:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:29:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:29:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:29:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:29:58,084 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:29:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:29:58,084 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:29:58,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:29:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:29:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:29:58,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:29:58,085 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:29:58,085 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:29:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:29:58,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:29:58,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:29:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:29:58,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:29:58,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:29:59,608 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:29:59,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:29:59,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:29:59,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:29:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:29:59,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:29:59,610 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:30:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:01,927 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:30:01,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:30:01,927 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:30:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:01,928 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:30:01,928 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:30:01,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:30:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:30:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:30:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:30:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:30:01,930 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:30:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:01,931 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:30:01,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:30:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:30:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:30:01,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:01,932 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:30:01,932 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:30:01,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:01,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:30:01,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:03,140 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:30:03,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:03,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:30:03,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:30:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:30:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:30:03,142 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:30:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:05,567 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:30:05,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:30:05,567 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:30:05,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:05,568 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:30:05,568 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:30:05,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:30:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:30:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:30:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:30:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:30:05,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:30:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:05,572 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:30:05,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:30:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:30:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:30:05,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:05,572 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:30:05,573 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:30:05,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:05,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:30:05,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:06,885 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:30:06,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:06,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:30:06,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:30:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:30:06,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:30:06,886 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:30:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:09,437 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:30:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:30:09,437 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:30:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:09,438 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:30:09,438 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:30:09,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:30:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:30:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:30:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:30:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:30:09,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:30:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:09,440 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:30:09,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:30:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:30:09,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:30:09,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:09,442 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:30:09,442 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:30:09,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:09,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:30:09,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:10,880 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:30:10,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:10,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:30:10,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:30:10,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:30:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:30:10,881 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:30:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:13,314 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:30:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:30:13,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:30:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:13,316 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:30:13,316 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:30:13,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:30:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:30:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:30:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:30:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:30:13,319 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:30:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:13,319 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:30:13,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:30:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:30:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:30:13,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:13,320 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:30:13,320 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:30:13,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:13,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:30:13,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:14,820 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:30:14,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:14,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:30:14,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:30:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:30:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:30:14,821 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:30:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:17,478 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:30:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:30:17,478 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:30:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:17,479 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:30:17,479 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:30:17,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:30:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:30:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:30:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:30:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:30:17,481 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:30:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:17,481 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:30:17,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:30:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:30:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:30:17,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:17,482 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:30:17,482 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:30:17,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:17,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:30:17,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:19,047 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:30:19,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:19,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:30:19,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:30:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:30:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:30:19,048 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:30:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:21,814 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:30:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:30:21,815 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:30:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:21,815 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:30:21,816 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:30:21,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:30:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:30:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:30:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:30:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:30:21,818 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:30:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:21,818 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:30:21,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:30:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:30:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:30:21,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:21,819 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:30:21,819 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:30:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:21,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:30:21,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:23,313 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:30:23,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:23,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:30:23,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:30:23,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:30:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:30:23,315 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:30:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:26,374 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:30:26,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:30:26,374 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:30:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:26,375 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:30:26,375 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:30:26,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:30:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:30:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:30:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:30:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:30:26,379 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:30:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:26,379 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:30:26,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:30:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:30:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:30:26,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:26,380 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:30:26,380 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:30:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:26,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:30:26,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:27,922 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:30:27,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:27,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:30:27,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:30:27,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:30:27,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:30:27,923 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:30:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:31,084 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:30:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:30:31,085 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:30:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:31,085 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:30:31,086 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:30:31,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:30:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:30:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:30:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:30:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:30:31,088 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:30:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:31,088 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:30:31,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:30:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:30:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:30:31,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:31,089 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:30:31,089 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:30:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:31,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:30:31,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:33,557 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:30:33,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:30:33,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:30:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:30:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:30:33,559 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:30:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:36,753 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:30:36,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:30:36,754 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:30:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:36,755 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:30:36,755 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:30:36,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:30:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:30:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:30:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:30:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:30:36,757 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:30:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:36,758 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:30:36,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:30:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:30:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:30:36,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:36,758 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:30:36,759 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:36,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:30:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:36,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:30:36,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:38,471 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:30:38,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:38,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:30:38,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:30:38,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:30:38,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:30:38,473 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:30:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:41,642 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:30:41,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:30:41,643 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:30:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:41,644 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:30:41,644 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:30:41,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:30:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:30:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:30:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:30:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:30:41,647 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:30:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:41,647 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:30:41,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:30:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:30:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:30:41,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:41,648 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:30:41,648 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:30:41,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:41,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:30:41,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:43,385 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:30:43,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:43,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:30:43,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:30:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:30:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:30:43,386 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:30:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:46,737 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:30:46,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:30:46,737 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:30:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:46,738 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:30:46,738 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:30:46,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:30:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:30:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:30:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:30:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:30:46,741 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:30:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:46,741 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:30:46,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:30:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:30:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:30:46,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:46,742 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:30:46,742 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:30:46,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:46,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:30:46,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:48,483 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:30:48,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:48,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:30:48,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:30:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:30:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:30:48,484 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:30:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:51,891 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:30:51,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:30:51,892 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:30:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:51,892 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:30:51,892 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:30:51,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:30:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:30:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:30:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:30:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:30:51,895 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:30:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:51,895 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:30:51,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:30:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:30:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:30:51,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:51,896 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:30:51,896 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:30:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:51,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:30:51,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:53,647 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:30:53,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:53,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:30:53,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:30:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:30:53,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:30:53,649 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:30:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:57,117 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:30:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:30:57,117 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:30:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:57,118 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:30:57,118 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:30:57,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:30:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:30:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:30:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:30:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:30:57,121 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:30:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:57,121 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:30:57,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:30:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:30:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:30:57,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:57,122 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:30:57,122 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:30:57,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:57,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:30:57,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:58,981 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:30:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:30:58,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:30:58,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:30:58,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:30:58,983 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:31:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:02,722 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:31:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:31:02,723 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:31:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:02,724 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:31:02,724 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:31:02,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:31:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:31:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:31:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:31:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:31:02,727 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:31:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:02,727 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:31:02,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:31:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:31:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:31:02,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:02,728 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:31:02,728 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:31:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:02,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:31:02,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:04,596 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:31:04,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:04,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:31:04,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:31:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:31:04,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:31:04,598 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:31:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:08,384 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:31:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:31:08,385 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:31:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:08,386 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:31:08,386 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:31:08,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:31:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:31:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:31:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:31:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:31:08,389 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:31:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:08,389 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:31:08,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:31:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:31:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:31:08,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:08,390 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:31:08,390 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:31:08,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:08,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:31:08,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,326 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:31:10,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:31:10,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:31:10,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:31:10,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:31:10,327 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:31:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:14,231 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:31:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:31:14,231 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:31:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:14,232 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:31:14,233 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:31:14,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:31:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:31:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:31:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:31:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:31:14,236 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:31:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:14,236 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:31:14,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:31:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:31:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:31:14,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:14,237 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:31:14,237 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:31:14,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:14,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:31:14,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:16,688 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:31:16,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:16,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:31:16,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:31:16,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:31:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:31:16,690 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:31:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:20,548 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:31:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:31:20,549 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:31:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:20,550 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:31:20,550 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:31:20,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:31:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:31:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:31:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:31:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:31:20,553 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:31:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:20,553 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:31:20,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:31:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:31:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:31:20,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:20,554 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:31:20,554 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:20,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:31:20,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:20,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:31:20,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,146 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:31:23,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:31:23,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:31:23,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:31:23,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:31:23,148 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:31:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,182 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:31:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:31:27,183 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:31:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,184 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:31:27,184 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:31:27,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:31:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:31:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:31:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:31:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:31:27,187 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:31:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,187 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:31:27,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:31:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:31:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:31:27,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,188 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:31:27,188 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:31:27,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,386 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:31:29,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:31:29,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:31:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:31:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:31:29,388 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:31:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,605 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:31:33,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:31:33,605 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:31:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,606 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:31:33,606 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:31:33,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:31:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:31:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:31:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:31:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:31:33,610 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:31:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,610 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:31:33,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:31:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:31:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:31:33,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,611 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:31:33,611 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:31:33,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:35,769 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:31:35,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:35,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:31:35,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:31:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:31:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:31:35,771 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:31:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,135 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:31:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:31:40,136 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:31:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,137 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:31:40,137 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:31:40,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:31:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:31:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:31:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:31:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:31:40,140 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:31:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,140 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:31:40,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:31:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:31:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:31:40,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,141 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:31:40,141 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:31:40,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:42,565 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:31:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:42,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:31:42,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:31:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:31:42,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:31:42,566 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:31:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:46,976 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:31:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:31:46,977 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:31:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:46,978 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:31:46,978 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:31:46,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:31:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:31:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:31:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:31:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:31:46,981 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:31:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:46,981 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:31:46,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:31:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:31:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:31:46,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:46,982 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:31:46,982 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:31:46,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:47,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:31:47,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,219 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:31:49,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:31:49,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:31:49,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:31:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:31:49,220 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:31:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:53,785 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:31:53,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:31:53,786 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:31:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:53,787 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:31:53,787 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:31:53,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:31:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:31:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:31:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:31:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:31:53,790 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:31:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:53,790 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:31:53,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:31:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:31:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:31:53,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:53,791 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:31:53,792 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:31:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:31:53,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:53,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:31:53,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:57,623 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:31:57,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:31:57,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:31:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:31:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:31:57,624 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:32:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:02,312 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:32:02,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:32:02,313 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:32:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:02,314 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:32:02,314 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:32:02,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:32:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:32:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:32:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:32:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:32:02,317 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:32:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:02,317 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:32:02,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:32:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:32:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:32:02,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:02,318 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:32:02,319 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:32:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:02,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:32:02,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:04,771 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:32:04,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:04,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:32:04,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:32:04,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:32:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:04,773 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:32:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,869 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:32:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:32:09,869 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:32:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,870 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:32:09,870 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:32:09,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:32:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:32:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:32:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:32:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:32:09,873 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:32:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,874 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:32:09,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:32:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:32:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:32:09,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,874 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:32:09,874 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:32:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:12,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:12,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:32:12,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:32:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:32:12,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:12,579 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:32:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:17,467 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:32:17,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:32:17,467 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:32:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:17,468 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:32:17,468 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:32:17,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:32:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:32:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:32:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:32:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:32:17,470 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:32:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:17,470 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:32:17,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:32:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:32:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:32:17,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:17,472 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:32:17,472 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:17,472 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:32:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:17,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:32:17,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:19,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:19,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:32:19,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:32:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:32:19,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:32:19,987 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:32:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:25,072 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:32:25,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:32:25,073 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:32:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:25,073 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:32:25,074 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:32:25,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:32:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:32:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:32:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:32:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:32:25,076 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:32:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:25,076 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:32:25,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:32:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:32:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:32:25,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:25,077 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:32:25,077 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:32:25,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:25,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:32:25,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:28,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:32:28,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:32:28,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:32:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:28,352 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:32:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:33,541 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:32:33,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:32:33,541 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:32:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:33,542 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:32:33,542 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:32:33,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:32:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:32:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:32:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:32:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:32:33,545 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:32:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:33,546 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:32:33,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:32:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:32:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:32:33,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:33,547 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:32:33,547 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:32:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:33,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:32:33,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:36,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:36,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:32:36,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:32:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:32:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:36,698 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:32:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:42,028 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:32:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:32:42,029 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:32:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:42,030 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:32:42,030 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:32:42,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:32:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:32:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:32:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:32:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:32:42,033 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:32:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:42,033 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:32:42,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:32:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:32:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:32:42,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:42,034 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:32:42,034 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:32:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:32:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:42,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:32:42,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:32:45,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:45,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:32:45,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:32:45,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:32:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:32:45,107 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. Received shutdown request... [2019-08-05 10:32:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:32:47,371 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:32:47,378 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:32:47,379 INFO L202 PluginConnector]: Adding new model phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:32:47 BoogieIcfgContainer [2019-08-05 10:32:47,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:32:47,381 INFO L168 Benchmark]: Toolchain (without parser) took 249089.03 ms. Allocated memory was 141.0 MB in the beginning and 227.0 MB in the end (delta: 86.0 MB). Free memory was 110.6 MB in the beginning and 62.9 MB in the end (delta: 47.7 MB). Peak memory consumption was 133.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:32:47,382 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:32:47,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.68 ms. Allocated memory is still 141.0 MB. Free memory was 110.4 MB in the beginning and 108.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:32:47,383 INFO L168 Benchmark]: Boogie Preprocessor took 22.37 ms. Allocated memory is still 141.0 MB. Free memory was 108.9 MB in the beginning and 107.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:32:47,383 INFO L168 Benchmark]: RCFGBuilder took 252.57 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.3 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:32:47,384 INFO L168 Benchmark]: TraceAbstraction took 248770.62 ms. Allocated memory was 141.0 MB in the beginning and 227.0 MB in the end (delta: 86.0 MB). Free memory was 98.1 MB in the beginning and 62.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 121.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:32:47,387 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.24 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.68 ms. Allocated memory is still 141.0 MB. Free memory was 110.4 MB in the beginning and 108.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.37 ms. Allocated memory is still 141.0 MB. Free memory was 108.9 MB in the beginning and 107.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 252.57 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248770.62 ms. Allocated memory was 141.0 MB in the beginning and 227.0 MB in the end (delta: 86.0 MB). Free memory was 98.1 MB in the beginning and 62.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 121.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (86states) and FLOYD_HOARE automaton (currently 38 states, 85 states before enhancement),while ReachableStatesComputation was computing reachable states (36 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 248.7s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 151.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 0 SDslu, 3403 SDs, 0 SdLazy, 196958 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 82 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 94.8s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 83 NumberOfNonLiveVariables, 14691 ConjunctsInSsa, 7138 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown