fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r318-tall-162132119800344
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for UtilityControlRoom-PT-Z2T3N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
821.144 10428.00 15695.00 225.00 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r318-tall-162132119800344.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-PT-Z2T3N10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r318-tall-162132119800344
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 443K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 213K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 834K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 8.8K May 12 04:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 12 04:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K May 11 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 11 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.0K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 116K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1621422009156

Running Version 0
[2021-05-19 11:00:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2021-05-19 11:00:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:00:10] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-19 11:00:10] [INFO ] Transformed 174 places.
[2021-05-19 11:00:10] [INFO ] Transformed 270 transitions.
[2021-05-19 11:00:10] [INFO ] Parsed PT model containing 174 places and 270 transitions in 96 ms.
Discarding 80 transitions out of 270. Remains 190
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.17741KB memory used
Starting structural reductions, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 174 transition count 210
Applied a total of 20 rules in 25 ms. Remains 174 /174 variables (removed 0) and now considering 210/230 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 210/230 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3040 ms (no deadlock found). (steps per millisecond=411 )
Random directed walk for 1250007 steps, including 0 resets, run took 2291 ms (no deadlock found). (steps per millisecond=545 )
// Phase 1: matrix 210 rows 174 cols
[2021-05-19 11:00:16] [INFO ] Computed 23 place invariants in 12 ms
[2021-05-19 11:00:16] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned unsat
Starting structural reductions, iteration 0 : 174/174 places, 270/270 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 140 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 140 place count 134 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 180 place count 114 transition count 150
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 94 transition count 130
Applied a total of 220 rules in 20 ms. Remains 94 /174 variables (removed 80) and now considering 130/270 (removed 140) transitions.
// Phase 1: matrix 130 rows 94 cols
[2021-05-19 11:00:16] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-19 11:00:16] [INFO ] Implicit Places using invariants in 98 ms returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
// Phase 1: matrix 130 rows 92 cols
[2021-05-19 11:00:16] [INFO ] Computed 21 place invariants in 12 ms
[2021-05-19 11:00:16] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Starting structural reductions, iteration 1 : 92/174 places, 130/270 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 72 transition count 110
Applied a total of 40 rules in 7 ms. Remains 72 /92 variables (removed 20) and now considering 110/130 (removed 20) transitions.
// Phase 1: matrix 110 rows 72 cols
[2021-05-19 11:00:16] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-19 11:00:16] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 110 rows 72 cols
[2021-05-19 11:00:16] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-19 11:00:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 72/174 places, 110/270 transitions.
Discarding 20 transitions out of 110. Remains 90
[2021-05-19 11:00:16] [INFO ] Initial state test concluded for 10 properties.
Finished random walk after 1819 steps, including 0 resets, run visited all 80 properties in 14 ms. (steps per millisecond=129 )
Able to resolve query QuasiLiveness after proving 90 properties.
Starting structural reductions, iteration 0 : 174/174 places, 270/270 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 140 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 140 place count 134 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 180 place count 114 transition count 150
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 94 transition count 130
Applied a total of 220 rules in 12 ms. Remains 94 /174 variables (removed 80) and now considering 130/270 (removed 140) transitions.
// Phase 1: matrix 130 rows 94 cols
[2021-05-19 11:00:16] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-19 11:00:16] [INFO ] Implicit Places using invariants in 91 ms returned [52, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
// Phase 1: matrix 130 rows 92 cols
[2021-05-19 11:00:17] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-19 11:00:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 92/174 places, 130/270 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 72 transition count 110
Applied a total of 40 rules in 25 ms. Remains 72 /92 variables (removed 20) and now considering 110/130 (removed 20) transitions.
// Phase 1: matrix 110 rows 72 cols
[2021-05-19 11:00:17] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-19 11:00:17] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 110 rows 72 cols
[2021-05-19 11:00:17] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-19 11:00:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 72/174 places, 110/270 transitions.
Discarding 20 transitions out of 110. Remains 90
[2021-05-19 11:00:17] [INFO ] Flatten gal took : 39 ms
[2021-05-19 11:00:17] [INFO ] Flatten gal took : 15 ms
[2021-05-19 11:00:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15796390070320750602.gal : 8 ms
[2021-05-19 11:00:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10334057547988242039.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15796390070320750602.gal, -t, CGAL, -ctl, /tmp/CTLFireability10334057547988242039.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15796390070320750602.gal -t CGAL -ctl /tmp/CTLFireability10334057547988242039.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 90 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.66797e+08,0.027313,4972,2,401,5,2898,6,0,401,1626,0


Converting to forward existential form...Done !
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.107002,8592,1,0,6,26021,14,0,1848,8169,5
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 1,1,0.130311,9648,1,0,7,31609,15,0,1849,11830,8
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 2,1,0.159228,10704,1,0,8,38465,16,0,1850,16327,11
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 3,1,0.183078,11232,1,0,9,42514,17,0,1851,19010,14
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_2_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_2_0>=1)))))] = FALSE
(forward)formula 4,1,0.213587,12288,1,0,10,48855,18,0,1852,22714,17
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_2_1>=1)))))] = FALSE
(forward)formula 5,1,0.244832,12816,1,0,11,52443,19,0,1853,24784,20
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_3_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_3_0>=1)))))] = FALSE
(forward)formula 6,1,0.273944,13344,1,0,12,57275,20,0,1854,27228,23
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_3_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_3_1>=1)))))] = FALSE
(forward)formula 7,1,0.285752,13872,1,0,13,59939,21,0,1855,28486,26
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_4_0>=1)))))] = FALSE
(forward)formula 8,1,0.294507,14136,1,0,14,61693,22,0,1856,29495,29
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_4_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_4_1>=1)))))] = FALSE
(forward)formula 9,1,0.300622,14400,1,0,15,62709,23,0,1857,29950,32
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_5_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_5_0>=1)))))] = FALSE
(forward)formula 10,1,0.304094,14664,1,0,16,62906,24,0,1858,30059,35
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_5_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_5_1>=1)))))] = FALSE
(forward)formula 11,1,0.30617,14664,1,0,17,63041,25,0,1859,30067,38
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_6_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_6_0>=1)))))] = FALSE
(forward)formula 12,1,0.308435,14664,1,0,18,63227,26,0,1860,30130,41
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_6_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_6_1>=1)))))] = FALSE
(forward)formula 13,1,0.310514,14664,1,0,19,63373,27,0,1861,30162,44
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_7_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_7_0>=1)))))] = FALSE
(forward)formula 14,1,0.313013,14928,1,0,20,63602,28,0,1862,30281,47
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_7_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_7_1>=1)))))] = FALSE
(forward)formula 15,1,0.315336,14928,1,0,21,63788,29,0,1863,30367,50
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_8_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_8_0>=1)))))] = FALSE
(forward)formula 16,1,0.317933,14928,1,0,22,64038,30,0,1864,30523,53
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_8_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_8_1>=1)))))] = FALSE
(forward)formula 17,1,0.320203,14928,1,0,23,64188,31,0,1865,30616,56
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_9_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_9_0>=1)))))] = FALSE
(forward)formula 18,1,0.322301,14928,1,0,24,64348,32,0,1866,30708,59
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_9_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_9_1>=1)))))] = FALSE
(forward)formula 19,1,0.323832,14928,1,0,25,64405,33,0,1867,30743,62
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 20,1,0.33591,15456,1,0,26,66360,34,0,1868,32262,65
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 21,1,0.357485,15716,1,0,27,70369,35,0,1869,35188,68
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 22,1,0.365962,15980,1,0,28,71437,36,0,1870,36169,71
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 23,1,0.387082,16508,1,0,29,74977,37,0,1871,38754,74
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_2_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_2_0>=1)))))] = FALSE
(forward)formula 24,1,0.395105,17036,1,0,30,75984,38,0,1872,39520,77
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_2_1>=1)))))] = FALSE
(forward)formula 25,1,0.415605,17300,1,0,31,79283,39,0,1873,41717,80
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_3_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_3_0>=1)))))] = FALSE
(forward)formula 26,1,0.422424,17564,1,0,32,80120,40,0,1874,42252,83
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_3_1>=1)))))] = FALSE
(forward)formula 27,1,0.456173,18092,1,0,33,82766,41,0,1875,43777,86
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_4_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_4_0>=1)))))] = FALSE
(forward)formula 28,1,0.460963,18356,1,0,34,83188,42,0,1876,44020,89
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_4_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_4_1>=1)))))] = FALSE
(forward)formula 29,1,0.468701,18356,1,0,35,84352,43,0,1877,44654,92
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_5_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_5_0>=1)))))] = FALSE
(forward)formula 30,1,0.4716,18620,1,0,36,84500,44,0,1878,44684,95
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_5_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_5_1>=1)))))] = FALSE
(forward)formula 31,1,0.472754,18620,1,0,37,84621,45,0,1879,44684,98
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_6_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_6_0>=1)))))] = FALSE
(forward)formula 32,1,0.474049,18620,1,0,38,84727,46,0,1880,44684,101
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_6_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_6_1>=1)))))] = FALSE
(forward)formula 33,1,0.475264,18620,1,0,39,84831,47,0,1881,44684,104
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_7_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_7_0>=1)))))] = FALSE
(forward)formula 34,1,0.47665,18620,1,0,40,84900,48,0,1882,44684,107
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_7_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_7_1>=1)))))] = FALSE
(forward)formula 35,1,0.477701,18620,1,0,41,84968,49,0,1883,44684,110
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_8_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_8_0>=1)))))] = FALSE
(forward)formula 36,1,0.479156,18620,1,0,42,84985,50,0,1884,44684,113
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_8_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_8_1>=1)))))] = FALSE
(forward)formula 37,1,0.480054,18620,1,0,43,85000,51,0,1885,44684,116
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_9_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_9_0>=1)))))] = FALSE
(forward)formula 38,1,0.480889,18620,1,0,44,85013,52,0,1886,44684,119
Formula is TRUE !

