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.r105-tall-167814481200425.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 ltsminxred
Input is DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 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.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 57K 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 DES-PT-20a-CTLCardinality-00
FORMULA_NAME DES-PT-20a-CTLCardinality-01
FORMULA_NAME DES-PT-20a-CTLCardinality-02
FORMULA_NAME DES-PT-20a-CTLCardinality-03
FORMULA_NAME DES-PT-20a-CTLCardinality-04
FORMULA_NAME DES-PT-20a-CTLCardinality-05
FORMULA_NAME DES-PT-20a-CTLCardinality-06
FORMULA_NAME DES-PT-20a-CTLCardinality-07
FORMULA_NAME DES-PT-20a-CTLCardinality-08
FORMULA_NAME DES-PT-20a-CTLCardinality-09
FORMULA_NAME DES-PT-20a-CTLCardinality-10
FORMULA_NAME DES-PT-20a-CTLCardinality-11
FORMULA_NAME DES-PT-20a-CTLCardinality-12
FORMULA_NAME DES-PT-20a-CTLCardinality-13
FORMULA_NAME DES-PT-20a-CTLCardinality-14
FORMULA_NAME DES-PT-20a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678295447902

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 17:10:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 17:10:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 17:10:49] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-08 17:10:49] [INFO ] Transformed 195 places.
[2023-03-08 17:10:49] [INFO ] Transformed 152 transitions.
[2023-03-08 17:10:49] [INFO ] Found NUPN structural information;
[2023-03-08 17:10:49] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 19 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2023-03-08 17:10:49] [INFO ] Computed 59 place invariants in 24 ms
[2023-03-08 17:10:50] [INFO ] Implicit Places using invariants in 536 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 566 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 138/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 593 ms. Remains : 194/195 places, 138/138 transitions.
Support contains 65 out of 194 places after structural reductions.
[2023-03-08 17:10:50] [INFO ] Flatten gal took : 43 ms
[2023-03-08 17:10:50] [INFO ] Flatten gal took : 19 ms
[2023-03-08 17:10:50] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 63 out of 194 places (down from 65) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 40) seen :25
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 138 rows 194 cols
[2023-03-08 17:10:51] [INFO ] Computed 58 place invariants in 13 ms
[2023-03-08 17:10:51] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 17:10:51] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:10:51] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 17:10:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 17:10:51] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 72 ms returned sat
[2023-03-08 17:10:52] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-03-08 17:10:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
[2023-03-08 17:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 17:10:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2023-03-08 17:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 17:10:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-08 17:10:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2023-03-08 17:10:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2023-03-08 17:10:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2023-03-08 17:10:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-08 17:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 17:10:53] [INFO ] After 1395ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 680 ms.
[2023-03-08 17:10:53] [INFO ] After 2420ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 5 properties in 780 ms.
Support contains 12 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 138/138 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 193 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 193 transition count 135
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 39 ms. Remains 193 /194 variables (removed 1) and now considering 135/138 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 193/194 places, 135/138 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:10:55] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 17:10:55] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 17:10:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 17:10:55] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 17:10:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 17:10:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 17:10:55] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 17:10:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:10:55] [INFO ] After 74ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 17:10:55] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2023-03-08 17:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 17:10:55] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-08 17:10:55] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 156 ms.
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 20 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 855733 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 855733 steps, saw 121922 distinct states, run finished after 3004 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:10:59] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 17:10:59] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 17:10:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:10:59] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 17:10:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:10:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2023-03-08 17:10:59] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 17:10:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:10:59] [INFO ] After 75ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 17:11:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-08 17:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 17:11:00] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-08 17:11:00] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 2 properties in 196 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 193/193 places, 135/135 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1076216 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1076216 steps, saw 151058 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:11:03] [INFO ] Computed 60 place invariants in 16 ms
[2023-03-08 17:11:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:11:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:11:03] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:11:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:11:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 17:11:04] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:11:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:11:04] [INFO ] After 43ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 17:11:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-08 17:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 17:11:04] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-08 17:11:04] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 52 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 23 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 17:11:04] [INFO ] Invariant cache hit.
[2023-03-08 17:11:04] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 17:11:04] [INFO ] Invariant cache hit.
[2023-03-08 17:11:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:11:04] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-08 17:11:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 17:11:04] [INFO ] Invariant cache hit.
[2023-03-08 17:11:04] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:11:04] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:11:04] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 17:11:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:11:04] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:11:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:11:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 17:11:05] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:11:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-08 17:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 17:11:05] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 17:11:05] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-20a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 13 ms
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 13 ms
[2023-03-08 17:11:05] [INFO ] Input system was already deterministic with 138 transitions.
FORMULA DES-PT-20a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 92 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 11 ms
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 11 ms
[2023-03-08 17:11:05] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 11 ms
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 11 ms
[2023-03-08 17:11:05] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 194/194 places, 138/138 transitions.
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:11:05] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 11 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:05] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 136
Applied a total of 2 rules in 10 ms. Remains 192 /194 variables (removed 2) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 192/194 places, 136/138 transitions.
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:05] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:05] [INFO ] Input system was already deterministic with 136 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1726656 steps, run timeout after 3001 ms. (steps per millisecond=575 ) properties seen :{}
Probabilistic random walk after 1726656 steps, saw 235276 distinct states, run finished after 3003 ms. (steps per millisecond=574 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 192 cols
[2023-03-08 17:11:08] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 17:11:08] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 17:11:08] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 17:11:08] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:11:08] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 17:11:08] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 79 ms returned sat
[2023-03-08 17:11:09] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:11:09] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 17:11:09] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 204 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 136/136 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 134
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 192 transition count 134
Applied a total of 4 rules in 19 ms. Remains 192 /192 variables (removed 0) and now considering 134/136 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 192/192 places, 134/136 transitions.
Incomplete random walk after 1000000 steps, including 16428 resets, run finished after 2055 ms. (steps per millisecond=486 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2937 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3468878 steps, run timeout after 6001 ms. (steps per millisecond=578 ) properties seen :{}
Probabilistic random walk after 3468878 steps, saw 464321 distinct states, run finished after 6002 ms. (steps per millisecond=577 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-08 17:11:18] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 17:11:18] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:11:18] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:11:18] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 17:11:18] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 17:11:18] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1122 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=280 )
FORMULA DES-PT-20a-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 3 ms.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:18] [INFO ] Flatten gal took : 10 ms
[2023-03-08 17:11:18] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:18] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 4 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:18] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:18] [INFO ] Flatten gal took : 8 ms
[2023-03-08 17:11:18] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 136
Applied a total of 2 rules in 10 ms. Remains 192 /194 variables (removed 2) and now considering 136/138 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 192/194 places, 136/138 transitions.
[2023-03-08 17:11:18] [INFO ] Flatten gal took : 8 ms
[2023-03-08 17:11:18] [INFO ] Flatten gal took : 7 ms
[2023-03-08 17:11:18] [INFO ] Input system was already deterministic with 136 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1823132 steps, run timeout after 3001 ms. (steps per millisecond=607 ) properties seen :{}
Probabilistic random walk after 1823132 steps, saw 247521 distinct states, run finished after 3001 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 136 rows 192 cols
[2023-03-08 17:11:21] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 17:11:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:11:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 17:11:21] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 42 ms returned sat
[2023-03-08 17:11:21] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:11:21] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 17:11:21] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 622 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=207 )
FORMULA DES-PT-20a-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:21] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:21] [INFO ] Flatten gal took : 7 ms
[2023-03-08 17:11:21] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 193/194 places, 137/138 transitions.
[2023-03-08 17:11:21] [INFO ] Flatten gal took : 9 ms
[2023-03-08 17:11:21] [INFO ] Flatten gal took : 7 ms
[2023-03-08 17:11:21] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 194/194 places, 138/138 transitions.
[2023-03-08 17:11:21] [INFO ] Flatten gal took : 7 ms
[2023-03-08 17:11:22] [INFO ] Flatten gal took : 8 ms
[2023-03-08 17:11:22] [INFO ] Input system was already deterministic with 138 transitions.
[2023-03-08 17:11:22] [INFO ] Flatten gal took : 8 ms
[2023-03-08 17:11:22] [INFO ] Flatten gal took : 7 ms
[2023-03-08 17:11:22] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-08 17:11:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 138 transitions and 675 arcs took 1 ms.
Total runtime 32653 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/554/ctl_0_ --ctl=/tmp/554/ctl_1_ --ctl=/tmp/554/ctl_2_ --ctl=/tmp/554/ctl_3_ --ctl=/tmp/554/ctl_4_ --ctl=/tmp/554/ctl_5_ --ctl=/tmp/554/ctl_6_ --ctl=/tmp/554/ctl_7_ --ctl=/tmp/554/ctl_8_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 16026264 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100712 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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="DES-PT-20a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-20a, 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 r105-tall-167814481200425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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