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.r074-smll-167814400000233.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 marciexred
Input is ClientsAndServers-PT-N0005P1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678338826443

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0005P1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 05:13:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 05:13:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:13:49] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-09 05:13:49] [INFO ] Transformed 25 places.
[2023-03-09 05:13:49] [INFO ] Transformed 18 transitions.
[2023-03-09 05:13:49] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 22 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 05:13:49] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 05:13:50] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-09 05:13:50] [INFO ] Invariant cache hit.
[2023-03-09 05:13:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-09 05:13:50] [INFO ] Invariant cache hit.
[2023-03-09 05:13:50] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-09 05:13:50] [INFO ] Flatten gal took : 23 ms
[2023-03-09 05:13:50] [INFO ] Flatten gal took : 7 ms
[2023-03-09 05:13:50] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10005 steps, including 9 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 76) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 35) seen :0
Running SMT prover for 35 properties.
[2023-03-09 05:13:51] [INFO ] Invariant cache hit.
[2023-03-09 05:13:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 05:13:51] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 05:13:51] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :6 sat :2 real:27
[2023-03-09 05:13:51] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :6 sat :0 real:29
[2023-03-09 05:13:51] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:29
[2023-03-09 05:13:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 05:13:51] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 05:13:51] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :31 sat :4
[2023-03-09 05:13:51] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :31 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 05:13:51] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :31 sat :4
Fused 35 Parikh solutions to 4 different solutions.
Finished Parikh walk after 237 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=79 )
Parikh walk visited 4 properties in 22 ms.
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 05:13:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 6 ms
[2023-03-09 05:13:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 5 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 21 out of 25 places (down from 23) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:51] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 20 transition count 13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 17 transition count 12
Applied a total of 14 rules in 13 ms. Remains 17 /25 variables (removed 8) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 17/25 places, 12/18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:52] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 17 transition count 12
Applied a total of 14 rules in 5 ms. Remains 17 /25 variables (removed 8) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 17/25 places, 12/18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 5 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 12/25 places, 8/18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:52] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 20 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 17 transition count 13
Applied a total of 13 rules in 5 ms. Remains 17 /25 variables (removed 8) and now considering 13/18 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 17/25 places, 13/18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 1 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:13:52] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-09 05:13:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 0 ms.
Total runtime 2698 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 25 NrTr: 18 NrArc: 54)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.870sec


RS generation: 1m31.253sec


-> reachability set: #nodes 545079 (5.5e+05) #states 211,714,654,767 (11)



starting MCC model checker
--------------------------

checking: EF [EX [0<=0]]
normalized: E [true U EX [0<=0]]

abstracting: (0<=0)
states: 211,714,654,767 (11)
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.150sec

checking: E [p22<=5 U EX [AX [37<=p23]]]
normalized: E [p22<=5 U EX [~ [EX [~ [37<=p23]]]]]

abstracting: (37<=p23)
states: 27,306,301 (7)
..abstracting: (p22<=5)
states: 137,850,161,922 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.851sec

checking: EF [AG [p16<=p19]]
normalized: E [true U ~ [E [true U ~ [p16<=p19]]]]

abstracting: (p16<=p19)
states: 189,151,192,331 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.085sec

checking: EX [EG [EX [p15<=p10]]]
normalized: EX [EG [EX [p15<=p10]]]

abstracting: (p15<=p10)
states: 132,542,877,498 (11)
..................................................................................
EG iterations: 81
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.117sec

checking: AG [~ [A [EX [0<=0] U [EF [p5<=p18] & ~ [p5<=12]]]]]
normalized: ~ [E [true U [~ [EG [~ [[~ [p5<=12] & E [true U p5<=p18]]]]] & ~ [E [~ [[~ [p5<=12] & E [true U p5<=p18]]] U [~ [EX [0<=0]] & ~ [[~ [p5<=12] & E [true U p5<=p18]]]]]]]]]

abstracting: (p5<=p18)
states: 50,142,617,899 (10)
abstracting: (p5<=12)
states: 197,633,698,119 (11)
abstracting: (0<=0)
states: 211,714,654,767 (11)
.abstracting: (p5<=p18)
states: 50,142,617,899 (10)
abstracting: (p5<=12)
states: 197,633,698,119 (11)
abstracting: (p5<=p18)
states: 50,142,617,899 (10)
abstracting: (p5<=12)
states: 197,633,698,119 (11)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m58.596sec

checking: AX [AF [[~ [p16<=8] | ~ [p19<=p11]]]]
normalized: ~ [EX [EG [~ [[~ [p19<=p11] | ~ [p16<=8]]]]]]