***************************************

original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_9_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_9_1>=1)))))] = FALSE
(forward)formula 39,1,0.481813,18620,1,0,45,85018,53,0,1887,44684,122
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_0>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_0>=1))))] = FALSE
(forward)formula 40,1,0.515669,19412,1,0,46,91647,54,0,1887,49375,125
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_1>=1))))] = FALSE
(forward)formula 41,1,0.567563,20204,1,0,47,98195,55,0,1887,53921,128
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_2>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_2>=1))))] = FALSE
(forward)formula 42,1,0.597452,21260,1,0,48,104286,56,0,1887,57565,131
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_3>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_3>=1))))] = FALSE
(forward)formula 43,1,0.642595,22052,1,0,49,108964,57,0,1887,59913,134
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_4>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_4>=1))))] = FALSE
(forward)formula 44,1,0.650622,22316,1,0,50,110655,58,0,1887,60928,137
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_5>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_5>=1))))] = FALSE
(forward)formula 45,1,0.653823,22580,1,0,51,111125,59,0,1887,61267,140
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_6>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_6>=1))))] = FALSE
(forward)formula 46,1,0.656533,22580,1,0,52,111480,60,0,1887,61533,143
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_7>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_7>=1))))] = FALSE
(forward)formula 47,1,0.657898,22580,1,0,53,111612,61,0,1887,61632,146
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_8>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_8>=1))))] = FALSE
(forward)formula 48,1,0.658587,22580,1,0,54,111628,62,0,1887,61646,149
Formula is TRUE !

