About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T4N04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 312.123 | 9331.00 | 13603.00 | 265.10 | 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-162132119900394.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-Z4T4N04, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r318-tall-162132119900394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 160K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 726K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 830K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 9.4K May 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 11 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 128K 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 1621422211983
Running Version 0
[2021-05-19 11:03:33] [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:03:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:03:33] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-19 11:03:33] [INFO ] Transformed 154 places.
[2021-05-19 11:03:33] [INFO ] Transformed 300 transitions.
[2021-05-19 11:03:33] [INFO ] Parsed PT model containing 154 places and 300 transitions in 94 ms.
Discarding 96 transitions out of 300. Remains 204
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.18195KB memory used
Starting structural reductions, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 154 transition count 220
Applied a total of 16 rules in 25 ms. Remains 154 /154 variables (removed 0) and now considering 220/236 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 154/154 places, 220/236 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2937 ms (no deadlock found). (steps per millisecond=425 )
Random directed walk for 1250002 steps, including 0 resets, run took 1944 ms (no deadlock found). (steps per millisecond=643 )
// Phase 1: matrix 220 rows 154 cols
[2021-05-19 11:03:38] [INFO ] Computed 11 place invariants in 10 ms
[2021-05-19 11:03:38] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
Starting structural reductions, iteration 0 : 154/154 places, 300/300 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 208 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 208 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 240 place count 74 transition count 140
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 256 place count 66 transition count 132
Applied a total of 256 rules in 14 ms. Remains 66 /154 variables (removed 88) and now considering 132/300 (removed 168) transitions.
// Phase 1: matrix 132 rows 66 cols
[2021-05-19 11:03:38] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-19 11:03:38] [INFO ] Implicit Places using invariants in 113 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 115 ms to find 2 implicit places.
// Phase 1: matrix 132 rows 64 cols
[2021-05-19 11:03:38] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-19 11:03:39] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 64/154 places, 132/300 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 48 transition count 116
Applied a total of 32 rules in 5 ms. Remains 48 /64 variables (removed 16) and now considering 116/132 (removed 16) transitions.
// Phase 1: matrix 116 rows 48 cols
[2021-05-19 11:03:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-19 11:03:39] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 116 rows 48 cols
[2021-05-19 11:03:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-19 11:03:39] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/154 places, 116/300 transitions.
Discarding 16 transitions out of 116. Remains 100
[2021-05-19 11:03:39] [INFO ] Initial state test concluded for 4 properties.
Finished random walk after 364 steps, including 0 resets, run visited all 96 properties in 7 ms. (steps per millisecond=52 )
Able to resolve query QuasiLiveness after proving 100 properties.
Starting structural reductions, iteration 0 : 154/154 places, 300/300 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 208 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 208 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 240 place count 74 transition count 140
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 256 place count 66 transition count 132
Applied a total of 256 rules in 8 ms. Remains 66 /154 variables (removed 88) and now considering 132/300 (removed 168) transitions.
// Phase 1: matrix 132 rows 66 cols
[2021-05-19 11:03:39] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-19 11:03:39] [INFO ] Implicit Places using invariants in 64 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
// Phase 1: matrix 132 rows 64 cols
[2021-05-19 11:03:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-19 11:03:39] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 64/154 places, 132/300 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 48 transition count 116
Applied a total of 32 rules in 8 ms. Remains 48 /64 variables (removed 16) and now considering 116/132 (removed 16) transitions.
// Phase 1: matrix 116 rows 48 cols
[2021-05-19 11:03:39] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-19 11:03:39] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 116 rows 48 cols
[2021-05-19 11:03:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-19 11:03:39] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/154 places, 116/300 transitions.
Discarding 16 transitions out of 116. Remains 100
[2021-05-19 11:03:39] [INFO ] Flatten gal took : 37 ms
[2021-05-19 11:03:39] [INFO ] Flatten gal took : 14 ms
[2021-05-19 11:03:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12318901308938550765.gal : 8 ms
[2021-05-19 11:03:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2928402917411379797.ctl : 2 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/CTLFireability12318901308938550765.gal, -t, CGAL, -ctl, /tmp/CTLFireability2928402917411379797.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/CTLFireability12318901308938550765.gal -t CGAL -ctl /tmp/CTLFireability2928402917411379797.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 100 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,1.08506e+06,0.024775,5112,2,209,5,2026,6,0,311,1367,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.073637,6820,1,0,6,11708,14,0,1479,6661,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.078846,7084,1,0,7,12568,15,0,1480,7467,8
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 2,1,0.091378,7612,1,0,8,14294,16,0,1481,9301,11
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 3,1,0.112928,8140,1,0,9,17031,17,0,1482,12315,14
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 4,1,0.129654,8668,1,0,10,19486,18,0,1483,14836,17
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 5,1,0.134365,8932,1,0,11,20192,19,0,1484,15400,20
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 6,1,0.141997,9196,1,0,12,21314,20,0,1485,16443,23
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 7,1,0.152443,9460,1,0,13,22841,21,0,1486,17865,26
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 8,1,0.16092,9724,1,0,14,23587,22,0,1487,18663,29
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 9,1,0.162715,9988,1,0,15,23788,23,0,1488,18737,32
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_2_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_2_2>=1)))))] = FALSE
(forward)formula 10,1,0.163873,10252,1,0,16,23906,24,0,1489,18771,35
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_2_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_2_3>=1)))))] = FALSE
(forward)formula 11,1,0.164881,10516,1,0,17,23946,25,0,1490,18779,38
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 12,1,0.166234,10516,1,0,18,24121,26,0,1491,18861,41
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 13,1,0.167293,10516,1,0,19,24262,27,0,1492,18911,44
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_3_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_3_2>=1)))))] = FALSE
(forward)formula 14,1,0.16825,10516,1,0,20,24367,28,0,1493,18951,47
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_0>=1)&&(OpenRequests_3_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_0>=1)&&(OpenRequests_3_3>=1)))))] = FALSE
(forward)formula 15,1,0.169062,10516,1,0,21,24433,29,0,1494,18981,50
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 16,1,0.173667,10516,1,0,22,25021,30,0,1495,19556,53
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 17,1,0.177497,10516,1,0,23,25442,31,0,1496,19987,56
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 18,1,0.189321,10516,1,0,24,26239,32,0,1497,20921,59
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 19,1,0.19919,10780,1,0,25,27141,33,0,1498,22011,62
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 20,1,0.202953,11044,1,0,26,27538,34,0,1499,22335,65
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 21,1,0.20748,11308,1,0,27,27975,35,0,1500,22749,68
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 22,1,0.22151,11308,1,0,28,28555,36,0,1501,23351,71
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 23,1,0.228319,11572,1,0,29,29098,37,0,1502,23958,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.232913,11572,1,0,30,29440,38,0,1503,24313,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.233711,11572,1,0,31,29487,39,0,1504,24313,80
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_2_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_2_2>=1)))))] = FALSE
(forward)formula 26,1,0.234838,11572,1,0,32,29525,40,0,1505,24313,83
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_2_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_2_3>=1)))))] = FALSE
(forward)formula 27,1,0.235619,11572,1,0,33,29553,41,0,1506,24313,86
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 28,1,0.236277,11572,1,0,34,29564,42,0,1507,24313,89
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 29,1,0.236845,11572,1,0,35,29573,43,0,1508,24313,92
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_3_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_3_2>=1)))))] = FALSE
(forward)formula 30,1,0.23739,11572,1,0,36,29580,44,0,1509,24313,95
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_1>=1)&&(OpenRequests_3_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_1>=1)&&(OpenRequests_3_3>=1)))))] = FALSE
(forward)formula 31,1,0.237916,11572,1,0,37,29585,45,0,1510,24313,98
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 32,1,0.256771,11836,1,0,38,31139,46,0,1511,26257,101
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 33,1,0.260885,12100,1,0,39,31574,47,0,1512,26875,104
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 34,1,0.265375,12100,1,0,40,32050,48,0,1513,27460,107
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 35,1,0.276425,12364,1,0,41,33462,49,0,1514,29190,110
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 36,1,0.284169,12628,1,0,42,34387,50,0,1515,30251,113
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 37,1,0.288518,12892,1,0,43,34885,51,0,1516,30805,116
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 38,1,0.294126,12892,1,0,44,35403,52,0,1517,31429,119
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 39,1,0.301455,13156,1,0,45,36054,53,0,1518,32183,122
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_2_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_2_0>=1)))))] = FALSE
(forward)formula 40,1,0.305028,13420,1,0,46,36240,54,0,1519,32390,125
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_2_1>=1)))))] = FALSE
(forward)formula 41,1,0.305925,13684,1,0,47,36287,55,0,1520,32390,128
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_2_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_2_2>=1)))))] = FALSE
(forward)formula 42,1,0.306602,13684,1,0,48,36325,56,0,1521,32390,131
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_2_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_2_3>=1)))))] = FALSE
(forward)formula 43,1,0.307229,13684,1,0,49,36353,57,0,1522,32390,134
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_3_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_3_0>=1)))))] = FALSE
(forward)formula 44,1,0.307811,13684,1,0,50,36364,58,0,1523,32390,137
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_3_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_3_1>=1)))))] = FALSE
(forward)formula 45,1,0.308328,13684,1,0,51,36373,59,0,1524,32390,140
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_3_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_3_2>=1)))))] = FALSE
(forward)formula 46,1,0.308844,13684,1,0,52,36380,60,0,1525,32390,143
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_2>=1)&&(OpenRequests_3_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_2>=1)&&(OpenRequests_3_3>=1)))))] = FALSE
(forward)formula 47,1,0.309326,13684,1,0,53,36385,61,0,1526,32390,146
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_0>=1)))))] = FALSE
(forward)formula 48,1,0.322343,13684,1,0,54,38169,62,0,1527,34536,149
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_1>=1)))))] = FALSE
(forward)formula 49,1,0.325022,13948,1,0,55,38371,63,0,1528,34736,152
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_2>=1)))))] = FALSE
(forward)formula 50,1,0.327608,14212,1,0,56,38568,64,0,1529,34921,155
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_0_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_0_3>=1)))))] = FALSE
(forward)formula 51,1,0.330993,14212,1,0,57,38817,65,0,1530,35163,158
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_0>=1)))))] = FALSE
(forward)formula 52,1,0.335311,14476,1,0,58,39130,66,0,1531,35543,161
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_1>=1)))))] = FALSE
(forward)formula 53,1,0.338616,14740,1,0,59,39407,67,0,1532,35839,164
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_2>=1)))))] = FALSE
(forward)formula 54,1,0.341363,14740,1,0,60,39643,68,0,1533,36079,167
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_1_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_1_3>=1)))))] = FALSE
(forward)formula 55,1,0.343944,14740,1,0,61,39866,69,0,1534,36266,170
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_2_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_2_0>=1)))))] = FALSE
(forward)formula 56,1,0.345024,15004,1,0,62,39919,70,0,1535,36286,173
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_2_1>=1)))))] = FALSE
(forward)formula 57,1,0.34575,15004,1,0,63,39966,71,0,1536,36286,176
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_2_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_2_2>=1)))))] = FALSE
(forward)formula 58,1,0.346456,15004,1,0,64,40004,72,0,1537,36286,179
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_2_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_2_3>=1)))))] = FALSE
(forward)formula 59,1,0.347093,15004,1,0,65,40032,73,0,1538,36286,182
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_3_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_3_0>=1)))))] = FALSE
(forward)formula 60,1,0.347681,15004,1,0,66,40043,74,0,1539,36286,185
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_3_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_3_1>=1)))))] = FALSE
(forward)formula 61,1,0.348194,15004,1,0,67,40052,75,0,1540,36286,188
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_3_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_3_2>=1)))))] = FALSE
(forward)formula 62,1,0.348695,15004,1,0,68,40059,76,0,1541,36286,191
Formula is TRUE !
***************************************
original formula: AG(EF(((IdleTechs_3>=1)&&(OpenRequests_3_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((IdleTechs_3>=1)&&(OpenRequests_3_3>=1)))))] = FALSE
(forward)formula 63,1,0.349178,15004,1,0,69,40064,77,0,1542,36286,194
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 64,1,0.355381,15004,1,0,70,40757,78,0,1542,37208,197
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 65,1,0.359169,15004,1,0,71,41062,79,0,1542,37551,200
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 66,1,0.360022,15268,1,0,72,41062,80,0,1542,37551,203
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 67,1,0.360391,15268,1,0,73,41067,81,0,1542,37555,206
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 68,1,0.362223,15268,1,0,74,41240,82,0,1543,37635,209
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 69,1,0.366928,15268,1,0,75,42040,83,0,1544,38229,212
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 70,1,0.377768,15532,1,0,76,43851,84,0,1545,39898,215
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 71,1,0.381243,15796,1,0,77,44207,85,0,1546,40193,218
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_0_2>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_2>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 72,1,0.401276,16324,1,0,78,47174,86,0,1547,43136,221
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_0_2>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_2>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 73,1,0.408351,16588,1,0,79,47842,87,0,1548,43840,224
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_0_3>=1)&&(ClientsWaiting_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_3>=1)&&(ClientsWaiting_0>=1)))))] = FALSE
(forward)formula 74,1,0.454293,17116,1,0,80,52082,88,0,1549,48183,227
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_0_3>=1)&&(ClientsTimeout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_0_3>=1)&&(ClientsTimeout_0>=1)))))] = FALSE
(forward)formula 75,1,0.476005,17380,1,0,81,53625,89,0,1550,50044,230
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 76,1,0.478855,17644,1,0,82,54019,90,0,1551,50266,233
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 77,1,0.480361,17908,1,0,83,54152,91,0,1552,50302,236
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 78,1,0.486615,17908,1,0,84,55169,92,0,1553,51084,239
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 79,1,0.489468,18172,1,0,85,55442,93,0,1554,51285,242
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_1_2>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_2>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 80,1,0.512734,18172,1,0,86,57089,94,0,1555,52797,245
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_1_2>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_2>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 81,1,0.517479,18436,1,0,87,57596,95,0,1556,53275,248
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_1_3>=1)&&(ClientsTimeout_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_3>=1)&&(ClientsTimeout_1>=1)))))] = FALSE
(forward)formula 82,1,0.524561,18700,1,0,88,58471,96,0,1557,54064,251
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_1_3>=1)&&(ClientsWaiting_1>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_1_3>=1)&&(ClientsWaiting_1>=1)))))] = FALSE
(forward)formula 83,1,0.538129,18964,1,0,89,60634,97,0,1558,56096,254
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 84,1,0.539988,19228,1,0,90,60849,98,0,1559,56166,257
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 85,1,0.540698,19228,1,0,91,60887,99,0,1560,56168,260
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 86,1,0.542027,19228,1,0,92,61099,100,0,1561,56240,263
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 87,1,0.542748,19492,1,0,93,61135,101,0,1562,56242,266
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_2_2>=1)&&(ClientsTimeout_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_2>=1)&&(ClientsTimeout_2>=1)))))] = FALSE
(forward)formula 88,1,0.543956,19492,1,0,94,61291,102,0,1563,56294,269
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_2_2>=1)&&(ClientsWaiting_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_2>=1)&&(ClientsWaiting_2>=1)))))] = FALSE
(forward)formula 89,1,0.544711,19492,1,0,95,61327,103,0,1564,56298,272
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_2_3>=1)&&(ClientsTimeout_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_3>=1)&&(ClientsTimeout_2>=1)))))] = FALSE
(forward)formula 90,1,0.545486,19492,1,0,96,61381,104,0,1565,56308,275
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_2_3>=1)&&(ClientsWaiting_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_2_3>=1)&&(ClientsWaiting_2>=1)))))] = FALSE
(forward)formula 91,1,0.54646,19492,1,0,97,61489,105,0,1566,56354,278
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 92,1,0.547468,19492,1,0,98,61636,106,0,1567,56402,281
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 93,1,0.548008,19492,1,0,99,61639,107,0,1568,56403,284
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 94,1,0.548844,19492,1,0,100,61764,108,0,1569,56438,287
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 95,1,0.549511,19492,1,0,101,61784,109,0,1570,56453,290
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_3_2>=1)&&(ClientsWaiting_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_2>=1)&&(ClientsWaiting_3>=1)))))] = FALSE
(forward)formula 96,1,0.5503,19492,1,0,102,61875,110,0,1571,56480,293
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_3_2>=1)&&(ClientsTimeout_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_2>=1)&&(ClientsTimeout_3>=1)))))] = FALSE
(forward)formula 97,1,0.550999,19492,1,0,103,61895,111,0,1572,56493,296
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_3_3>=1)&&(ClientsTimeout_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_3>=1)&&(ClientsTimeout_3>=1)))))] = FALSE
(forward)formula 98,1,0.55182,19492,1,0,104,61969,112,0,1573,56522,299
Formula is TRUE !
***************************************
original formula: AG(EF(((Assigned_3_3>=1)&&(ClientsWaiting_3>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((Assigned_3_3>=1)&&(ClientsWaiting_3>=1)))))] = FALSE
(forward)formula 99,1,0.552355,19492,1,0,105,61971,113,0,1574,56523,302
Formula is TRUE !
***************************************
Able to resolve query Liveness after proving 100 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
BK_STOP 1621422221314
--------------------
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-Z4T4N04"
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-Z4T4N04, 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-162132119900394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T4N04.tgz
mv UtilityControlRoom-PT-Z4T4N04 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 '
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 ;