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.r496-tall-171640604100753.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 HealthRecord-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 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 HealthRecord-PT-08-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717201179163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:40] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 00:19:40] [INFO ] Transformed 156 places.
[2024-06-01 00:19:40] [INFO ] Transformed 326 transitions.
[2024-06-01 00:19:40] [INFO ] Found NUPN structural information;
[2024-06-01 00:19:40] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-08-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 300/300 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 106 transition count 204
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 106 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 105 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 105 transition count 202
Applied a total of 102 rules in 24 ms. Remains 105 /156 variables (removed 51) and now considering 202/300 (removed 98) transitions.
[2024-06-01 00:19:40] [INFO ] Flow matrix only has 194 transitions (discarded 8 similar events)
// Phase 1: matrix 194 rows 105 cols
[2024-06-01 00:19:40] [INFO ] Computed 14 invariants in 16 ms
[2024-06-01 00:19:40] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 00:19:40] [INFO ] Flow matrix only has 194 transitions (discarded 8 similar events)
[2024-06-01 00:19:40] [INFO ] Invariant cache hit.
[2024-06-01 00:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:19:40] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-06-01 00:19:40] [INFO ] Flow matrix only has 194 transitions (discarded 8 similar events)
[2024-06-01 00:19:40] [INFO ] Invariant cache hit.
[2024-06-01 00:19:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 15 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:42] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:43] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 193/298 variables, 105/151 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:46] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/299 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (OVERLAPS) 0/299 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 201 unsolved in 10690 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 193/298 variables, 105/152 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 201/353 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:53] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 5 ms to minimize.
[2024-06-01 00:19:56] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 1/299 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:20:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/299 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/299 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 365 constraints, problems are : Problem set: 0 solved, 201 unsolved in 23838 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 44/44 constraints]
After SMT, in 34665ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 34686ms
Starting structural reductions in LTL mode, iteration 1 : 105/156 places, 202/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35049 ms. Remains : 105/156 places, 202/300 transitions.
Support contains 76 out of 105 places after structural reductions.
[2024-06-01 00:20:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 00:20:15] [INFO ] Flatten gal took : 40 ms
FORMULA HealthRecord-PT-08-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:20:15] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:20:15] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 71 out of 105 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (2245 resets) in 1994 ms. (20 steps per ms) remains 16/49 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (26 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (28 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
[2024-06-01 00:20:16] [INFO ] Flow matrix only has 194 transitions (discarded 8 similar events)
[2024-06-01 00:20:16] [INFO ] Invariant cache hit.
[2024-06-01 00:20:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 43/105 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 9 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 2 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 193/298 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/299 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/299 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 143 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 42/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 43/105 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 193/298 variables, 105/167 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 1/299 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/299 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 184 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 48/48 constraints]
After SMT, in 3920ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 15 properties in 402 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 202/202 transitions.
Graph (trivial) has 141 edges and 105 vertex of which 10 / 105 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 430 edges and 100 vertex of which 94 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 94 transition count 178
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 19 place count 89 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 87 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 21 place count 87 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 82 transition count 168
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 63 place count 48 transition count 100
Iterating global reduction 3 with 34 rules applied. Total rules applied 97 place count 48 transition count 100
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 105 place count 40 transition count 83
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 40 transition count 83
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 122 place count 40 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 37 transition count 66
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 37 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 37 transition count 63
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 35 transition count 59
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 35 transition count 59
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 141 place count 35 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 151 place count 30 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 153 place count 30 transition count 83
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 155 place count 30 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 28 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 159 place count 28 transition count 79
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 161 place count 28 transition count 127
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 164 place count 26 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 167 place count 26 transition count 123
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 168 place count 25 transition count 96
Iterating global reduction 8 with 1 rules applied. Total rules applied 169 place count 25 transition count 96
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 170 place count 24 transition count 93
Iterating global reduction 8 with 1 rules applied. Total rules applied 171 place count 24 transition count 93
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 181 place count 24 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 182 place count 24 transition count 83
Applied a total of 182 rules in 68 ms. Remains 24 /105 variables (removed 81) and now considering 83/202 (removed 119) transitions.
Running 67 sub problems to find dead transitions.
[2024-06-01 00:20:21] [INFO ] Flow matrix only has 71 transitions (discarded 12 similar events)
// Phase 1: matrix 71 rows 24 cols
[2024-06-01 00:20:21] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 00:20:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 2 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/50 constraints. Problems are: Problem set: 2 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 50 constraints, problems are : Problem set: 2 solved, 65 unsolved in 663 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 71/95 variables, 24/30 constraints. Problems are: Problem set: 2 solved, 65 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/50 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 62/112 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 112 constraints, problems are : Problem set: 5 solved, 62 unsolved in 1125 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 62/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1850ms problems are : Problem set: 5 solved, 62 unsolved
Search for dead transitions found 5 dead transitions in 1852ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/105 places, 78/202 transitions.
Graph (complete) has 88 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 23 transition count 78
Applied a total of 8 rules in 15 ms. Remains 23 /24 variables (removed 1) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1935 ms. Remains : 23/105 places, 78/202 transitions.
RANDOM walk for 984 steps (214 resets) in 46 ms. (20 steps per ms) remains 0/1 properties
[2024-06-01 00:20:22] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:20:22] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:20:22] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 9 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 61 transition count 119
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 61 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 53 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 53 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 113 place count 53 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 50 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 50 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 48 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 48 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 48 transition count 72
Applied a total of 132 rules in 6 ms. Remains 48 /105 variables (removed 57) and now considering 72/202 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 48/105 places, 72/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 66 transition count 129
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 66 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 59 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 59 transition count 115
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 100 place count 59 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 57 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 55 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 55 transition count 97
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 113 place count 55 transition count 92
Applied a total of 113 rules in 6 ms. Remains 55 /105 variables (removed 50) and now considering 92/202 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/105 places, 92/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 64 transition count 125
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 64 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 58 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 58 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 58 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 57 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 57 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 56 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 56 transition count 96
Applied a total of 110 rules in 6 ms. Remains 56 /105 variables (removed 49) and now considering 96/202 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/105 places, 96/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 70 transition count 136
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 70 transition count 136
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 65 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 65 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 65 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 64 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 63 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 63 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 63 transition count 109
Applied a total of 96 rules in 6 ms. Remains 63 /105 variables (removed 42) and now considering 109/202 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 63/105 places, 109/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 64 transition count 125
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 64 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 58 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 58 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 58 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 57 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 57 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 56 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 56 transition count 96
Applied a total of 110 rules in 6 ms. Remains 56 /105 variables (removed 49) and now considering 96/202 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/105 places, 96/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 73 transition count 142
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 73 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 68 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 68 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 79 place count 68 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 67 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 67 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 67 transition count 121
Applied a total of 84 rules in 5 ms. Remains 67 /105 variables (removed 38) and now considering 121/202 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 67/105 places, 121/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 69 transition count 134
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 69 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 64 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 64 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 87 place count 64 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 63 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 63 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 63 transition count 113
Applied a total of 92 rules in 4 ms. Remains 63 /105 variables (removed 42) and now considering 113/202 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 63/105 places, 113/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Graph (trivial) has 138 edges and 105 vertex of which 10 / 105 are part of one of the 5 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.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 59 transition count 121
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 89 place count 51 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 97 place count 51 transition count 104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 105 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 114 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 46 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 46 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 124 place count 46 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 46 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 44 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 42 transition count 66
Applied a total of 135 rules in 19 ms. Remains 42 /105 variables (removed 63) and now considering 66/202 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 42/105 places, 66/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 67 transition count 131
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 67 transition count 131
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 61 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 61 transition count 119
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 96 place count 61 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 59 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 59 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 57 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 57 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 109 place count 57 transition count 96
Applied a total of 109 rules in 4 ms. Remains 57 /105 variables (removed 48) and now considering 96/202 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 57/105 places, 96/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Graph (trivial) has 141 edges and 105 vertex of which 12 / 105 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 59 transition count 121
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 89 place count 51 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 97 place count 51 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 106 place count 51 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 48 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 115 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 46 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 46 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 46 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 42 transition count 64
Applied a total of 139 rules in 12 ms. Remains 42 /105 variables (removed 63) and now considering 64/202 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 42/105 places, 64/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 61 transition count 119
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 61 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 53 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 53 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 113 place count 53 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 50 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 50 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 50 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 48 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 48 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 48 transition count 72
Applied a total of 132 rules in 3 ms. Remains 48 /105 variables (removed 57) and now considering 72/202 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/105 places, 72/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 202/202 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 66 transition count 128
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 66 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 62 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 62 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 61 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 61 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 60 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 60 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 60 transition count 106
Applied a total of 99 rules in 3 ms. Remains 60 /105 variables (removed 45) and now considering 106/202 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/105 places, 106/202 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:23] [INFO ] Input system was already deterministic with 106 transitions.
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:20:23] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:20:23] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 00:20:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 202 transitions and 593 arcs took 2 ms.
Total runtime 43012 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 : HealthRecord-PT-08-CTLCardinality-2024-00
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-01
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-02
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-03
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-04
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-05
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-06
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-07
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-08
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-09
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2024-11
Could not compute solution for formula : HealthRecord-PT-08-CTLCardinality-2023-12

BK_STOP 1717201223669

--------------------
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:
++ 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
++ sed s/.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 HealthRecord-PT-08-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/811/ctl_0_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/811/ctl_1_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/811/ctl_2_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/811/ctl_3_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/811/ctl_4_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/811/ctl_5_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/811/ctl_6_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/811/ctl_7_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/811/ctl_8_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/811/ctl_9_
ctl formula name HealthRecord-PT-08-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/811/ctl_10_
ctl formula name HealthRecord-PT-08-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/811/ctl_11_
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="HealthRecord-PT-08"
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 HealthRecord-PT-08, 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 r496-tall-171640604100753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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