************************************************************ * IMITATOR 2.9.2-working "Butter Incaberry" * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2017 * * LSV, ENS de Cachan & CNRS, France * * LIPN, Universite Paris 13, France * * www.imitator.fr * * * * Build: 2363 (2017-06-08 17:40:33 UTC) * * explorder/5c40e39 * ************************************************************ Analysis time: Fri Jun 16, 2017 12:52:06  Model: /media/gia/Data/Example-Models/AndOr/AndOr.imi Mode: EF-synthesis. Exploration order: queue-based BFS with priority [WORK IN PROGRESS]. Considering fixpoint variant with monodirectional inclusion of symbolic zones (instead of equality). The cartography will be drawn. The result will be written to a file. The trace set(s) will be generated in a graphical mode. Description of states will be output. This model is an L/U-PTA: - lower-bound parameters {dAnd_l, dA_High_l, dB_High_l, dOr_l, dA_Low_l, dB_Low_l} - upper-bound parameters {dA_High_u, dAnd_u, dOr_u, dB_High_u, dA_Low_u, dB_Low_u}  Abstract model built after 0.012 second. Memory for abstract model: 1088.734 KiB (i.e., 278716 words)  Starting running algorithm AGsafe…  Entering explore_queue_bfs!!!  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property. End of Ordering!!!   Fixpoint reached: 22 states with 24 transitions in the final state space. Exiting explore_queue_bfs!!!  [AGsafe] Algorithm completed after 0.698 second.  Final constraint such that the system is correct:  dAnd_l >= 0 & dA_High_l > dB_High_u + dB_Low_u & dB_Low_l >= 0 & dB_Low_u >= dB_Low_l & dA_High_u >= dA_High_l & dB_High_u >= dB_High_l & dOr_u >= dOr_l & dA_Low_l >= 0 & dA_Low_u >= dA_Low_l & dAnd_u >= dAnd_l & dB_High_l >= 0 & dOr_l >= 0 OR dB_Low_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dB_High_l > dOr_u + dAnd_u & dAnd_l > dOr_u & dB_High_u + dB_Low_u >= dA_High_l & dB_Low_u >= dB_Low_l & dOr_l >= 0 & dOr_u >= dOr_l & dA_Low_l >= 0 & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dAnd_l >= 0 & dOr_l >= 0 & dA_Low_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dA_Low_u & dB_High_l > dOr_u + dAnd_u & dOr_u >= dOr_l & dA_Low_u >= dA_Low_l & dOr_u >= dAnd_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dA_Low_u >= dAnd_l & dB_Low_u >= dB_Low_l & dAnd_u >= dAnd_l OR dAnd_l >= 0 & dA_Low_u >= dA_Low_l & dOr_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dOr_u & dB_High_l > dOr_u + dAnd_u & dOr_u >= dOr_l & dA_Low_l >= 0 & dOr_u >= dAnd_l & dA_High_u + dA_Low_u >= dB_High_l + dB_Low_l + dAnd_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dAnd_u >= dAnd_l OR dA_Low_l >= 0 & dOr_l >= 0 & dB_High_l >= 0 & dAnd_l > dOr_u & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dOr_u >= dOr_l & dOr_u >= dA_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dA_Low_u >= dA_Low_l & dB_Low_u >= dB_Low_l & dOr_u + dAnd_u >= dB_High_l & dAnd_u >= dAnd_l OR dB_High_l >= 0 & dOr_u + dAnd_u >= dB_High_l & dOr_l >= 0 & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dAnd_l > dA_Low_u & dOr_u >= dOr_l & dA_Low_l >= 0 & dA_Low_u >= dA_Low_l & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dOr_u >= dAnd_l OR dOr_l >= 0 & dAnd_l >= 0 & dB_High_l >= 0 & dA_Low_l >= 0 & dB_High_u >= dB_High_l & dOr_u >= dOr_l & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dOr_u >= dA_Low_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l & dA_Low_u >= dAnd_l & dB_Low_u >= dB_Low_l & dOr_u + dAnd_u >= dB_High_l & dOr_u >= dAnd_l & dAnd_u >= dAnd_l OR dA_Low_l >= 0 & dB_Low_l >= 0 & dB_High_u + dB_Low_u >= dA_High_l & dB_High_u >= dB_High_l & dAnd_l > dA_Low_u & dOr_l > dA_Low_u & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dA_High_l > dB_High_u + dAnd_u & dA_High_u + dA_Low_u >= dB_High_l + dB_Low_l & dB_Low_u >= dB_Low_l & dA_High_u >= dA_High_l & dA_Low_u >= dA_Low_l & dOr_u + dAnd_u >= dB_High_l & dOr_u >= dOr_l & dAnd_u >= dAnd_l OR dB_Low_l >= 0 & dA_Low_u >= dA_Low_l & dOr_u + dAnd_u >= dB_High_l & dOr_l > dA_Low_u & dAnd_l > dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dB_High_l > dAnd_u & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dA_Low_l >= 0 & dB_Low_u >= dB_Low_l & dA_High_u + dA_Low_u >= dB_High_l + dB_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dOr_u >= dOr_l & dAnd_u >= dAnd_l OR dA_Low_l >= 0 & dB_High_u >= dB_High_l & dA_High_l > dB_High_u + dAnd_u & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dOr_l > dA_Low_u & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dA_High_u + dA_Low_u >= dB_High_l + dB_Low_l & dA_Low_u >= dA_Low_l & dOr_u + dAnd_u >= dB_High_l & dOr_u >= dOr_l & dA_Low_u >= dAnd_l & dAnd_u >= dAnd_l OR dB_High_l > dAnd_u & dB_High_u >= dB_High_l & dA_Low_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dOr_l > dA_Low_u & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dA_Low_u & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dA_High_u + dA_Low_u >= dB_High_l + dB_Low_l & dOr_u + dAnd_u >= dB_High_l & dA_Low_u >= dAnd_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dOr_u >= dOr_l & dAnd_u >= dAnd_l OR dOr_l >= 0 & dB_High_l > dA_High_u & dAnd_l > dB_Low_u & dOr_u >= dOr_l & dA_High_l >= 0 & dA_Low_l >= 0 & dB_Low_l >= 0 & dAnd_u >= dAnd_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dAnd_l >= 0 & dOr_l >= 0 & dB_Low_l >= 0 & dB_High_l > dA_High_u & dB_High_u + dB_Low_u + dAnd_u > dB_High_l + dAnd_l & dA_Low_l > dOr_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dB_Low_u >= dAnd_l & dAnd_u >= dAnd_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_High_l >= 0 & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dB_Low_l >= 0 & dAnd_l > dOr_u & dB_High_l > dA_High_u & dB_Low_u >= dB_Low_l & dOr_u >= dA_Low_l & dOr_l >= 0 & dOr_u >= dOr_l & dB_Low_u >= dAnd_l & dAnd_u >= dAnd_l & dA_High_l >= 0 & dA_Low_l >= 0 & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dA_High_l >= 0 & dOr_l >= 0 & dA_Low_l + dB_High_l + dAnd_l > dB_Low_u + dAnd_u & dB_Low_l >= 0 & dAnd_l > dA_Low_u & dB_High_l > dA_High_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l & dB_Low_u >= dAnd_l & dAnd_u >= dAnd_l & dA_Low_l >= 0 & dB_High_u >= dB_High_l & dOr_u >= dAnd_l OR dOr_l >= 0 & dA_Low_l >= 0 & dOr_u >= dAnd_l & dB_Low_l >= 0 & dB_Low_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dAnd_u >= dAnd_l & dAnd_l >= 0 & dOr_u >= dA_Low_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dB_Low_u + dAnd_u >= dA_Low_l + dB_High_l + dAnd_l & dA_High_l >= 0 & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l OR dB_High_u + dB_Low_u >= dA_High_l & dOr_l >= 0 & dB_Low_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dB_High_l > dOr_u + dAnd_u & dAnd_l > dA_Low_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dA_Low_l >= 0 & dOr_u >= dAnd_l & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dB_High_l >= 0 & dAnd_l >= 0 & dOr_l >= 0 & dA_Low_l > dOr_u & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dOr_u >= dOr_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dA_Low_u >= dA_Low_l & dB_Low_u >= dB_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dOr_u + dAnd_u >= dB_High_l & dAnd_u >= dAnd_l OR dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dB_Low_u >= dAnd_l & dA_High_l >= 0 & dA_Low_l >= 0 & dB_Low_l >= 0 & dOr_l >= 0 & dAnd_u >= dAnd_l & dAnd_l > dOr_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dA_High_u >= dA_High_l OR dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dA_High_l >= 0 & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dB_Low_l >= 0 & dB_Low_u >= dAnd_l & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dA_High_u >= dA_High_l OR dA_Low_l + dB_High_l + dAnd_l > dB_Low_u + dAnd_u & dOr_u >= dA_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_High_l >= 0 & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dB_Low_l >= 0 & dB_Low_u >= dAnd_l & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dA_High_u >= dA_High_l OR dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dOr_l >= 0 & dAnd_u >= dAnd_l & dAnd_l > dOr_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_u + dAnd_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l OR dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_u + dAnd_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l This good constraint is exact (sound and complete) 3.473 MiB (i.e., 455311 words of size 8)  Result written to file '/media/gia/Data/Example-Models/AndOr/AndOr-queueBFSPRIOR-incl-EF.res'.  ------------------------------------------------------------ Statistics: State space ------------------------------------------------------------ Number of states : 22 Number of transitions : 24 Number of computed states : 25 Total computation time : 1.714 seconds States/second in state space : 12.8 (22/1.714 seconds) Computed states/second : 14.5 (25/1.714 seconds) Estimated memory : 4.080 MiB (i.e., 534810 words of size 8)  Generating graphical output to '/media/gia/Data/Example-Models/AndOr/AndOr-queueBFSPRIOR-incl-EF-statespace.jpg'… Writing the states description to file '/media/gia/Data/Example-Models/AndOr/AndOr-queueBFSPRIOR-incl-EF-statespace.states'…  Drawing the cartography… Plot cartography in 2D projected on parameters dA_High_l and dA_High_u to file '/media/gia/Data/Example-Models/AndOr/AndOr-queueBFSPRIOR-incl-EF_cart.png'.  ------------------------------------------------------------ Statistics: Algorithm counters ------------------------------------------------------------ main algorithm : 1.724 seconds ------------------------------------------------------------ Statistics: Parsing counters ------------------------------------------------------------ model parsing : 0.008 second ------------------------------------------------------------ Statistics: State computation counters ------------------------------------------------------------ number of state comparisons : 23 number of constraints comparisons : 17 number of new states <= old : 3 number of new states >= old : 0 StateSpace.merging attempts : 0 StateSpace.merges : 0 StatesMerging.merging attempts : 0 StatesMerging.merges : 0 ------------------------------------------------------------ Statistics: Graphics-related counters ------------------------------------------------------------ state space drawing : 0.140 second cartography drawing : 0.099 second ------------------------------------------------------------ Statistics: Global counter ------------------------------------------------------------ total : 2.066 seconds IMITATOR successfully terminated (after 2.068 seconds) Estimated memory used: 8.099 MiB (i.e., 1061660 words of size 8)