abstracting: (p16<=8)
states: 211,710,425,349 (11)
abstracting: (p19<=p11)
states: 44,679,750,629 (10)
....................................................................................................................
EG iterations: 116
.-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.548sec

checking: [AF [~ [p10<=p5]] | [AX [1<=0] & ~ [E [EG [p13<=p14] U p14<=11]]]]
normalized: [[~ [E [EG [p13<=p14] U p14<=11]] & ~ [EX [~ [1<=0]]]] | ~ [EG [p10<=p5]]]

abstracting: (p10<=p5)
states: 190,134,730,951 (11)
........................................................................
EG iterations: 72
abstracting: (1<=0)
states: 0
.abstracting: (p14<=11)
states: 196,622,041,997 (11)
abstracting: (p13<=p14)
states: 211,010,399,625 (11)
......................................................................................
EG iterations: 86
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m53.321sec

checking: [AX [5<=p10] | [EF [EX [~ [p22<=24]]] | AG [[EF [~ [p9<=5]] & [p23<=23 & p0<=4]]]]]
normalized: [[~ [E [true U ~ [[[p23<=23 & p0<=4] & E [true U ~ [p9<=5]]]]]] | E [true U EX [~ [p22<=24]]]] | ~ [EX [~ [5<=p10]]]]

abstracting: (5<=p10)
states: 1,724,167,464 (9)
.abstracting: (p22<=24)
states: 211,696,552,639 (11)
.abstracting: (p9<=5)
states: 211,113,023,442 (11)
abstracting: (p0<=4)
states: 48,850,653,621 (10)
abstracting: (p23<=23)
states: 190,640,654,431 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 8.002sec

checking: EF [AG [[~ [p21<=p20] & [~ [p2<=p17] | ~ [p5<=6]]]]]
normalized: E [true U ~ [E [true U ~ [[[~ [p5<=6] | ~ [p2<=p17]] & ~ [p21<=p20]]]]]]

abstracting: (p21<=p20)
states: 103,312,551 (8)
abstracting: (p2<=p17)
states: 190,593,651,587 (11)
abstracting: (p5<=6)
states: 151,358,641,049 (11)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.831sec

checking: AG [E [[21<=p23 | ~ [EG [~ [p7<=p19]]]] U [AG [p18<=1] | p24<=p2]]]
normalized: ~ [E [true U ~ [E [[21<=p23 | ~ [EG [~ [p7<=p19]]]] U [p24<=p2 | ~ [E [true U ~ [p18<=1]]]]]]]]

abstracting: (p18<=1)
states: 172,839,260,832 (11)
abstracting: (p24<=p2)
states: 41,019,602,338 (10)
abstracting: (p7<=p19)
states: 99,600,781,885 (10)
............................................................................................
EG iterations: 92
abstracting: (21<=p23)
states: 40,613,275,450 (10)

before gc: list nodes free: 1462051

after gc: idd nodes used:9457640, unused:54542360; list nodes free:464291548
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m45.582sec

