java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:17:34,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:17:34,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:17:34,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:17:34,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:17:34,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:17:34,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:17:34,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:17:34,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:17:34,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:17:34,303 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:17:34,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:17:34,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:17:34,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:17:34,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:17:34,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:17:34,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:17:34,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:17:34,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:17:34,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:17:34,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:17:34,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:17:34,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:17:34,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:17:34,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:17:34,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:17:34,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:17:34,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:17:34,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:17:34,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:17:34,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:17:34,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:17:34,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:17:34,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:17:34,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:17:34,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:17:34,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:17:34,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:17:34,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:17:34,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:17:34,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:17:34,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:17:34,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:17:34,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:17:34,401 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:17:34,402 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:17:34,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl [2019-08-05 10:17:34,403 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/jain_5.i_2.bpl' [2019-08-05 10:17:34,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:17:34,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:17:34,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:34,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:17:34,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:17:34,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:17:34,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:17:34,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:17:34,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:17:34,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/1) ... [2019-08-05 10:17:34,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:17:34,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:17:34,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:17:34,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:17:34,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (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:17:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:17:34,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:17:34,833 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:17:34,834 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:17:34,835 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:34 BoogieIcfgContainer [2019-08-05 10:17:34,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:17:34,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:17:34,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:17:34,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:17:34,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:17:34" (1/2) ... [2019-08-05 10:17:34,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d07c3 and model type jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:17:34, skipping insertion in model container [2019-08-05 10:17:34,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:17:34" (2/2) ... [2019-08-05 10:17:34,843 INFO L109 eAbstractionObserver]: Analyzing ICFG jain_5.i_2.bpl [2019-08-05 10:17:34,852 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:17:34,860 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:17:34,876 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:17:34,902 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:17:34,903 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:17:34,903 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:17:34,903 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:17:34,904 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:17:34,904 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:17:34,904 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:17:34,904 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:17:34,904 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:17:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:17:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:17:34,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:34,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:17:34,930 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-08-05 10:17:34,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,168 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:17:35,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:17:35,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:17:35,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:17:35,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:17:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:35,199 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:17:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,290 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:17:35,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:17:35,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:17:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,302 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:17:35,303 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:17:35,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:17:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:17:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:17:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:17:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:17:35,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:17:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,335 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:17:35,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:17:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:17:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:17:35,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,337 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:17:35,337 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-08-05 10:17:35,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,362 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:35,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:17:35,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:17:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:17:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:17:35,510 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:17:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,621 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:17:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:17:35,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:17:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,622 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:17:35,622 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:17:35,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:17:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:17:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:17:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:17:35,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:17:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,627 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:17:35,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:17:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:17:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:17:35,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,628 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:17:35,628 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2019-08-05 10:17:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:35,793 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:17:35,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:35,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:17:35,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:17:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:17:35,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:17:35,795 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:17:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:36,137 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:17:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:17:36,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:17:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:36,138 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:17:36,138 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:17:36,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:17:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:17:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:17:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:17:36,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:17:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:36,142 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:17:36,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:17:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:17:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:17:36,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:36,143 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:17:36,144 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2019-08-05 10:17:36,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:36,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:17:36,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:36,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:17:36,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:17:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:17:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:17:36,351 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2019-08-05 10:17:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:36,581 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:17:36,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:17:36,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:17:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:36,584 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:17:36,584 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:17:36,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:17:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:17:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:17:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:17:36,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:17:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:36,589 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:17:36,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:17:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:17:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:17:36,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:36,590 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:17:36,593 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2019-08-05 10:17:36,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:36,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:17:36,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:36,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:36,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:17:36,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:17:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:17:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:17:36,806 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-08-05 10:17:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:37,210 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:17:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:17:37,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:17:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:37,211 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:17:37,211 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:17:37,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:17:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:17:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:17:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:17:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:17:37,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:17:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:37,215 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:17:37,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:17:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:17:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:17:37,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:37,216 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:17:37,216 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:37,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2019-08-05 10:17:37,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:37,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:17:37,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:17:37,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:17:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:17:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:17:37,529 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-08-05 10:17:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:37,727 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:17:37,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:17:37,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-08-05 10:17:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:37,729 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:17:37,729 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:17:37,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:17:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:17:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:17:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:17:37,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:17:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:37,734 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:17:37,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:17:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:17:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:17:37,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:37,736 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:17:37,736 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2019-08-05 10:17:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:37,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:17:37,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:17:37,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:17:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:17:37,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:17:37,969 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-08-05 10:17:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,304 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:17:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:17:38,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:17:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,305 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:17:38,305 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:17:38,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:17:38,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:17:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:17:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:17:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:17:38,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:17:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,310 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:17:38,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:17:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:17:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:17:38,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,311 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:17:38,311 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2019-08-05 10:17:38,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:38,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:17:38,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:17:38,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:17:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:17:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:17:38,565 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-08-05 10:17:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:38,825 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:17:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:17:38,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 10:17:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:38,826 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:17:38,826 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:17:38,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:17:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:17:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:17:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:17:38,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:17:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:38,831 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:17:38,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:17:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:17:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:17:38,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:38,832 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:17:38,833 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:38,833 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2019-08-05 10:17:38,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:38,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:17:38,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:17:39,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:17:39,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:17:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:17:39,111 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-08-05 10:17:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:39,417 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:17:39,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:17:39,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-08-05 10:17:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:39,425 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:17:39,425 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:17:39,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:17:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:17:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:17:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:17:39,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:17:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:39,430 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:17:39,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:17:39,430 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:17:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:17:39,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:39,431 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:17:39,434 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:39,435 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2019-08-05 10:17:39,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:39,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:17:39,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:39,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:17:39,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:17:39,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:17:39,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:17:39,784 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-08-05 10:17:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:40,227 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:17:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:17:40,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-08-05 10:17:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:40,228 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:17:40,229 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:17:40,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:17:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:17:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:17:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:17:40,232 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:17:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:40,233 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:17:40,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:17:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:17:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:17:40,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:40,234 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:17:40,234 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2019-08-05 10:17:40,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:40,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:17:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:40,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:40,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:17:40,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:17:40,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:17:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:17:40,486 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-08-05 10:17:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:40,845 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:17:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:17:40,846 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-08-05 10:17:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:40,847 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:17:40,848 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:17:40,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:17:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:17:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:17:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:17:40,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:17:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:40,853 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:17:40,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:17:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:17:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:17:40,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:40,854 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:17:40,854 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2019-08-05 10:17:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:40,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:17:40,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:41,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:41,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:17:41,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:17:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:17:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:17:41,729 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-08-05 10:17:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:42,505 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:17:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:17:42,506 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-08-05 10:17:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:42,507 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:17:42,507 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:17:42,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:17:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:17:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:17:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:17:42,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:17:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:42,512 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:17:42,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:17:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:17:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:17:42,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:42,513 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:17:42,513 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2019-08-05 10:17:42,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:42,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:17:42,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:42,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:42,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:17:42,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:17:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:17:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:17:42,823 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-08-05 10:17:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:43,303 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:17:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:17:43,304 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-08-05 10:17:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:43,305 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:17:43,305 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:17:43,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:17:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:17:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:17:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:17:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:17:43,310 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:17:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:43,310 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:17:43,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:17:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:17:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:17:43,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:43,311 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:17:43,312 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2019-08-05 10:17:43,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:43,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:17:43,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:43,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:43,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:17:43,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:17:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:17:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:17:43,620 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-08-05 10:17:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:44,178 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:17:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:17:44,178 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-08-05 10:17:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:44,179 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:17:44,179 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:17:44,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:17:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:17:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:17:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:17:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:17:44,185 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:17:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:44,185 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:17:44,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:17:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:17:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:17:44,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:44,186 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:17:44,186 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:44,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2019-08-05 10:17:44,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:44,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:17:44,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:44,453 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:17:44,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:44,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:17:44,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:17:44,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:17:44,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:17:44,455 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-08-05 10:17:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:45,143 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:17:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:17:45,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-08-05 10:17:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:45,144 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:17:45,144 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:17:45,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:17:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:17:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:17:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:17:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:17:45,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:17:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:45,149 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:17:45,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:17:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:17:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:17:45,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:45,150 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:17:45,151 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:45,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2019-08-05 10:17:45,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:45,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:17:45,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:17:45,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:17:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:17:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:17:45,566 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-08-05 10:17:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:46,198 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:17:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:17:46,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-08-05 10:17:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:46,201 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:17:46,201 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:17:46,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:17:46,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:17:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:17:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:17:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:17:46,205 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:17:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:46,206 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:17:46,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:17:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:17:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:17:46,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:46,207 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:17:46,207 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2019-08-05 10:17:46,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:46,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:17:46,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:46,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:46,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:17:46,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:17:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:17:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:17:46,679 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-08-05 10:17:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:47,616 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:17:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:17:47,617 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-08-05 10:17:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:47,617 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:17:47,617 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:17:47,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:17:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:17:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:17:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:17:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:17:47,622 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:17:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:47,623 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:17:47,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:17:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:17:47,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:17:47,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:47,624 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:17:47,624 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2019-08-05 10:17:47,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:47,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:17:47,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:48,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:48,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:17:48,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:17:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:17:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:17:48,330 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-08-05 10:17:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:49,648 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:17:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:17:49,649 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-08-05 10:17:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:49,650 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:17:49,650 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:17:49,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:17:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:17:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:17:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:17:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:17:49,655 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:17:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:49,655 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:17:49,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:17:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:17:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:17:49,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:49,657 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:17:49,657 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2019-08-05 10:17:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:49,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:17:49,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:50,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:17:50,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:17:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:17:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:17:50,173 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-08-05 10:17:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:51,231 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:17:51,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:17:51,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-08-05 10:17:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:51,233 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:17:51,233 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:17:51,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:17:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:17:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:17:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:17:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:17:51,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:17:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:51,237 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:17:51,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:17:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:17:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:17:51,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:51,238 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:17:51,239 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:51,239 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2019-08-05 10:17:51,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:51,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:17:51,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:51,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:51,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:17:51,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:17:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:17:51,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:17:51,742 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-08-05 10:17:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:52,812 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:17:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:17:52,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-08-05 10:17:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:52,818 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:17:52,818 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:17:52,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:17:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:17:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:17:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:17:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:17:52,823 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:17:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:52,823 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:17:52,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:17:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:17:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:17:52,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:52,825 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:17:52,825 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2019-08-05 10:17:52,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:52,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:17:52,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:53,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:53,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:17:53,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:17:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:17:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:17:53,283 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-08-05 10:17:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:54,318 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:17:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:17:54,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-08-05 10:17:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:54,320 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:17:54,320 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:17:54,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:17:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:17:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:17:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:17:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:17:54,323 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:17:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:54,323 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:17:54,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:17:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:17:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:17:54,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:54,324 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:17:54,325 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2019-08-05 10:17:54,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:54,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:17:54,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:54,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:17:54,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:17:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:17:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:17:54,759 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-08-05 10:17:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:55,866 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:17:55,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:17:55,869 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-08-05 10:17:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:55,870 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:17:55,870 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:17:55,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:17:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:17:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:17:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:17:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:17:55,875 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:17:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:55,875 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:17:55,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:17:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:17:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:17:55,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:55,876 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:17:55,877 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2019-08-05 10:17:55,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:55,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:17:55,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:57,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:57,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:17:57,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:17:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:17:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:17:57,340 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-08-05 10:17:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:58,634 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:17:58,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:17:58,635 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-08-05 10:17:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:58,636 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:17:58,636 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:17:58,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:17:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:17:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:17:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:17:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:17:58,642 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:17:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:58,642 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:17:58,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:17:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:17:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:17:58,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:58,646 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:17:58,646 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2019-08-05 10:17:58,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:58,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:17:58,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:17:59,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:17:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:17:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:17:59,312 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-08-05 10:18:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:00,623 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:18:00,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:18:00,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-08-05 10:18:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:00,624 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:18:00,624 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:18:00,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:18:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:18:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:18:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:18:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:18:00,628 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:18:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:00,628 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:18:00,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:18:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:18:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:18:00,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:00,629 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:18:00,629 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2019-08-05 10:18:00,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:00,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:18:00,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:01,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:01,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:18:01,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:18:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:18:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:18:01,518 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-08-05 10:18:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:03,310 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:18:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:18:03,310 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-08-05 10:18:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:03,311 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:18:03,311 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:18:03,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:18:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:18:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:18:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:18:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:18:03,317 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:18:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:03,317 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:18:03,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:18:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:18:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:18:03,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:03,318 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:18:03,318 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2019-08-05 10:18:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:03,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:18:03,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:03,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:03,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:18:03,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:18:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:18:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:18:03,903 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-08-05 10:18:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:05,401 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:18:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:18:05,402 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-08-05 10:18:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:05,403 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:18:05,403 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:18:05,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=2707, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:18:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:18:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:18:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:18:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:18:05,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:18:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:05,408 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:18:05,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:18:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:18:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:18:05,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:05,409 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:18:05,409 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2019-08-05 10:18:05,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:05,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:18:05,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:06,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:06,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:18:06,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:18:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:18:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:18:06,132 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-08-05 10:18:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:07,934 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:18:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:18:07,935 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-08-05 10:18:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:07,936 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:18:07,936 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:18:07,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=2919, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:18:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:18:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:18:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:18:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:18:07,940 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:18:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:07,941 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:18:07,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:18:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:18:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:18:07,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:07,943 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:18:07,943 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:07,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2019-08-05 10:18:07,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:07,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:18:07,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:08,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:08,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:18:08,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:18:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:18:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:18:08,885 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-08-05 10:18:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:10,724 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:18:10,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:18:10,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-08-05 10:18:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:10,725 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:18:10,726 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:18:10,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=3139, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:18:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:18:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:18:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:18:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:18:10,730 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:18:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:10,731 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:18:10,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:18:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:18:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:18:10,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:10,732 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:18:10,732 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2019-08-05 10:18:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:10,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:18:10,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:11,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:11,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:18:11,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:18:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:18:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:18:11,791 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-08-05 10:18:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:13,821 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:18:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:18:13,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-08-05 10:18:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:13,823 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:18:13,823 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:18:13,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=173, Invalid=3367, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:18:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:18:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:18:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:18:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:18:13,827 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:18:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:13,827 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:18:13,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:18:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:18:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:18:13,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:13,828 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:18:13,828 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2019-08-05 10:18:13,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:13,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:18:13,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:14,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:14,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:18:14,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:18:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:18:14,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:18:14,463 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-08-05 10:18:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:16,432 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:18:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:18:16,432 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-08-05 10:18:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:16,433 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:18:16,433 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:18:16,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=3603, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:18:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:18:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:18:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:18:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:18:16,437 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:18:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:16,437 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:18:16,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:18:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:18:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:18:16,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:16,437 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:18:16,438 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:16,438 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2019-08-05 10:18:16,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:16,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:18:16,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:17,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:18:17,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:18:17,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:18:17,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:18:17,084 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-08-05 10:18:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:19,300 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:18:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:18:19,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-08-05 10:18:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:19,301 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:18:19,301 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:18:19,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=3847, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:18:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:18:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:18:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:18:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:18:19,306 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:18:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:19,306 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:18:19,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:18:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:18:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:18:19,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:19,307 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:18:19,307 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2019-08-05 10:18:19,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:19,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:18:19,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:20,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:20,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:18:20,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:18:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:18:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:18:20,869 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-08-05 10:18:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:23,296 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:18:23,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:18:23,297 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-08-05 10:18:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:23,298 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:18:23,298 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:18:23,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=191, Invalid=4099, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:18:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:18:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:18:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:18:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:18:23,302 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:18:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:23,303 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:18:23,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:18:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:18:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:18:23,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:23,303 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:18:23,304 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2019-08-05 10:18:23,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:23,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:18:23,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:18:24,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:18:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:18:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:18:24,275 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-08-05 10:18:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:26,627 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:18:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:18:26,628 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-08-05 10:18:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:26,629 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:18:26,629 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:18:26,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=4359, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:18:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:18:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:18:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:18:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:18:26,633 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:18:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:26,634 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:18:26,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:18:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:18:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:18:26,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:26,634 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:18:26,635 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2019-08-05 10:18:26,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:26,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:18:26,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:27,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:27,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:18:27,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:18:27,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:18:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:18:27,458 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-08-05 10:18:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:30,021 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:18:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:18:30,022 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-08-05 10:18:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:30,023 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:18:30,023 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:18:30,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=4627, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:18:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:18:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:18:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:18:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:18:30,027 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:18:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:30,028 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:18:30,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:18:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:18:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:18:30,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:30,028 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:18:30,029 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2019-08-05 10:18:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:30,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:18:30,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:18:30,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:18:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:18:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:18:30,871 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-08-05 10:18:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:33,466 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:18:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:18:33,467 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-08-05 10:18:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:33,468 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:18:33,468 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:18:33,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=209, Invalid=4903, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:18:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:18:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:18:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:18:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:18:33,471 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:18:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:33,471 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:18:33,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:18:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:18:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:18:33,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:33,471 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:18:33,472 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2019-08-05 10:18:33,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:33,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:18:33,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:34,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:34,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:18:34,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:18:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:18:34,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:18:34,381 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-08-05 10:18:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:37,133 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:18:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:18:37,134 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-08-05 10:18:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:37,135 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:18:37,135 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:18:37,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=5187, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:18:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:18:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:18:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:18:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:18:37,138 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:18:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:37,138 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:18:37,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:18:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:18:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:18:37,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:37,139 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:18:37,139 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2019-08-05 10:18:37,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:37,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:18:37,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:38,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:18:38,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:18:38,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:18:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:18:38,066 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-08-05 10:18:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:41,111 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:18:41,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:18:41,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-08-05 10:18:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:41,112 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:18:41,112 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:18:41,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=5479, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:18:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:18:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:18:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:18:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:18:41,116 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:18:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:41,116 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:18:41,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:18:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:18:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:18:41,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:41,117 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:18:41,117 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2019-08-05 10:18:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:41,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:18:41,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:18:42,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:18:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:18:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:18:42,065 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-08-05 10:18:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:45,375 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:18:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:18:45,376 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-08-05 10:18:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:45,377 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:18:45,377 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:18:45,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=227, Invalid=5779, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:18:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:18:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:18:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:18:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:18:45,380 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:18:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:45,381 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:18:45,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:18:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:18:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:18:45,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:45,382 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:18:45,382 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2019-08-05 10:18:45,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:45,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:18:45,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:46,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:46,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:18:46,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:18:46,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:18:46,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:18:46,255 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-08-05 10:18:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:49,553 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:18:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:18:49,553 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-08-05 10:18:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:49,554 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:18:49,554 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:18:49,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=233, Invalid=6087, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:18:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:18:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:18:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:18:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:18:49,559 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:18:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:49,559 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:18:49,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:18:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:18:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:18:49,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:49,560 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:18:49,560 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2019-08-05 10:18:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:49,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:18:49,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:50,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:18:50,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:18:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:18:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:18:50,496 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-08-05 10:18:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:54,144 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:18:54,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:18:54,144 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-08-05 10:18:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:54,145 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:18:54,145 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:18:54,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=239, Invalid=6403, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:18:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:18:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:18:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:18:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:18:54,149 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:18:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:54,149 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:18:54,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:18:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:18:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:18:54,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:54,150 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:18:54,151 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:54,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:54,151 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2019-08-05 10:18:54,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:54,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:18:54,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:55,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:55,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:18:55,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:18:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:18:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:18:55,430 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-08-05 10:18:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:59,076 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:18:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:18:59,077 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-08-05 10:18:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:59,078 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:18:59,078 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:18:59,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=245, Invalid=6727, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:18:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:18:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:18:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:18:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:18:59,082 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:18:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:59,082 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:18:59,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:18:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:18:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:18:59,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:59,083 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:18:59,083 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:59,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:59,084 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2019-08-05 10:18:59,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:59,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:18:59,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:00,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:19:00,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:19:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:19:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:00,688 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-08-05 10:19:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:04,485 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:19:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:19:04,485 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-08-05 10:19:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:04,486 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:19:04,486 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:19:04,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=251, Invalid=7059, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:19:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:19:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:19:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:19:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:19:04,490 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:19:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:04,490 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:19:04,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:19:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:19:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:19:04,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:04,491 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:19:04,491 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2019-08-05 10:19:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:04,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:19:04,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:05,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:05,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:19:05,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:19:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:19:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:05,592 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-08-05 10:19:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:09,537 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:19:09,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:19:09,538 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-08-05 10:19:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:09,538 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:19:09,539 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:19:09,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=257, Invalid=7399, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:19:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:19:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:19:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:19:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:19:09,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:19:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:09,543 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:19:09,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:19:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:19:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:19:09,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:09,544 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:19:09,544 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2019-08-05 10:19:09,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:09,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:19:09,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:10,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:19:10,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:19:10,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:19:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:10,807 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-08-05 10:19:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:14,990 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:19:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:19:14,991 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-08-05 10:19:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:14,992 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:19:14,992 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:19:14,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=263, Invalid=7747, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:19:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:19:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:19:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:19:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:19:14,995 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:19:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:14,995 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:19:14,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:19:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:19:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:19:14,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:14,996 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:19:14,996 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2019-08-05 10:19:14,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:15,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:19:15,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:16,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:16,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:19:16,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:19:16,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:19:16,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:16,081 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-08-05 10:19:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:20,364 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:19:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:19:20,365 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-08-05 10:19:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:20,366 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:19:20,366 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:19:20,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=269, Invalid=8103, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:19:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:19:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:19:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:19:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:19:20,370 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:19:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:20,370 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:19:20,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:19:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:19:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:19:20,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:20,371 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:19:20,371 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2019-08-05 10:19:20,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:20,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:19:20,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:21,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:21,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:19:21,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:19:21,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:19:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:21,621 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-08-05 10:19:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:26,073 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:19:26,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:19:26,074 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-08-05 10:19:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:26,075 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:19:26,075 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:19:26,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=275, Invalid=8467, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:19:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:19:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:19:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:19:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:19:26,078 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:19:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:26,079 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:19:26,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:19:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:19:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:19:26,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:26,080 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:19:26,080 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2019-08-05 10:19:26,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:26,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:19:26,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:27,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:27,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:19:27,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:19:27,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:19:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:27,417 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-08-05 10:19:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:32,079 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:19:32,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:19:32,080 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-08-05 10:19:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:32,081 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:19:32,081 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:19:32,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=281, Invalid=8839, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:19:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:19:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:19:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:19:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:19:32,085 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:19:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:32,085 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:19:32,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:19:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:19:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:19:32,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:32,086 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:19:32,086 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2019-08-05 10:19:32,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:32,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:19:32,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:34,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:34,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:19:34,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:19:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:19:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:34,158 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-08-05 10:19:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:38,971 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:19:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:19:38,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-08-05 10:19:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:38,972 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:19:38,972 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:19:38,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=287, Invalid=9219, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:19:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:19:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:19:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:19:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:19:38,976 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:19:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:38,977 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:19:38,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:19:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:19:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:19:38,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:38,977 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:19:38,978 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:38,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:38,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2019-08-05 10:19:38,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:39,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:19:39,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:19:40,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:19:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:19:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:40,861 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-08-05 10:19:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:45,859 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:19:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:19:45,859 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-08-05 10:19:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:45,860 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:19:45,860 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:19:45,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=293, Invalid=9607, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:19:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:19:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:19:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:19:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:19:45,864 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:19:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:45,864 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:19:45,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:19:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:19:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:19:45,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:45,865 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:19:45,866 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2019-08-05 10:19:45,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:45,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 10:19:45,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:47,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:47,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:19:47,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:19:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:19:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:47,211 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-08-05 10:19:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:53,482 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:19:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:19:53,482 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-08-05 10:19:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:53,484 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:19:53,484 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:19:53,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=299, Invalid=10003, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:19:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:19:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:19:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:19:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:19:53,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:19:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:53,489 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:19:53,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:19:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:19:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:19:53,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:53,490 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:19:53,490 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2019-08-05 10:19:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:53,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:19:53,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:55,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:55,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:19:55,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:19:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:19:55,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:19:55,323 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-08-05 10:20:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:00,710 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:20:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:20:00,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-08-05 10:20:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:00,712 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:20:00,712 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:20:00,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=305, Invalid=10407, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:20:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:20:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 10:20:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:20:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:20:00,716 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:20:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:00,716 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:20:00,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:20:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:20:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:20:00,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:00,717 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:20:00,717 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2019-08-05 10:20:00,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:00,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 214 conjunts are in the unsatisfiable core [2019-08-05 10:20:00,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:02,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:20:02,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:20:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:20:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:20:02,349 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2019-08-05 10:20:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:07,874 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:20:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:20:07,874 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2019-08-05 10:20:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:07,875 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:20:07,876 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:20:07,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=311, Invalid=10819, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:20:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:20:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 10:20:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:20:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:20:07,879 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:20:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:07,880 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:20:07,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:20:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:20:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:20:07,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:07,881 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:20:07,881 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2019-08-05 10:20:07,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:08,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-05 10:20:08,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:09,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:09,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:20:09,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:20:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:20:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:09,713 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-08-05 10:20:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:15,643 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:20:15,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:20:15,644 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-08-05 10:20:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:15,644 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:20:15,645 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:20:15,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=317, Invalid=11239, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:20:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:20:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 10:20:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:20:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:20:15,648 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:20:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:15,649 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:20:15,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:20:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:20:15,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:20:15,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:15,649 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:20:15,650 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2019-08-05 10:20:15,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:15,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:20:15,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:17,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:17,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:20:17,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:20:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:20:17,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:20:17,188 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2019-08-05 10:20:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:23,291 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:20:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:20:23,291 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2019-08-05 10:20:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:23,292 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:20:23,292 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:20:23,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=323, Invalid=11667, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:20:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:20:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:20:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:20:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:20:23,295 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:20:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:23,295 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:20:23,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:20:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:20:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:20:23,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:23,296 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:20:23,296 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:23,296 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2019-08-05 10:20:23,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:23,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 226 conjunts are in the unsatisfiable core [2019-08-05 10:20:23,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:24,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:24,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:20:24,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:20:24,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:20:24,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:20:24,939 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-08-05 10:20:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:31,498 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:20:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:20:31,498 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-08-05 10:20:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:31,499 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:20:31,500 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:20:31,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=329, Invalid=12103, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:20:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:20:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 10:20:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:20:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:20:31,503 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:20:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:31,503 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:20:31,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:20:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:20:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:20:31,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:31,504 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:20:31,505 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2019-08-05 10:20:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:31,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-05 10:20:31,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:33,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:33,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:20:33,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:20:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:20:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:33,523 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2019-08-05 10:20:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:39,893 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:20:39,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:20:39,894 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2019-08-05 10:20:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:39,895 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:20:39,895 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:20:39,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=335, Invalid=12547, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:20:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:20:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:20:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:20:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:20:39,898 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:20:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:39,899 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:20:39,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:20:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:20:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:20:39,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:39,900 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:20:39,900 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2019-08-05 10:20:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:40,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:20:40,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:41,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:41,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:20:41,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:20:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:20:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:41,901 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-08-05 10:20:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:48,672 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:20:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:20:48,678 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-08-05 10:20:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:48,678 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:20:48,679 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:20:48,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=341, Invalid=12999, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:20:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:20:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-08-05 10:20:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:20:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:20:48,682 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:20:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:48,682 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:20:48,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:20:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:20:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:20:48,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:48,683 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:20:48,683 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2019-08-05 10:20:48,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:48,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 238 conjunts are in the unsatisfiable core [2019-08-05 10:20:48,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:20:51,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:20:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:20:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:51,169 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2019-08-05 10:20:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:58,477 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:20:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:20:58,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2019-08-05 10:20:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:58,478 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:20:58,479 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:20:58,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=347, Invalid=13459, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:20:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:20:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 10:20:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:20:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:20:58,482 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 10:20:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:58,482 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:20:58,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:20:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:20:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:20:58,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:58,483 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 10:20:58,483 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2019-08-05 10:20:58,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:58,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 10:20:58,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:00,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:00,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:21:00,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:21:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:21:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:21:00,313 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-08-05 10:21:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:07,697 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:21:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:21:07,698 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-08-05 10:21:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:07,699 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:21:07,699 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:21:07,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=353, Invalid=13927, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:21:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:21:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-08-05 10:21:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:21:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:21:07,703 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 10:21:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:07,703 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:21:07,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:21:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:21:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:21:07,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:07,704 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 10:21:07,704 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2019-08-05 10:21:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:07,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:21:07,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:10,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:10,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:21:10,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:21:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:21:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:21:10,079 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2019-08-05 10:21:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:17,541 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:21:17,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:21:17,542 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2019-08-05 10:21:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:17,542 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:21:17,543 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:21:17,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=359, Invalid=14403, Unknown=0, NotChecked=0, Total=14762 [2019-08-05 10:21:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:21:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-05 10:21:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:21:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:21:17,546 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 10:21:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:17,547 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:21:17,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:21:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:21:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:21:17,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:17,548 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 10:21:17,548 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2019-08-05 10:21:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:17,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 250 conjunts are in the unsatisfiable core [2019-08-05 10:21:17,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:19,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:21:19,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:21:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:21:19,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:21:19,467 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-08-05 10:21:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:27,074 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:21:27,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:21:27,074 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-08-05 10:21:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:27,075 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:21:27,075 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:21:27,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=365, Invalid=14887, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:21:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:21:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-08-05 10:21:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:21:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 10:21:27,078 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 10:21:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:27,078 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 10:21:27,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:21:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 10:21:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:21:27,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:27,079 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 10:21:27,079 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2019-08-05 10:21:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:27,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-05 10:21:27,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:29,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:29,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:21:29,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:21:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:21:29,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:21:29,138 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2019-08-05 10:21:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:36,999 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:21:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:21:37,000 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2019-08-05 10:21:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:37,001 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:21:37,001 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:21:37,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=371, Invalid=15379, Unknown=0, NotChecked=0, Total=15750 [2019-08-05 10:21:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:21:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 10:21:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:21:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:21:37,004 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-05 10:21:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:37,005 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:21:37,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:21:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:21:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:21:37,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:37,005 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-05 10:21:37,005 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2019-08-05 10:21:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:37,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:21:37,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:39,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:39,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:21:39,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:21:39,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:21:39,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:39,291 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. Received shutdown request... [2019-08-05 10:21:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:21:41,617 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:21:41,622 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:21:41,622 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:41 BoogieIcfgContainer [2019-08-05 10:21:41,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:41,625 INFO L168 Benchmark]: Toolchain (without parser) took 247180.83 ms. Allocated memory was 140.0 MB in the beginning and 474.5 MB in the end (delta: 334.5 MB). Free memory was 109.6 MB in the beginning and 381.2 MB in the end (delta: -271.6 MB). Peak memory consumption was 62.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:41,625 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 110.9 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:41,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.67 ms. Allocated memory is still 140.0 MB. Free memory was 109.6 MB in the beginning and 107.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:41,627 INFO L168 Benchmark]: Boogie Preprocessor took 19.71 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 106.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:41,627 INFO L168 Benchmark]: RCFGBuilder took 337.13 ms. Allocated memory is still 140.0 MB. Free memory was 106.7 MB in the beginning and 97.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:41,628 INFO L168 Benchmark]: TraceAbstraction took 246785.94 ms. Allocated memory was 140.0 MB in the beginning and 474.5 MB in the end (delta: 334.5 MB). Free memory was 97.4 MB in the beginning and 381.2 MB in the end (delta: -283.8 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:41,631 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.26 ms. Allocated memory is still 140.0 MB. Free memory was 110.9 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.67 ms. Allocated memory is still 140.0 MB. Free memory was 109.6 MB in the beginning and 107.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.71 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 106.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.13 ms. Allocated memory is still 140.0 MB. Free memory was 106.7 MB in the beginning and 97.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246785.94 ms. Allocated memory was 140.0 MB in the beginning and 474.5 MB in the end (delta: 334.5 MB). Free memory was 97.4 MB in the beginning and 381.2 MB in the end (delta: -283.8 MB). Peak memory consumption was 50.7 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 (129states) and FLOYD_HOARE automaton (currently 20 states, 66 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 246.7s OverallTime, 63 OverallIterations, 63 TraceHistogramMax, 182.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 188 SDtfs, 1970 SDslu, 4031 SDs, 0 SdLazy, 165207 SolverSat, 1909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6004 GetRequests, 2016 SyntacticMatches, 0 SemanticMatches, 3987 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37956 ImplicationChecksByTransitivity, 109.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=62, 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, 62 MinimizatonAttempts, 62 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 60.9s InterpolantComputationTime, 4158 NumberOfCodeBlocks, 4158 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 4095 ConstructedInterpolants, 0 QuantifiedInterpolants, 2410851 SizeOfPredicates, 189 NumberOfNonLiveVariables, 18648 ConjunctsInSsa, 8442 ConjunctsInUnsatCore, 63 InterpolantComputations, 1 PerfectInterpolantSequences, 0/83328 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown