fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r524-tall-171679080700593
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SemanticWebServices-PT-S256P15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 197991.00 0.00 0.00 [undef] Cannot compute

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080700593.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SemanticWebServices-PT-S256P15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080700593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M May 18 16:43 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 SemanticWebServices-PT-S256P15-CTLCardinality-2024-00
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-01
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-02
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-03
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-04
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-05
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-06
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-07
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-08
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-09
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-10
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2024-11
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-12
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-13
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-14
FORMULA_NAME SemanticWebServices-PT-S256P15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717229224184

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:07:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:07:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:07:06] [INFO ] Load time of PNML (sax parser for PT used): 1132 ms
[2024-06-01 08:07:06] [INFO ] Transformed 329 places.
[2024-06-01 08:07:06] [INFO ] Transformed 29492 transitions.
[2024-06-01 08:07:06] [INFO ] Parsed PT model containing 329 places and 29492 transitions and 267319 arcs in 1361 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 5 places in 56 ms
Reduce places removed 5 places and 2050 transitions.
Ensure Unique test removed 6828 transitions
Reduce redundant transitions removed 6828 transitions.
Support contains 89 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 20614/20614 transitions.
Ensure Unique test removed 32 places
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 320 transitions.
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 282 transition count 20294
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 378 place count 266 transition count 15653
Iterating global reduction 1 with 16 rules applied. Total rules applied 394 place count 266 transition count 15653
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 861 transitions.
Iterating post reduction 1 with 861 rules applied. Total rules applied 1255 place count 266 transition count 14792
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1256 place count 265 transition count 14791
Iterating global reduction 2 with 1 rules applied. Total rules applied 1257 place count 265 transition count 14791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1258 place count 264 transition count 14790
Iterating global reduction 2 with 1 rules applied. Total rules applied 1259 place count 264 transition count 14790
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1260 place count 263 transition count 14789
Iterating global reduction 2 with 1 rules applied. Total rules applied 1261 place count 263 transition count 14789
Drop transitions (Redundant composition of simpler transitions.) removed 2861 transitions
Redundant transition composition rules discarded 2861 transitions
Iterating global reduction 2 with 2861 rules applied. Total rules applied 4122 place count 263 transition count 11928
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 2 with 350 rules applied. Total rules applied 4472 place count 257 transition count 11584
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 4481 place count 248 transition count 9928
Iterating global reduction 3 with 9 rules applied. Total rules applied 4490 place count 248 transition count 9928
Ensure Unique test removed 931 transitions
Reduce isomorphic transitions removed 931 transitions.
Iterating post reduction 3 with 931 rules applied. Total rules applied 5421 place count 248 transition count 8997
Drop transitions (Redundant composition of simpler transitions.) removed 399 transitions
Redundant transition composition rules discarded 399 transitions
Iterating global reduction 4 with 399 rules applied. Total rules applied 5820 place count 248 transition count 8598
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Iterating post reduction 4 with 141 rules applied. Total rules applied 5961 place count 246 transition count 8459
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 5 with 52 rules applied. Total rules applied 6013 place count 246 transition count 8407
Applied a total of 6013 rules in 601 ms. Remains 246 /324 variables (removed 78) and now considering 8407/20614 (removed 12207) transitions.
Running 7770 sub problems to find dead transitions.
[2024-06-01 08:07:07] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
Normalized transition count is 1380 out of 1382 initially.
// Phase 1: matrix 1380 rows 246 cols
[2024-06-01 08:07:07] [INFO ] Computed 3 invariants in 27 ms
[2024-06-01 08:07:08] [INFO ] State equation strengthened by 740 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 20255 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 7770/7770 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 20097 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 0/7770 constraints, Known Traps: 0/0 constraints]
After SMT, in 73035ms problems are : Problem set: 0 solved, 7770 unsolved
Search for dead transitions found 0 dead transitions in 73185ms
[2024-06-01 08:08:20] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-06-01 08:08:20] [INFO ] Invariant cache hit.
[2024-06-01 08:08:21] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-06-01 08:08:21] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-06-01 08:08:21] [INFO ] Invariant cache hit.
[2024-06-01 08:08:21] [INFO ] State equation strengthened by 740 read => feed constraints.
[2024-06-01 08:08:22] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
Running 7770 sub problems to find dead transitions.
[2024-06-01 08:08:23] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-06-01 08:08:23] [INFO ] Invariant cache hit.
[2024-06-01 08:08:23] [INFO ] State equation strengthened by 740 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 2.0)
(s52 2.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 timeout
1.0)
(s71 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 30106 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 7770/7770 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7770 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/1628 variables, and 2 constraints, problems are : Problem set: 0 solved, 7770 unsolved in 30103 ms.
Refiners :[Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/246 constraints, ReadFeed: 0/740 constraints, PredecessorRefiner: 0/7770 constraints, Known Traps: 0/0 constraints]
After SMT, in 95409ms problems are : Problem set: 0 solved, 7770 unsolved
Search for dead transitions found 0 dead transitions in 95481ms
Starting structural reductions in LTL mode, iteration 1 : 246/324 places, 8407/20614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171506 ms. Remains : 246/324 places, 8407/20614 transitions.
Support contains 89 out of 246 places after structural reductions.
[2024-06-01 08:09:59] [INFO ] Flatten gal took : 394 ms
[2024-06-01 08:09:59] [INFO ] Flatten gal took : 254 ms
[2024-06-01 08:09:59] [INFO ] Input system was already deterministic with 8407 transitions.
Support contains 87 out of 246 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4058 ms. (9 steps per ms) remains 7/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
[2024-06-01 08:10:01] [INFO ] Flow matrix only has 1382 transitions (discarded 7025 similar events)
[2024-06-01 08:10:01] [INFO ] Invariant cache hit.
[2024-06-01 08:10:01] [INFO ] State equation strengthened by 740 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 89/101 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 708/809 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/814 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 654/1468 variables, 96/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 456/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 33/1501 variables, 16/658 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 130/788 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1501 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 2/1503 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1503 variables, 44/833 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1503 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 28/1531 variables, 51/884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1531 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1531 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 30/1561 variables, 28/913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1561 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1561 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 20/1581 variables, 20/934 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1581 variables, 1/935 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1581 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 20/1601 variables, 20/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1601 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 13/1614 variables, 16/971 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1614 variables, 5/976 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1614 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 13/1627 variables, 13/989 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1627 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 0/1627 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 989 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2817 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 246/246 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 89/101 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 708/809 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 16/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/814 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 654/1468 variables, 96/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 456/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 33/1501 variables, 16/658 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 130/788 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1501 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1501 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1503 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1503 variables, 44/834 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1503 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 28/1531 variables, 51/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1531 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1531 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 30/1561 variables, 28/914 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1561 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1561 variables, 6/921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1561 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 20/1581 variables, 20/941 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1581 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1581 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 20/1601 variables, 20/962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1601 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (OVERLAPS) 13/1614 variables, 16/978 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1614 variables, 5/983 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1614 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 13/1627 variables, 13/996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1627 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 0/1627 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 996 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4714 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 246/246 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 7859ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 208 steps, including 1 resets, run visited all 7 properties in 17 ms. (steps per millisecond=12 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 37 ms.
[2024-06-01 08:10:09] [INFO ] Flatten gal took : 190 ms
[2024-06-01 08:10:09] [INFO ] Flatten gal took : 230 ms
[2024-06-01 08:10:10] [INFO ] Input system was already deterministic with 8407 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 246/246 places, 8407/8407 transitions.
Graph (complete) has 3858 edges and 246 vertex of which 234 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.30 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 231 transition count 8056
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 368 place count 211 transition count 6606
Iterating global reduction 1 with 20 rules applied. Total rules applied 388 place count 211 transition count 6606
Ensure Unique test removed 701 transitions
Reduce isomorphic transitions removed 701 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1089 place count 211 transition count 5905
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1097 place count 203 transition count 5897
Iterating global reduction 2 with 8 rules applied. Total rules applied 1105 place count 203 transition count 5897
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1112 place count 196 transition count 5890
Iterating global reduction 2 with 7 rules applied. Total rules applied 1119 place count 196 transition count 5890
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1124 place count 191 transition count 5885
Iterating global reduction 2 with 5 rules applied. Total rules applied 1129 place count 191 transition count 5885
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1134 place count 186 transition count 5880
Iterating global reduction 2 with 5 rules applied. Total rules applied 1139 place count 186 transition count 5880
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1143 place count 182 transition count 5876
Iterating global reduction 2 with 4 rules applied. Total rules applied 1147 place count 182 transition count 5876
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1151 place count 182 transition count 5872
Drop transitions (Redundant composition of simpler transitions.) removed 481 transitions
Redundant transition composition rules discarded 481 transitions
Iterating global reduction 3 with 481 rules applied. Total rules applied 1632 place count 182 transition count 5391
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 3175 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 1634 place count 180 transition count 5390
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1635 place count 180 transition count 5389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1636 place count 179 transition count 5389
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1637 place count 178 transition count 5388
Iterating global reduction 5 with 1 rules applied. Total rules applied 1638 place count 178 transition count 5388
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1639 place count 177 transition count 5387
Iterating global reduction 5 with 1 rules applied. Total rules applied 1640 place count 177 transition count 5387
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1641 place count 176 transition count 5386
Iterating global reduction 5 with 1 rules applied. Total rules applied 1642 place count 176 transition count 5386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1643 place count 175 transition count 5385
Iterating global reduction 5 with 1 rules applied. Total rules applied 1644 place count 175 transition count 5385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1645 place count 175 transition count 5384
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1646 place count 175 transition count 5383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1647 place count 174 transition count 5383
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1648 place count 173 transition count 5382
Iterating global reduction 7 with 1 rules applied. Total rules applied 1649 place count 173 transition count 5382
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1651 place count 171 transition count 5380
Iterating global reduction 7 with 2 rules applied. Total rules applied 1653 place count 171 transition count 5380
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1655 place count 169 transition count 5378
Iterating global reduction 7 with 2 rules applied. Total rules applied 1657 place count 169 transition count 5378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1659 place count 169 transition count 5376
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1660 place count 169 transition count 5375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1661 place count 168 transition count 5375
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1662 place count 167 transition count 5374
Iterating global reduction 9 with 1 rules applied. Total rules applied 1663 place count 167 transition count 5374
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1665 place count 165 transition count 5372
Iterating global reduction 9 with 2 rules applied. Total rules applied 1667 place count 165 transition count 5372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1669 place count 165 transition count 5370
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1670 place count 165 transition count 5369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1671 place count 164 transition count 5369
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1672 place count 164 transition count 5368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1673 place count 163 transition count 5368
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1674 place count 163 transition count 5367
Applied a total of 1674 rules in 4469 ms. Remains 163 /246 variables (removed 83) and now considering 5367/8407 (removed 3040) transitions.
Running 4815 sub problems to find dead transitions.
[2024-06-01 08:10:14] [INFO ] Flow matrix only has 1098 transitions (discarded 4269 similar events)
Normalized transition count is 1097 out of 1098 initially.
// Phase 1: matrix 1097 rows 163 cols
[2024-06-01 08:10:14] [INFO ] Computed 0 invariants in 7 ms
[2024-06-01 08:10:14] [INFO ] State equation strengthened by 546 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-00
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-01
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-02
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-03
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-04
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-05
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-06
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-07
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-08
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-09
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-10
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2024-11
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2023-12
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2023-13
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2023-14
Could not compute solution for formula : SemanticWebServices-PT-S256P15-CTLCardinality-2023-15

BK_STOP 1717229422175

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/539/ctl_0_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/539/ctl_1_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/539/ctl_2_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/539/ctl_3_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/539/ctl_4_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/539/ctl_5_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/539/ctl_6_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/539/ctl_7_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/539/ctl_8_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/539/ctl_9_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/539/ctl_10_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/539/ctl_11_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/539/ctl_12_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/539/ctl_13_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/539/ctl_14_
ctl formula name SemanticWebServices-PT-S256P15-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/539/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SemanticWebServices-PT-S256P15"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S256P15, 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 r524-tall-171679080700593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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