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-162132119800334.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-Z2T3N06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r318-tall-162132119800334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 86K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 371K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 114K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 465K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.2K May 12 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K May 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 70K 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 1621421959023

Running Version 0
[2021-05-19 10:59:20] [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 10:59:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 10:59:20] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-19 10:59:20] [INFO ] Transformed 106 places.
[2021-05-19 10:59:20] [INFO ] Transformed 162 transitions.
[2021-05-19 10:59:20] [INFO ] Parsed PT model containing 106 places and 162 transitions in 81 ms.
Discarding 48 transitions out of 162. Remains 114
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.16755KB memory used
Starting structural reductions, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 106 transition count 126
Applied a total of 12 rules in 21 ms. Remains 106 /106 variables (removed 0) and now considering 126/138 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 126/138 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2497 ms (no deadlock found). (steps per millisecond=500 )
Random directed walk for 1250000 steps, including 0 resets, run took 1704 ms (no deadlock found). (steps per millisecond=733 )
// Phase 1: matrix 126 rows 106 cols
[2021-05-19 10:59:24] [INFO ] Computed 15 place invariants in 12 ms
[2021-05-19 10:59:25] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned unsat
Starting structural reductions, iteration 0 : 106/106 places, 162/162 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 84 place count 82 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 84 place count 82 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 108 place count 70 transition count 90
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 132 place count 58 transition count 78
Applied a total of 132 rules in 18 ms. Remains 58 /106 variables (removed 48) and now considering 78/162 (removed 84) transitions.
// Phase 1: matrix 78 rows 58 cols
[2021-05-19 10:59:25] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-19 10:59:25] [INFO ] Implicit Places using invariants in 86 ms returned [32, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
// Phase 1: matrix 78 rows 56 cols
[2021-05-19 10:59:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-19 10:59:25] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 56/106 places, 78/162 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 44 transition count 66
Applied a total of 24 rules in 5 ms. Remains 44 /56 variables (removed 12) and now considering 66/78 (removed 12) transitions.
// Phase 1: matrix 66 rows 44 cols
[2021-05-19 10:59:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-19 10:59:25] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 66 rows 44 cols
[2021-05-19 10:59:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-19 10:59:25] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/106 places, 66/162 transitions.
Discarding 12 transitions out of 66. Remains 54
[2021-05-19 10:59:25] [INFO ] Initial state test concluded for 6 properties.
Finished random walk after 376 steps, including 0 resets, run visited all 48 properties in 5 ms. (steps per millisecond=75 )
Able to resolve query QuasiLiveness after proving 54 properties.
Starting structural reductions, iteration 0 : 106/106 places, 162/162 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 84 place count 82 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 84 place count 82 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 108 place count 70 transition count 90
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 132 place count 58 transition count 78
Applied a total of 132 rules in 12 ms. Remains 58 /106 variables (removed 48) and now considering 78/162 (removed 84) transitions.
// Phase 1: matrix 78 rows 58 cols
[2021-05-19 10:59:25] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-19 10:59:25] [INFO ] Implicit Places using invariants in 111 ms returned [32, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
// Phase 1: matrix 78 rows 56 cols
[2021-05-19 10:59:25] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-19 10:59:25] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 56/106 places, 78/162 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 44 transition count 66
Applied a total of 24 rules in 3 ms. Remains 44 /56 variables (removed 12) and now considering 66/78 (removed 12) transitions.
// Phase 1: matrix 66 rows 44 cols
[2021-05-19 10:59:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-19 10:59:25] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 66 rows 44 cols
[2021-05-19 10:59:25] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-19 10:59:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 44/106 places, 66/162 transitions.
Discarding 12 transitions out of 66. Remains 54
[2021-05-19 10:59:25] [INFO ] Flatten gal took : 30 ms
[2021-05-19 10:59:25] [INFO ] Flatten gal took : 11 ms
[2021-05-19 10:59:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15435158017099563631.gal : 6 ms
[2021-05-19 10:59:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10241103650861794290.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/CTLFireability15435158017099563631.gal, -t, CGAL, -ctl, /tmp/CTLFireability10241103650861794290.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/CTLFireability15435158017099563631.gal -t CGAL -ctl /tmp/CTLFireability10241103650861794290.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 54 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,346875,0.016149,4800,2,182,5,1172,6,0,245,735,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.042058,5980,1,0,6,7553,14,0,1126,3402,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.051217,6244,1,0,7,9024,15,0,1127,4749,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.059308,6508,1,0,8,10652,16,0,1128,6268,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.065538,6772,1,0,9,11711,17,0,1129,7186,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.069362,7036,1,0,10,12410,18,0,1130,7820,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.072028,7036,1,0,11,12925,19,0,1131,8144,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.073642,7300,1,0,12,13056,20,0,1132,8255,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.076138,7300,1,0,13,13146,21,0,1133,8287,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.077066,7300,1,0,14,13251,22,0,1134,8350,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.077823,7300,1,0,15,13316,23,0,1135,8382,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.07857,7300,1,0,16,13372,24,0,1136,8418,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.079175,7300,1,0,17,13397,25,0,1137,8434,38
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 12,1,0.082597,7300,1,0,18,14142,26,0,1138,9128,41
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 13,1,0.088074,7564,1,0,19,15079,27,0,1139,10200,44
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 14,1,0.090447,7828,1,0,20,15340,28,0,1140,10493,47
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 15,1,0.095703,7828,1,0,21,16135,29,0,1141,11405,50
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 16,1,0.097376,8092,1,0,22,16285,30,0,1142,11508,53
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 17,1,0.104554,8092,1,0,23,16764,31,0,1143,11893,56
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 18,1,0.106157,8356,1,0,24,16826,32,0,1144,11917,59
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 19,1,0.106812,8356,1,0,25,16874,33,0,1145,11917,62
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 20,1,0.107423,8356,1,0,26,16899,34,0,1146,11917,65
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 21,1,0.107962,8356,1,0,27,16922,35,0,1147,11917,68
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 22,1,0.10847,8356,1,0,28,16928,36,0,1148,11917,71
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 23,1,0.108948,8356,1,0,29,16932,37,0,1149,11917,74
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 24,1,0.118823,8356,1,0,30,18349,38,0,1149,13467,77
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 25,1,0.125031,8620,1,0,31,19690,39,0,1149,14835,80
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 26,1,0.127982,8884,1,0,32,20286,40,0,1149,15262,83
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 27,1,0.12871,8884,1,0,33,20354,41,0,1149,15312,86
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 28,1,0.129123,8884,1,0,34,20364,42,0,1149,15320,89
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 29,1,0.129438,8884,1,0,35,20369,43,0,1149,15324,92
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 30,1,0.13429,8884,1,0,36,21589,44,0,1150,16248,95
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 31,1,0.136287,9148,1,0,37,21864,45,0,1151,16463,98
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 32,1,0.149911,9412,1,0,38,24841,46,0,1152,19065,101
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 33,1,0.155502,9676,1,0,39,25598,47,0,1153,19825,104
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 34,1,0.165072,9940,1,0,40,26671,48,0,1154,20641,107
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 35,1,0.167256,10204,1,0,41,26940,49,0,1155,20851,110
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 36,1,0.180197,10468,1,0,42,29619,50,0,1156,23131,113
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 37,1,0.185169,10732,1,0,43,30350,51,0,1157,23843,116
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 38,1,0.187367,10996,1,0,44,30708,52,0,1158,24015,119
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 39,1,0.18868,10996,1,0,45,30856,53,0,1159,24069,122
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 40,1,0.193703,11260,1,0,46,31789,54,0,1160,24652,125
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 41,1,0.195859,11260,1,0,47,32067,55,0,1161,24813,128
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 42,1,0.19684,11260,1,0,48,32160,56,0,1162,24846,131
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 43,1,0.19754,11260,1,0,49,32206,57,0,1163,24848,134
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 44,1,0.198685,11524,1,0,50,32300,58,0,1164,24883,137
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 45,1,0.199357,11524,1,0,51,32344,59,0,1165,24885,140
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 46,1,0.200249,11524,1,0,52,32412,60,0,1166,24918,143
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 47,1,0.200846,11524,1,0,53,32433,61,0,1167,24920,146
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 48,1,0.210168,11524,1,0,54,32502,62,0,1168,24955,149
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 49,1,0.210839,11524,1,0,55,32521,63,0,1169,24957,152
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 50,1,0.211497,11524,1,0,56,32551,64,0,1170,24974,155
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 51,1,0.212011,11524,1,0,57,32554,65,0,1171,24975,158
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 52,1,0.212654,11524,1,0,58,32584,66,0,1172,24993,161
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 53,1,0.21316,11524,1,0,59,32586,67,0,1173,24994,164
Formula is TRUE !

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

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

BK_STOP 1621421966942

--------------------
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-Z2T3N06"
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-Z2T3N06, 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-162132119800334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N06.tgz
mv UtilityControlRoom-PT-Z2T3N06 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 ;