***************************************

original formula: AG(EF((Clients_9>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Clients_9>=1))))] = FALSE
(forward)formula 49,1,0.65925,22580,1,0,55,111635,63,0,1887,61652,152
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_0>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_0>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 50,1,0.665011,22580,1,0,56,112707,64,0,1888,62250,155
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_0>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_0>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 51,1,0.681978,23372,1,0,57,116649,65,0,1889,64560,158
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_1>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_1>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 52,1,0.700302,23900,1,0,58,120338,66,0,1890,67031,161
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_0_1>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_1>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 53,1,0.749987,25484,1,0,59,130946,67,0,1891,73698,164
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_0>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_0>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 54,1,0.757377,25936,1,0,60,132012,68,0,1892,74296,167
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_0>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_0>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 55,1,0.7752,26460,1,0,61,135749,69,0,1893,76526,170
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_1>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_1>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 56,1,0.826657,28044,1,0,62,146085,70,0,1894,82964,173
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_1_1>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_1>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 57,1,0.84738,28572,1,0,63,149737,71,0,1895,85388,176
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_0>=1)&&(ClientsTimeout_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_0>=1)&&(ClientsTimeout_2>=1)))))] = FALSE
(forward)formula 58,1,0.853209,28836,1,0,64,150725,72,0,1896,85857,179
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_0>=1)&&(ClientsWaiting_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_0>=1)&&(ClientsWaiting_2>=1)))))] = FALSE
(forward)formula 59,1,0.868833,29364,1,0,65,153882,73,0,1897,87471,182
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_1>=1)&&(ClientsWaiting_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_1>=1)&&(ClientsWaiting_2>=1)))))] = FALSE
(forward)formula 60,1,0.916881,30684,1,0,66,163165,74,0,1898,92453,185
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_2_1>=1)&&(ClientsTimeout_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_1>=1)&&(ClientsTimeout_2>=1)))))] = FALSE
(forward)formula 61,1,0.936439,31212,1,0,67,166492,75,0,1899,94375,188
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_0>=1)&&(ClientsWaiting_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_0>=1)&&(ClientsWaiting_3>=1)))))] = FALSE
(forward)formula 62,1,0.984281,32004,1,0,68,168783,76,0,1900,95344,191
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_0>=1)&&(ClientsTimeout_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_0>=1)&&(ClientsTimeout_3>=1)))))] = FALSE
(forward)formula 63,1,0.989084,32268,1,0,69,169573,77,0,1901,95643,194
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_1>=1)&&(ClientsWaiting_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_1>=1)&&(ClientsWaiting_3>=1)))))] = FALSE
(forward)formula 64,1,1.01856,32532,1,0,70,176410,78,0,1902,98692,197
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_3_1>=1)&&(ClientsTimeout_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_1>=1)&&(ClientsTimeout_3>=1)))))] = FALSE
(forward)formula 65,1,1.03041,33060,1,0,71,178912,79,0,1903,99839,200
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_0>=1)&&(ClientsWaiting_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_0>=1)&&(ClientsWaiting_4>=1)))))] = FALSE
(forward)formula 66,1,1.03441,33324,1,0,72,179637,80,0,1904,100109,203
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_0>=1)&&(ClientsTimeout_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_0>=1)&&(ClientsTimeout_4>=1)))))] = FALSE
(forward)formula 67,1,1.03679,33324,1,0,73,179988,81,0,1905,100203,206
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_1>=1)&&(ClientsWaiting_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_1>=1)&&(ClientsWaiting_4>=1)))))] = FALSE
(forward)formula 68,1,1.04656,33324,1,0,74,182002,82,0,1906,101182,209
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_4_1>=1)&&(ClientsTimeout_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_4_1>=1)&&(ClientsTimeout_4>=1)))))] = FALSE
(forward)formula 69,1,1.05082,33588,1,0,75,182707,83,0,1907,101511,212
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_0>=1)&&(ClientsWaiting_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_0>=1)&&(ClientsWaiting_5>=1)))))] = FALSE
(forward)formula 70,1,1.05205,33588,1,0,76,182846,84,0,1908,101517,215
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_0>=1)&&(ClientsTimeout_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_0>=1)&&(ClientsTimeout_5>=1)))))] = FALSE
(forward)formula 71,1,1.05325,33852,1,0,77,182983,85,0,1909,101527,218
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_1>=1)&&(ClientsWaiting_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_1>=1)&&(ClientsWaiting_5>=1)))))] = FALSE
(forward)formula 72,1,1.05461,33852,1,0,78,183162,86,0,1910,101553,221
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_5_1>=1)&&(ClientsTimeout_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_5_1>=1)&&(ClientsTimeout_5>=1)))))] = FALSE
(forward)formula 73,1,1.05589,33852,1,0,79,183311,87,0,1911,101569,224
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_0>=1)&&(ClientsTimeout_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_0>=1)&&(ClientsTimeout_6>=1)))))] = FALSE
(forward)formula 74,1,1.05714,33852,1,0,80,183460,88,0,1912,101602,227
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_0>=1)&&(ClientsWaiting_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_0>=1)&&(ClientsWaiting_6>=1)))))] = FALSE
(forward)formula 75,1,1.05851,33852,1,0,81,183562,89,0,1913,101604,230
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_1>=1)&&(ClientsTimeout_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_1>=1)&&(ClientsTimeout_6>=1)))))] = FALSE
(forward)formula 76,1,1.05983,33852,1,0,82,183712,90,0,1914,101639,233
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_6_1>=1)&&(ClientsWaiting_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_6_1>=1)&&(ClientsWaiting_6>=1)))))] = FALSE
(forward)formula 77,1,1.06079,33852,1,0,83,183812,91,0,1915,101641,236
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_0>=1)&&(ClientsTimeout_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_0>=1)&&(ClientsTimeout_7>=1)))))] = FALSE
(forward)formula 78,1,1.06238,33852,1,0,84,183989,92,0,1916,101729,239
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_0>=1)&&(ClientsWaiting_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_0>=1)&&(ClientsWaiting_7>=1)))))] = FALSE
(forward)formula 79,1,1.06326,33852,1,0,85,184043,93,0,1917,101734,242
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_1>=1)&&(ClientsTimeout_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_1>=1)&&(ClientsTimeout_7>=1)))))] = FALSE
(forward)formula 80,1,1.06485,33852,1,0,86,184221,94,0,1918,101824,245
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_7_1>=1)&&(ClientsWaiting_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_7_1>=1)&&(ClientsWaiting_7>=1)))))] = FALSE
(forward)formula 81,1,1.06566,34116,1,0,87,184270,95,0,1919,101828,248
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_8_0>=1)&&(ClientsTimeout_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_8_0>=1)&&(ClientsTimeout_8>=1)))))] = FALSE
(forward)formula 82,1,1.06734,34116,1,0,88,184482,96,0,1920,101944,251
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_8_0>=1)&&(ClientsWaiting_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_8_0>=1)&&(ClientsWaiting_8>=1)))))] = FALSE
(forward)formula 83,1,1.06799,34116,1,0,89,184493,97,0,1921,101946,254
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_8_1>=1)&&(ClientsTimeout_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_8_1>=1)&&(ClientsTimeout_8>=1)))))] = FALSE
(forward)formula 84,1,1.06956,34116,1,0,90,184694,98,0,1922,102050,257
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_8_1>=1)&&(ClientsWaiting_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_8_1>=1)&&(ClientsWaiting_8>=1)))))] = FALSE
(forward)formula 85,1,1.07017,34116,1,0,91,184703,99,0,1923,102052,260
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_9_0>=1)&&(ClientsTimeout_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_9_0>=1)&&(ClientsTimeout_9>=1)))))] = FALSE
(forward)formula 86,1,1.07126,34116,1,0,92,184804,100,0,1924,102109,263
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_9_0>=1)&&(ClientsWaiting_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_9_0>=1)&&(ClientsWaiting_9>=1)))))] = FALSE
(forward)formula 87,1,1.07181,34116,1,0,93,184807,101,0,1925,102110,266
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_9_1>=1)&&(ClientsWaiting_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_9_1>=1)&&(ClientsWaiting_9>=1)))))] = FALSE
(forward)formula 88,1,1.07276,34116,1,0,94,184902,102,0,1926,102152,269
Formula is TRUE !

***************************************

original formula: AG(EF(((Assigned_9_1>=1)&&(ClientsTimeout_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_9_1>=1)&&(ClientsTimeout_9>=1)))))] = FALSE
(forward)formula 89,1,1.07343,34116,1,0,95,184910,103,0,1927,102162,272
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 90 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1621422019584

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z2T3N10"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T3N10, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r318-tall-162132119800344"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N10.tgz
mv UtilityControlRoom-PT-Z2T3N10 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;