hoangia90@magi1:~/imitator$ salloc -n 12 mpirun ./bin/imitator ./test/Sched2-100-0.imi ./test/Sched2-100-0.v0 -mode cover -EFIM -distributed subpart -merge -output-cart salloc: Granted job allocation 96680 ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. ************************************************************ * IMITATOR 2.6.2 * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2014 * * LSV, ENS de Cachan & CNRS, France * * Universite Paris 13, Sorbonne Paris Cite, LIPN, France * * * * Build: 1311 (2014-11-17 19:19:49 UTC) * ************************************************************ Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Analysis time: Mon Nov 17, 2014 23:00:27 Model: ./test/Sched2-100-0.imi Mode: behavioral cartography algorithm with full coverage and step 1. Considering algorithm EFIM (work in progress). Considering a distributed mode with "shuffle" enumeration of pi0 points. Merging technique of [AFS12] enabled. The cartography will be output in a graphical mode. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Parsing completed after 0.024 second. Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) Memory for abstract model: 401.617 KiB (i.e., 102814 words) ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 Number of points inside V0: 972171 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..256 & C3_WORST = 510..1000 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM Number of points inside V0: 121277 ************************************************** Parametric rectangle V0: ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 505..752 & C3_WORST = 20..509 Number of points inside V0: 121520 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..256 & C3_WORST = 20..509 Number of points inside V0: 121030 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 753..1000 & C3_WORST = 20..509 Number of points inside V0: 121520 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 505..752 & C3_WORST = 755..1000 Number of points inside V0: 61008 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 753..1000 & C3_WORST = 510..754 b = 257..504 & C3_WORST = 20..509 Number of points inside V0: 121520 b = 505..752 & C3_WORST = 510..754 Number of points inside V0: 60760 Number of points inside V0: 60760 ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** Parametric rectangle V0: b = 753..1000 & C3_WORST = 755..1000 Number of points inside V0: 61008 START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 10..1000 & C3_WORST = 20..1000 Number of points inside V0: 972171 ************************************************** ************************************************** START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 257..504 & C3_WORST = 510..754 Number of points inside V0: 60760 START THE BEHAVIORAL CARTOGRAPHY ALGORITHM ************************************************** Parametric rectangle V0: b = 257..504 & C3_WORST = 755..1000 Number of points inside V0: 61008 K1 computed by IM after 32 iterations in 1.062 seconds: 121 states with 149 transitions explored. C3_WORST >= 20 & b >= 10 & 72 > b + C3_WORST K1 computed by IM after 32 iterations in 1.062 seconds: 121 states with 149 transitions explored. b >= 10 & C3_WORST >= 20 & 72 > b + C3_WORST K2 computed by IM after 32 iterations in 2.143 seconds: 205 states with 262 transitions explored. b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b & 2*b + C3_WORST > 172 & b + C3_WORST > 100 OR b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b & b + C3_WORST > 100 & 2*b + C3_WORST > 172 OR b >= 10 & 1000 >= C3_WORST & C3_WORST >= 20 & 2*b + C3_WORST > 172 & b + C3_WORST > 100 & 1000 >= b OR b >= 10 & 1000 >= C3_WORST & 1000 >= b & C3_WORST >= 100 & b + C3_WORST >= 172 OR C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b & b + C3_WORST >= 172 & b >= 10 OR C3_WORST >= 20 & b >= 10 & 1000 >= C3_WORST & 2*b + C3_WORST > 172 & b + C3_WORST > 100 & 1000 >= b OR 1000 >= C3_WORST & b + C3_WORST >= 172 & b >= 10 & 1000 >= b & C3_WORST >= 100 OR b >= 10 & 1000 >= C3_WORST & C3_WORST >= 100 & b + C3_WORST >= 172 & 1000 >= b OR b >= 10 & 1000 >= C3_WORST & 1000 >= b & b + C3_WORST > 100 & C3_WORST >= 20 OR b >= 10 & 1000 >= C3_WORST & 1000 >= b & b + C3_WORST > 100 & C3_WORST >= 20 OR 1000 >= C3_WORST & 1000 >= b & b >= 10 & b + C3_WORST > 100 & C3_WORST >= 20 OR 1000 >= C3_WORST & 1000 >= b & b >= 10 & C3_WORST >= 100 OR 1000 >= C3_WORST & 1000 >= b & C3_WORST >= 100 & 2*b + C3_WORST >= 172 & b >= 10 OR 1000 >= C3_WORST & 1000 >= b & b >= 10 & C3_WORST >= 100 OR 1000 >= C3_WORST & 1000 >= b & b >= 10 & C3_WORST >= 100 OR 1000 >= C3_WORST & 1000 >= b & C3_WORST >= 20 & 2*b + C3_WORST > 200 & b >= 10 OR b >= 10 & 1000 >= C3_WORST & 1000 >= b & 2*b + C3_WORST > 200 & C3_WORST >= 20 OR 1000 >= C3_WORST & 1000 >= b & C3_WORST >= 100 & b + C3_WORST >= 200 & b >= 10 OR C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b & b >= 10 & b + C3_WORST >= 100 OR C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b & b >= 10 & b + C3_WORST >= 200 OR 1000 >= C3_WORST & 1000 >= b & C3_WORST >= 20 & b + C3_WORST >= 100 & b >= 10 OR b >= 10 & 1000 >= C3_WORST & 1000 >= b & b + C3_WORST > 100 & C3_WORST >= 20 OR 1000 >= C3_WORST & 1000 >= b & b >= 10 & b + C3_WORST > 100 & C3_WORST >= 20 OR 1000 >= C3_WORST & b >= 10 & C3_WORST >= 20 & b + C3_WORST > 100 & 1000 >= b OR C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b & b >= 10 OR b >= 10 & 1000 >= C3_WORST & b + C3_WORST > 100 & C3_WORST >= 20 & 1000 >= b OR 1000 >= C3_WORST & 1000 >= b & b >= 10 & C3_WORST >= 100 OR 1000 >= C3_WORST & b >= 10 & C3_WORST >= 100 & 1000 >= b OR C3_WORST >= 100 & 1000 >= C3_WORST & b >= 10 & 1000 >= b K2 computed by IM after 32 iterations in 2.143 seconds: 205 states with 262 transitions explored. 2*b + C3_WORST > 172 & b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR 2*b + C3_WORST > 172 & b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR 2*b + C3_WORST > 172 & b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 172 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 172 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR 2*b + C3_WORST > 172 & b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 172 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 172 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR 2*b + C3_WORST >= 172 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR 2*b + C3_WORST > 200 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR 2*b + C3_WORST > 200 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 200 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 200 & b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST >= 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b + C3_WORST > 100 & b >= 10 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b OR b >= 10 & C3_WORST >= 100 & 1000 >= C3_WORST & 1000 >= b K3 computed by IM after 33 iterations in 3.069 seconds: 221 states with 293 transitions explored. b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b OR b > 72 & C3_WORST >= 20 & 1000 >= C3_WORST & 1000 >= b [Master] All workers done ************************************************** END OF THE BEHAVIORAL CARTOGRAPHY ALGORITHM Size of V0: 972171 Unsuccessful points: 22 3 different constraints were computed. Average number of states : 182 Average number of transitions : 234 Global time spent : 10.7993979454 s Time spent on IM : 6.27566242218 s Time spent to compute next point: 0. s ************************************************** [Master] Splitting time : 0.000866174697876 s [Master] Processing time : 0.0111155509949 s [Master] Waiting time : 10.7529723644 s [Master] Occupancy : 0.435587894094 % [Master] wasted Tiles 0 end!!!!!! ************************************************** Generation of the graphical cartography... Plot cartography in 2D projected on parameters b and C3_WORST to file './test/Sched2-100-0_cart_patator.png'. IMITATOR successfully terminated (after 11.608 seconds) salloc: Relinquishing job allocation 96680 hoangia90@magi1:~/imitator$