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.r579-smll-171734921400161.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 MedleyA-PT-21, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 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 MedleyA-PT-21-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-21-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717363845814

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:30:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:30:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:30:48] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-06-02 21:30:48] [INFO ] Transformed 306 places.
[2024-06-02 21:30:48] [INFO ] Transformed 298 transitions.
[2024-06-02 21:30:48] [INFO ] Found NUPN structural information;
[2024-06-02 21:30:48] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
FORMULA MedleyA-PT-21-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 276 transition count 268
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 276 transition count 268
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 258 transition count 250
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 258 transition count 250
Applied a total of 96 rules in 142 ms. Remains 258 /306 variables (removed 48) and now considering 250/298 (removed 48) transitions.
// Phase 1: matrix 250 rows 258 cols
[2024-06-02 21:30:49] [INFO ] Computed 20 invariants in 52 ms
[2024-06-02 21:30:49] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-06-02 21:30:49] [INFO ] Invariant cache hit.
[2024-06-02 21:30:50] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-06-02 21:30:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 16 ms to minimize.
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 3 ms to minimize.
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
[2024-06-02 21:30:55] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 5 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 3 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:30:56] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-06-02 21:30:57] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:30:57] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:30:57] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:30:57] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:30:57] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:30:57] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:30:58] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:30:58] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:30:58] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:30:58] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 4 ms to minimize.
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:31:02] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:31:03] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:07] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 250/508 variables, 258/310 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 310 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/258 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 32/52 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:24] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 3 ms to minimize.
[2024-06-02 21:31:24] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 8 ms to minimize.
[2024-06-02 21:31:26] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 250/508 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 249/563 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:30] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:31:30] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
[2024-06-02 21:31:31] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 4 ms to minimize.
[2024-06-02 21:31:32] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 5 ms to minimize.
[2024-06-02 21:31:32] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:31:32] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 4 ms to minimize.
[2024-06-02 21:31:33] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 3 ms to minimize.
[2024-06-02 21:31:33] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:31:34] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 4 ms to minimize.
[2024-06-02 21:31:34] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 4 ms to minimize.
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 72 places in 143 ms of which 4 ms to minimize.
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 4 ms to minimize.
[2024-06-02 21:31:36] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 4 ms to minimize.
[2024-06-02 21:31:36] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 4 ms to minimize.
[2024-06-02 21:31:36] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 3 ms to minimize.
[2024-06-02 21:31:37] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 17/580 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:40] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 4 ms to minimize.
[2024-06-02 21:31:40] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:31:40] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 15 ms to minimize.
[2024-06-02 21:31:40] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:31:41] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
[2024-06-02 21:31:41] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-06-02 21:31:41] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 4 ms to minimize.
[2024-06-02 21:31:42] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 4 ms to minimize.
[2024-06-02 21:31:42] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 4 ms to minimize.
[2024-06-02 21:31:42] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-06-02 21:31:43] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 5 ms to minimize.
[2024-06-02 21:31:44] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 4 ms to minimize.
[2024-06-02 21:31:44] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 5 ms to minimize.
[2024-06-02 21:31:45] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 4 ms to minimize.
[2024-06-02 21:31:46] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 15/595 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:31:49] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:31:49] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 597 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 70/70 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 258/306 places, 250/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61524 ms. Remains : 258/306 places, 250/298 transitions.
Support contains 79 out of 258 places after structural reductions.
[2024-06-02 21:31:50] [INFO ] Flatten gal took : 68 ms
[2024-06-02 21:31:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-21-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:31:50] [INFO ] Flatten gal took : 42 ms
[2024-06-02 21:31:51] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 68 out of 258 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1917 ms. (20 steps per ms) remains 8/42 properties
BEST_FIRST walk for 40002 steps (8 resets) in 283 ms. (140 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/3 properties
[2024-06-02 21:31:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 194/258 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/508 variables, 258/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/508 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 194/258 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:31:52] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-06-02 21:31:52] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 3 ms to minimize.
[2024-06-02 21:31:52] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:31:52] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:31:52] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 250/508 variables, 258/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/508 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1031ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 347 ms.
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 184 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 253 transition count 184
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 193 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 192 transition count 183
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 123 place count 192 transition count 153
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 183 place count 162 transition count 153
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 203 place count 142 transition count 133
Iterating global reduction 3 with 20 rules applied. Total rules applied 223 place count 142 transition count 133
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 223 place count 142 transition count 121
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 247 place count 130 transition count 121
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 319 place count 94 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 325 place count 91 transition count 108
Free-agglomeration rule applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 351 place count 91 transition count 82
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 379 place count 65 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 65 transition count 80
Applied a total of 380 rules in 82 ms. Remains 65 /258 variables (removed 193) and now considering 80/250 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 65/258 places, 80/250 transitions.
RANDOM walk for 3307 steps (101 resets) in 53 ms. (61 steps per ms) remains 0/2 properties
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:31:53] [INFO ] Input system was already deterministic with 250 transitions.
Computed a total of 49 stabilizing places and 49 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 183 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 252 transition count 185
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 193 transition count 185
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 119 place count 193 transition count 153
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 183 place count 161 transition count 153
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 204 place count 140 transition count 132
Iterating global reduction 2 with 21 rules applied. Total rules applied 225 place count 140 transition count 132
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 225 place count 140 transition count 123
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 243 place count 131 transition count 123
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 297 place count 104 transition count 96
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 104 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 103 transition count 95
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 47 edges and 102 vertex of which 5 / 102 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 99 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 306 place count 98 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 312 place count 95 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 95 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 314 place count 95 transition count 86
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 94 transition count 86
Applied a total of 316 rules in 58 ms. Remains 94 /258 variables (removed 164) and now considering 86/250 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 94/258 places, 86/250 transitions.
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:31:53] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 187 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 252 transition count 184
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 192 transition count 184
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 121 place count 192 transition count 152
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 185 place count 160 transition count 152
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 206 place count 139 transition count 131
Iterating global reduction 2 with 21 rules applied. Total rules applied 227 place count 139 transition count 131
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 227 place count 139 transition count 121
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 247 place count 129 transition count 121
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 297 place count 104 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 103 transition count 95
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 102 vertex of which 5 / 102 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 300 place count 99 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 304 place count 98 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 310 place count 95 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 95 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 312 place count 95 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 94 transition count 86
Applied a total of 314 rules in 52 ms. Remains 94 /258 variables (removed 164) and now considering 86/250 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 94/258 places, 86/250 transitions.
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:31:53] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 186 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 252 transition count 184
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 192 transition count 184
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 121 place count 192 transition count 153
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 183 place count 161 transition count 153
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 204 place count 140 transition count 132
Iterating global reduction 2 with 21 rules applied. Total rules applied 225 place count 140 transition count 132
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 225 place count 140 transition count 122
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 245 place count 130 transition count 122
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 299 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 300 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 306 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 312 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 314 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 314 place count 94 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 93 transition count 85
Applied a total of 316 rules in 48 ms. Remains 93 /258 variables (removed 165) and now considering 85/250 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 93/258 places, 85/250 transitions.
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:31:53] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 7261 steps (218 resets) in 53 ms. (134 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 166 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 252 transition count 195
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 203 transition count 192
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 200 transition count 192
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 105 place count 200 transition count 161
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 167 place count 169 transition count 161
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 186 place count 150 transition count 142
Iterating global reduction 3 with 19 rules applied. Total rules applied 205 place count 150 transition count 142
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 205 place count 150 transition count 134
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 221 place count 142 transition count 134
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 271 place count 117 transition count 109
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 117 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 116 transition count 108
Applied a total of 273 rules in 46 ms. Remains 116 /258 variables (removed 142) and now considering 108/250 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 116/258 places, 108/250 transitions.
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:31:53] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 236 transition count 228
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 236 transition count 228
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 224 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 224 transition count 216
Applied a total of 68 rules in 18 ms. Remains 224 /258 variables (removed 34) and now considering 216/250 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 224/258 places, 216/250 transitions.
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:31:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 235 transition count 227
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 221 transition count 213
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 221 transition count 213
Applied a total of 74 rules in 15 ms. Remains 221 /258 variables (removed 37) and now considering 213/250 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 221/258 places, 213/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 234 transition count 226
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 234 transition count 226
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 62 place count 220 transition count 212
Iterating global reduction 0 with 14 rules applied. Total rules applied 76 place count 220 transition count 212
Applied a total of 76 rules in 17 ms. Remains 220 /258 variables (removed 38) and now considering 212/250 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 220/258 places, 212/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 175 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 252 transition count 188
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 196 transition count 188
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 113 place count 196 transition count 159
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 171 place count 167 transition count 159
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 149 transition count 141
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 149 transition count 141
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 207 place count 149 transition count 134
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 221 place count 142 transition count 134
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 279 place count 113 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 113 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 112 transition count 104
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 111 vertex of which 5 / 111 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 283 place count 108 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 286 place count 108 transition count 101
Applied a total of 286 rules in 37 ms. Remains 108 /258 variables (removed 150) and now considering 101/250 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 108/258 places, 101/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 184 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 252 transition count 186
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 194 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 193 transition count 185
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 119 place count 193 transition count 153
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 183 place count 161 transition count 153
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 202 place count 142 transition count 134
Iterating global reduction 3 with 19 rules applied. Total rules applied 221 place count 142 transition count 134
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 221 place count 142 transition count 125
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 239 place count 133 transition count 125
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 295 place count 105 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 296 place count 104 transition count 96
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 103 vertex of which 5 / 103 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 298 place count 100 transition count 96
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 302 place count 99 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 308 place count 96 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 310 place count 96 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 310 place count 96 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 312 place count 95 transition count 87
Applied a total of 312 rules in 39 ms. Remains 95 /258 variables (removed 163) and now considering 87/250 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 95/258 places, 87/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 5 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 239 transition count 231
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 239 transition count 231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 229 transition count 221
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 229 transition count 221
Applied a total of 58 rules in 12 ms. Remains 229 /258 variables (removed 29) and now considering 221/250 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 229/258 places, 221/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Graph (trivial) has 180 edges and 258 vertex of which 6 / 258 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 252 transition count 188
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 196 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 195 transition count 187
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 115 place count 195 transition count 156
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 177 place count 164 transition count 156
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 196 place count 145 transition count 137
Iterating global reduction 3 with 19 rules applied. Total rules applied 215 place count 145 transition count 137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 215 place count 145 transition count 128
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 233 place count 136 transition count 128
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 289 place count 108 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 108 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 107 transition count 99
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 106 vertex of which 5 / 106 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 293 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 297 place count 102 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 303 place count 99 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 99 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 305 place count 99 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 98 transition count 90
Applied a total of 307 rules in 41 ms. Remains 98 /258 variables (removed 160) and now considering 90/250 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 98/258 places, 90/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 236 transition count 228
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 236 transition count 228
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 224 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 224 transition count 216
Applied a total of 68 rules in 13 ms. Remains 224 /258 variables (removed 34) and now considering 216/250 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 224/258 places, 216/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 238 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 238 transition count 230
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 226 transition count 218
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 226 transition count 218
Applied a total of 64 rules in 12 ms. Remains 226 /258 variables (removed 32) and now considering 218/250 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 226/258 places, 218/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 250/250 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 235 transition count 227
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 235 transition count 227
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 222 transition count 214
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 222 transition count 214
Applied a total of 72 rules in 13 ms. Remains 222 /258 variables (removed 36) and now considering 214/250 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 222/258 places, 214/250 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 214 transitions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:31:54] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-02 21:31:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 250 transitions and 604 arcs took 3 ms.
Total runtime 66378 ms.
There are residual formulas that ITS could not solve within timeout
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 : MedleyA-PT-21-CTLCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-02
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-04
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-05
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-06
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-07
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-08
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-09
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-10
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-11
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-21-CTLCardinality-2024-15

BK_STOP 1717363915186

--------------------
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.202405141337.jar
+ 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 MedleyA-PT-21-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/743/ctl_0_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/743/ctl_1_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/743/ctl_2_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/743/ctl_3_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/743/ctl_4_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/743/ctl_5_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/743/ctl_6_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/743/ctl_7_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/743/ctl_8_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/743/ctl_9_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/743/ctl_10_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/743/ctl_11_
ctl formula name MedleyA-PT-21-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/743/ctl_12_
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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r579-smll-171734921400161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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