About the Execution of LTSMin+red for QuasiCertifProtocol-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 899.296 | 172690.00 | 216572.00 | 386.20 | TT??FFTF???FF?T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337800081.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 QuasiCertifProtocol-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800081
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K 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 QuasiCertifProtocol-PT-18-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-18-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717220054127
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:34:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:34:15] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 05:34:15] [INFO ] Transformed 1398 places.
[2024-06-01 05:34:15] [INFO ] Transformed 296 transitions.
[2024-06-01 05:34:15] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Support contains 1359 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1397 transition count 296
Applied a total of 1 rules in 32 ms. Remains 1397 /1398 variables (removed 1) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1397 cols
[2024-06-01 05:34:15] [INFO ] Computed 1102 invariants in 50 ms
[2024-06-01 05:34:16] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-06-01 05:34:16] [INFO ] Invariant cache hit.
[2024-06-01 05:34:16] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-01 05:34:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 42/1397 variables, 21/759 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1397 variables, 343/1102 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 296/1693 variables, 1397/2499 constraints. Problems are: Problem set: 0 solved, 276 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 Real declared 1693/1693 variables, and 2499 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1081/1081 constraints, State Equation: 1397/1397 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 738/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 42/1397 variables, 21/759 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1397 variables, 343/1102 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1397 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 296/1693 variables, 1397/2499 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1693 variables, 276/2775 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1693/1693 variables, and 2775 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1081/1081 constraints, State Equation: 1397/1397 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Starting structural reductions in LTL mode, iteration 1 : 1397/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61988 ms. Remains : 1397/1398 places, 296/296 transitions.
Support contains 1359 out of 1397 places after structural reductions.
[2024-06-01 05:35:17] [INFO ] Flatten gal took : 112 ms
[2024-06-01 05:35:17] [INFO ] Flatten gal took : 65 ms
[2024-06-01 05:35:18] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (1768 resets) in 3971 ms. (10 steps per ms) remains 81/90 properties
BEST_FIRST walk for 4004 steps (13 resets) in 52 ms. (75 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (13 resets) in 83 ms. (47 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (13 resets) in 44 ms. (88 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (13 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (16 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (13 resets) in 47 ms. (83 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 58 ms. (67 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 71 ms. (55 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (11 resets) in 42 ms. (93 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (13 resets) in 40 ms. (97 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 59 ms. (66 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (13 resets) in 54 ms. (72 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (12 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (13 resets) in 50 ms. (78 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (14 resets) in 55 ms. (71 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (12 resets) in 51 ms. (76 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (13 resets) in 27 ms. (143 steps per ms) remains 81/81 properties
[2024-06-01 05:35:19] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 20/20 constraints. Problems are: Problem set: 11 solved, 70 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1342 variables, 1045/1065 constraints. Problems are: Problem set: 12 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1342 variables, 0/1065 constraints. Problems are: Problem set: 12 solved, 69 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/1343 variables, 1/1066 constraints. Problems are: Problem set: 20 solved, 61 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1343/1693 variables, and 1066 constraints, problems are : Problem set: 20 solved, 61 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1045/1081 constraints, State Equation: 0/1397 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1322 variables, 740/740 constraints. Problems are: Problem set: 20 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1322 variables, 0/740 constraints. Problems are: Problem set: 20 solved, 61 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 2 (OVERLAPS) 21/1343 variables, 21/761 constraints. Problems are: Problem set: 21 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1343 variables, 305/1066 constraints. Problems are: Problem set: 21 solved, 60 unsolved
[2024-06-01 05:35:27] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 31 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 3 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 4 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:35:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:35:29] [INFO ] Deduced a trap composed of 6 places in 742 ms of which 9 ms to minimize.
[2024-06-01 05:35:30] [INFO ] Deduced a trap composed of 9 places in 713 ms of which 9 ms to minimize.
SMT process timed out in 10596ms, After SMT, problems are : Problem set: 21 solved, 60 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1282 out of 1397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9588 edges and 1397 vertex of which 1378 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.6 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 1378 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1377 transition count 292
Applied a total of 5 rules in 67 ms. Remains 1377 /1397 variables (removed 20) and now considering 292/296 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1377/1397 places, 292/296 transitions.
RANDOM walk for 40000 steps (1763 resets) in 2051 ms. (19 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
Interrupted probabilistic random walk after 339618 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 60
Probabilistic random walk after 339618 steps, saw 54712 distinct states, run finished after 3009 ms. (steps per millisecond=112 ) properties seen :0
// Phase 1: matrix 292 rows 1377 cols
[2024-06-01 05:35:34] [INFO ] Computed 1086 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1282 variables, 1047/1047 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1282 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 55/1337 variables, 20/1067 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1337 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 4 (OVERLAPS) 292/1629 variables, 1337/2404 constraints. Problems are: Problem set: 25 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1629 variables, 0/2404 constraints. Problems are: Problem set: 25 solved, 35 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 6 (OVERLAPS) 40/1669 variables, 40/2444 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1669 variables, 19/2463 constraints. Problems are: Problem set: 26 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1669/1669 variables, and 2463 constraints, problems are : Problem set: 26 solved, 34 unsolved in 45022 ms.
Refiners :[Generalized P Invariants (flows): 1086/1086 constraints, State Equation: 1377/1377 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1241 variables, 991/991 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1241 variables, 0/991 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 96/1337 variables, 76/1067 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1337 variables, 0/1067 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 292/1629 variables, 1337/2404 constraints. Problems are: Problem set: 26 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1629 variables, 28/2432 constraints. Problems are: Problem set: 26 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1629/1669 variables, and 2432 constraints, problems are : Problem set: 26 solved, 34 unsolved in 45014 ms.
Refiners :[Generalized P Invariants (flows): 1067/1086 constraints, State Equation: 1337/1377 constraints, PredecessorRefiner: 28/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 90151ms problems are : Problem set: 26 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1241 out of 1377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1377/1377 places, 292/292 transitions.
Graph (complete) has 9412 edges and 1377 vertex of which 1375 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 1375 /1377 variables (removed 2) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1375/1377 places, 292/292 transitions.
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:37:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 05:37:04] [INFO ] Flatten gal took : 47 ms
[2024-06-01 05:37:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:37:04] [INFO ] Flatten gal took : 47 ms
[2024-06-01 05:37:04] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 810 out of 1397 places (down from 1279) after GAL structural reductions.
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1397 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1375 transition count 296
Applied a total of 22 rules in 75 ms. Remains 1375 /1397 variables (removed 22) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 1375/1397 places, 296/296 transitions.
[2024-06-01 05:37:04] [INFO ] Flatten gal took : 37 ms
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 38 ms
[2024-06-01 05:37:05] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 72 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1356/1397 places, 296/296 transitions.
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 35 ms
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 34 ms
[2024-06-01 05:37:05] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 123 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 1356/1397 places, 296/296 transitions.
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:37:05] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 123 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 1356/1397 places, 296/296 transitions.
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 29 ms
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:37:05] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1356 transition count 296
Applied a total of 41 rules in 33 ms. Remains 1356 /1397 variables (removed 41) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 1356/1397 places, 296/296 transitions.
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 27 ms
[2024-06-01 05:37:05] [INFO ] Flatten gal took : 29 ms
[2024-06-01 05:37:05] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Graph (complete) has 9588 edges and 1397 vertex of which 988 are kept as prefixes of interest. Removing 409 places using SCC suffix rule.9 ms
Discarding 409 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 987 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 957 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 957 transition count 222
Applied a total of 67 rules in 159 ms. Remains 957 /1397 variables (removed 440) and now considering 222/296 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 159 ms. Remains : 957/1397 places, 222/296 transitions.
[2024-06-01 05:37:06] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:37:06] [INFO ] Flatten gal took : 20 ms
[2024-06-01 05:37:06] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1397/1397 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1357 transition count 296
Applied a total of 40 rules in 120 ms. Remains 1357 /1397 variables (removed 40) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1357/1397 places, 296/296 transitions.
[2024-06-01 05:37:06] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:37:06] [INFO ] Flatten gal took : 26 ms
[2024-06-01 05:37:06] [INFO ] Input system was already deterministic with 296 transitions.
[2024-06-01 05:37:06] [INFO ] Flatten gal took : 28 ms
[2024-06-01 05:37:06] [INFO ] Flatten gal took : 27 ms
[2024-06-01 05:37:06] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 05:37:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1397 places, 296 transitions and 3100 arcs took 5 ms.
Total runtime 171278 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-02
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-10
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-13
Could not compute solution for formula : QuasiCertifProtocol-PT-18-CTLCardinality-2024-15
BK_STOP 1717220226817
--------------------
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 QuasiCertifProtocol-PT-18-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/564/ctl_0_
ctl formula name QuasiCertifProtocol-PT-18-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/564/ctl_1_
ctl formula name QuasiCertifProtocol-PT-18-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/564/ctl_2_
ctl formula name QuasiCertifProtocol-PT-18-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/564/ctl_3_
ctl formula name QuasiCertifProtocol-PT-18-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/564/ctl_4_
ctl formula name QuasiCertifProtocol-PT-18-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/564/ctl_5_
ctl formula name QuasiCertifProtocol-PT-18-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/564/ctl_6_
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="QuasiCertifProtocol-PT-18"
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 QuasiCertifProtocol-PT-18, 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 r520-tall-171662337800081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 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 '
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 ;