checking: AX [[[AX [1<=0] | [EG [AG [EF [p6<=p10]]] | 28<=p15]] | [27<=p13 | [p15<=p9 | ~ [p15<=18]]]]]
normalized: ~ [EX [~ [[[27<=p13 | [p15<=p9 | ~ [p15<=18]]] | [[28<=p15 | EG [~ [E [true U ~ [E [true U p6<=p10]]]]]] | ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p6<=p10)
states: 146,051,819,637 (11)

EG iterations: 0
abstracting: (28<=p15)
states: 0
abstracting: (p15<=18)
states: 211,714,654,767 (11)
abstracting: (p15<=p9)
states: 133,824,368,088 (11)
abstracting: (27<=p13)
states: 0
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.180sec

checking: A [EF [p7<=p14] U [p21<=1 & ~ [EF [[AG [p10<=p15] & AF [p15<=p18]]]]]]
normalized: [~ [EG [~ [[p21<=1 & ~ [E [true U [~ [EG [~ [p15<=p18]]] & ~ [E [true U ~ [p10<=p15]]]]]]]]]] & ~ [E [~ [[p21<=1 & ~ [E [true U [~ [EG [~ [p15<=p18]]] & ~ [E [true U ~ [p10<=p15]]]]]]]] U [~ [E [true U p7<=p14]] & ~ [[p21<=1 & ~ [E [true U [~ [EG [~ [p15<=p18]]] & ~ [E [true U ~ [p10<=p15]]]]]]]]]]]]

abstracting: (p10<=p15)
states: 151,678,289,727 (11)
abstracting: (p15<=p18)
states: 132,542,877,498 (11)
....................................................................................................
EG iterations: 100
abstracting: (p21<=1)
states: 276,410,706 (8)
abstracting: (p7<=p14)
states: 178,204,222,449 (11)
abstracting: (p10<=p15)
states: 151,678,289,727 (11)
abstracting: (p15<=p18)
states: 132,542,877,498 (11)
....................................................................................................
EG iterations: 100
abstracting: (p21<=1)
states: 276,410,706 (8)
abstracting: (p10<=p15)
states: 151,678,289,727 (11)
abstracting: (p15<=p18)
states: 132,542,877,498 (11)
....................................................................................................
EG iterations: 100
abstracting: (p21<=1)
states: 276,410,706 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m26.187sec

checking: AG [[EF [p21<=p14] & [EF [8<=p5] & [[AX [~ [p21<=p6]] | ~ [p14<=27]] | [p23<=p1 | [EF [32<=p21] & AF [1<=p2]]]]]]]
normalized: ~ [E [true U ~ [[[[[p23<=p1 | [~ [EG [~ [1<=p2]]] & E [true U 32<=p21]]] | [~ [p14<=27] | ~ [EX [p21<=p6]]]] & E [true U 8<=p5]] & E [true U p21<=p14]]]]]

abstracting: (p21<=p14)
states: 47,338,648,413 (10)

before gc: list nodes free: 40003

after gc: idd nodes used:11760201, unused:52239799; list nodes free:496141284
abstracting: (8<=p5)
states: 48,848,754,339 (10)
abstracting: (p21<=p6)
states: 98,528,430 (7)
.abstracting: (p14<=27)
states: 211,714,654,767 (11)
abstracting: (32<=p21)
states: 1,189,814,568 (9)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
.......................................................................................................................................................................
before gc: list nodes free: 56117024

after gc: idd nodes used:13436112, unused:50563888; list nodes free:482097236
...........................................................................................................................................................................................................................
EG iterations: 386
abstracting: (p23<=p1)
states: 1,005,539,828 (9)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0005P1-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 18m12.822sec

totally nodes used: 209633222 (2.1e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 2451652530 858298974 3309951504
used/not used/entry size/cache size: 56513154 10595710 16 1024MB
basic ops cache: hits/miss/sum: 618444221 251067397 869511618
used/not used/entry size/cache size: 12637507 4139709 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 47095770 14020808 61116578
used/not used/entry size/cache size: 430124 7958484 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 32945411
1 22285669
2 8197595
3 2364424
4 793467
5 297490
6 115749
7 51469
8 27157
9 14010
>= 10 16423

Total processing time: 39m21.383sec


BK_STOP 1678341194640

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec


iterations count:4822 (267), effective:1040 (57)

initing FirstDep: 0m 0.000sec


iterations count:18 (1), effective:0 (0)

iterations count:2306 (128), effective:529 (29)

iterations count:405 (22), effective:78 (4)

iterations count:1967 (109), effective:417 (23)

iterations count:1490 (82), effective:318 (17)

iterations count:1490 (82), effective:318 (17)

iterations count:2101 (116), effective:487 (27)

iterations count:1490 (82), effective:318 (17)

iterations count:845 (46), effective:200 (11)

iterations count:74 (4), effective:11 (0)

iterations count:2913 (161), effective:646 (35)

iterations count:542 (30), effective:119 (6)

iterations count:985 (54), effective:195 (10)

iterations count:1418 (78), effective:295 (16)

iterations count:1958 (108), effective:421 (23)

iterations count:230 (12), effective:46 (2)

iterations count:338 (18), effective:40 (2)

iterations count:1421 (78), effective:321 (17)

iterations count:78 (4), effective:10 (0)

iterations count:319 (17), effective:73 (4)

iterations count:1937 (107), effective:407 (22)

iterations count:44 (2), effective:26 (1)

iterations count:319 (17), effective:73 (4)

iterations count:1937 (107), effective:407 (22)

iterations count:319 (17), effective:73 (4)

iterations count:1937 (107), effective:407 (22)

iterations count:1284 (71), effective:286 (15)

iterations count:560 (31), effective:129 (7)

iterations count:1732 (96), effective:402 (22)

iterations count:2037 (113), effective:473 (26)

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="ClientsAndServers-PT-N0005P1"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 marciexred"
echo " Input is ClientsAndServers-PT-N0005P1, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r074-smll-167814400000233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0005P1.tgz
mv ClientsAndServers-PT-N0005P1 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;