Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r512-tall-167912736700709.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is UtilityControlRoom-PT-Z2T4N04, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-tall-167912736700709
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 19K Feb 26 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 26 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 64K Feb 26 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Feb 26 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 47K Mar 5 18:23 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 1679346218495

Running Version 202205111006
[2023-03-20 21:03:39] [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]
[2023-03-20 21:03:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:03:39] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-20 21:03:39] [INFO ] Transformed 72 places.
[2023-03-20 21:03:39] [INFO ] Transformed 108 transitions.
[2023-03-20 21:03:39] [INFO ] Parsed PT model containing 72 places and 108 transitions in 227 ms.
Discarding 32 transitions out of 108. Remains 76
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.7906KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 72/72 places, 92/92 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 72 transition count 84
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 8 rules in 18 ms. Remains 72 /72 variables (removed 0) and now considering 84/92 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/72 places, 84/92 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1124 ms (no deadlock found). (steps per millisecond=1112 )
Random directed walk for 1250002 steps, including 0 resets, run took 981 ms (no deadlock found). (steps per millisecond=1274 )
// Phase 1: matrix 84 rows 72 cols
[2023-03-20 21:03:42] [INFO ] Computed 11 place invariants in 16 ms
[2023-03-20 21:03:42] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 72/72 places, 108/108 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 72 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 56 place count 56 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 56 place count 56 transition count 60
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 72 place count 48 transition count 60
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 88 place count 40 transition count 52
Applied a total of 88 rules in 10 ms. Remains 40 /72 variables (removed 32) and now considering 52/108 (removed 56) transitions.
// Phase 1: matrix 52 rows 40 cols
[2023-03-20 21:03:42] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-20 21:03:42] [INFO ] Implicit Places using invariants in 56 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 38/72 places, 52/108 transitions.
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 0 with 16 rules applied. Total rules applied 16 place count 30 transition count 44
Applied a total of 16 rules in 2 ms. Remains 30 /38 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 30 cols
[2023-03-20 21:03:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 21:03:42] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 44 rows 30 cols
[2023-03-20 21:03:42] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 21:03:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 30/72 places, 44/108 transitions.
Finished structural reductions, in 2 iterations. Remains : 30/72 places, 44/108 transitions.
Discarding 8 transitions out of 44. Remains 36
Initial state reduction rules removed 4 formulas.
Finished random walk after 93 steps, including 0 resets, run visited all 32 properties in 29 ms. (steps per millisecond=3 )
Able to resolve query QuasiLiveness after proving 36 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 72/72 places, 108/108 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 72 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 56 place count 56 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 56 place count 56 transition count 60
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 72 place count 48 transition count 60
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 88 place count 40 transition count 52
Applied a total of 88 rules in 5 ms. Remains 40 /72 variables (removed 32) and now considering 52/108 (removed 56) transitions.
// Phase 1: matrix 52 rows 40 cols
[2023-03-20 21:03:42] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-20 21:03:42] [INFO ] Implicit Places using invariants in 49 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 38/72 places, 52/108 transitions.
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 0 with 16 rules applied. Total rules applied 16 place count 30 transition count 44
Applied a total of 16 rules in 2 ms. Remains 30 /38 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 30 cols
[2023-03-20 21:03:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 21:03:42] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 44 rows 30 cols
[2023-03-20 21:03:42] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-20 21:03:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 30/72 places, 44/108 transitions.
Finished structural reductions, in 2 iterations. Remains : 30/72 places, 44/108 transitions.
Discarding 8 transitions out of 44. Remains 36
[2023-03-20 21:03:42] [INFO ] Flatten gal took : 24 ms
[2023-03-20 21:03:42] [INFO ] Flatten gal took : 8 ms
[2023-03-20 21:03:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10457384824606118430.gal : 5 ms
[2023-03-20 21:03:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6217134618893877974.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10457384824606118430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6217134618893877974.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 36 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,8275,0.018097,4580,2,111,5,629,6,0,167,430,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.027439,5148,1,0,6,3070,14,0,768,1447,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.029838,5412,1,0,7,3417,15,0,769,1774,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.031538,5676,1,0,8,3639,16,0,770,1976,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.033026,5940,1,0,9,3814,17,0,771,2093,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.034272,5700,1,0,10,3918,18,0,772,2185,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.035286,5700,1,0,11,3963,19,0,773,2203,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.037187,5960,1,0,12,4020,20,0,774,2240,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.037886,5960,1,0,13,4045,21,0,775,2256,26
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 8,1,0.039452,5960,1,0,14,4297,22,0,776,2509,29
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 9,1,0.040833,5960,1,0,15,4468,23,0,777,2692,32
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 10,1,0.041665,5960,1,0,16,4531,24,0,778,2718,35
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 11,1,0.042898,5960,1,0,17,4677,25,0,779,2829,38
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 12,1,0.043691,5960,1,0,18,4708,26,0,780,2843,41
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 13,1,0.044267,5960,1,0,19,4725,27,0,781,2843,44
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 14,1,0.044843,5960,1,0,20,4731,28,0,782,2843,47
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 15,1,0.045344,5960,1,0,21,4735,29,0,783,2843,50
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 16,1,0.047041,5960,1,0,22,5013,30,0,783,3179,53
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 17,1,0.048553,5960,1,0,23,5154,31,0,783,3324,56
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 18,1,0.048951,5960,1,0,24,5158,32,0,783,3326,59
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 19,1,0.049284,5960,1,0,25,5163,33,0,783,3330,62
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 20,1,0.050211,5960,1,0,26,5244,34,0,784,3368,65
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 21,1,0.052095,5960,1,0,27,5642,35,0,785,3665,68
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 22,1,0.053453,6224,1,0,28,5756,36,0,786,3765,71
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 23,1,0.057974,6224,1,0,29,6601,37,0,787,4540,74
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 24,1,0.059101,6488,1,0,30,6663,38,0,788,4560,77
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 25,1,0.060407,6488,1,0,31,6845,39,0,789,4669,80
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 26,1,0.061531,6488,1,0,32,6939,40,0,790,4724,83
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 27,1,0.065938,6596,1,0,33,7292,41,0,791,5022,86
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 28,1,0.066816,6596,1,0,34,7371,42,0,792,5058,89
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 29,1,0.0674,6596,1,0,35,7392,43,0,793,5060,92
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 30,1,0.068179,6596,1,0,36,7447,44,0,794,5080,95
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 31,1,0.068874,6596,1,0,37,7490,45,0,795,5102,98
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 32,1,0.069447,6596,1,0,38,7515,46,0,796,5111,101
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 33,1,0.070009,6596,1,0,39,7523,47,0,797,5120,104
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 34,1,0.070623,6596,1,0,40,7553,48,0,798,5138,107
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 35,1,0.071117,6596,1,0,41,7555,49,0,799,5139,110
Formula is TRUE !

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

Able to resolve query Liveness after proving 36 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 3378 ms.

BK_STOP 1679346223080

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-Z2T4N04"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is UtilityControlRoom-PT-Z2T4N04, 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 r512-tall-167912736700709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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