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.r532-smll-171683810700065.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 SieveSingleMsgMbox-PT-d1m18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717243271777

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:01:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:01:14] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2024-06-01 12:01:14] [INFO ] Transformed 1295 places.
[2024-06-01 12:01:14] [INFO ] Transformed 749 transitions.
[2024-06-01 12:01:14] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 619 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Deduced a syphon composed of 1036 places in 20 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 243 transition count 525
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 298 place count 185 transition count 239
Iterating global reduction 1 with 58 rules applied. Total rules applied 356 place count 185 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 362 place count 185 transition count 233
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 401 place count 146 transition count 194
Iterating global reduction 2 with 39 rules applied. Total rules applied 440 place count 146 transition count 194
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 455 place count 146 transition count 179
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 475 place count 126 transition count 159
Iterating global reduction 3 with 20 rules applied. Total rules applied 495 place count 126 transition count 159
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 505 place count 126 transition count 149
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 511 place count 120 transition count 141
Iterating global reduction 4 with 6 rules applied. Total rules applied 517 place count 120 transition count 141
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 523 place count 114 transition count 135
Iterating global reduction 4 with 6 rules applied. Total rules applied 529 place count 114 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 532 place count 111 transition count 131
Iterating global reduction 4 with 3 rules applied. Total rules applied 535 place count 111 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 536 place count 111 transition count 130
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 538 place count 109 transition count 128
Iterating global reduction 5 with 2 rules applied. Total rules applied 540 place count 109 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 541 place count 108 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 542 place count 108 transition count 127
Applied a total of 542 rules in 204 ms. Remains 108 /259 variables (removed 151) and now considering 127/749 (removed 622) transitions.
// Phase 1: matrix 127 rows 108 cols
[2024-06-01 12:01:14] [INFO ] Computed 5 invariants in 28 ms
[2024-06-01 12:01:15] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-06-01 12:01:15] [INFO ] Invariant cache hit.
[2024-06-01 12:01:15] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:01:16] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 12:01:16] [INFO ] Invariant cache hit.
[2024-06-01 12:01:16] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 16 ms to minimize.
[2024-06-01 12:01:19] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/234 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 51/165 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 12:01:21] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:01:22] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 1/235 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (OVERLAPS) 0/235 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 168 constraints, problems are : Problem set: 0 solved, 126 unsolved in 13373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 1/107 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/234 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 51/167 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 116/283 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 1/235 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 10/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/235 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 294 constraints, problems are : Problem set: 0 solved, 126 unsolved in 17382 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 31417ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 31446ms
Starting structural reductions in LTL mode, iteration 1 : 108/259 places, 127/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33114 ms. Remains : 108/259 places, 127/749 transitions.
Support contains 9 out of 108 places after structural reductions.
[2024-06-01 12:01:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 12:01:48] [INFO ] Flatten gal took : 60 ms
[2024-06-01 12:01:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:01:48] [INFO ] Flatten gal took : 29 ms
[2024-06-01 12:01:48] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 6 out of 108 places (down from 9) after GAL structural reductions.
RANDOM walk for 40000 steps (8926 resets) in 2533 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4138 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4118 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4175 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4151 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4121 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4095 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 423253 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 6
Probabilistic random walk after 423253 steps, saw 184929 distinct states, run finished after 3018 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 12:01:52] [INFO ] Invariant cache hit.
[2024-06-01 12:01:52] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/90 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 113/203 variables, 90/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 37/134 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/134 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 235/235 variables, and 152 constraints, problems are : Problem set: 6 solved, 0 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 37/51 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 327ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:01:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 16 ms
FORMULA SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:01:52] [INFO ] Input system was already deterministic with 127 transitions.
Computed a total of 25 stabilizing places and 32 stable transitions
Graph (complete) has 346 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 127/127 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 126
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 99 transition count 116
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 99 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 99 transition count 112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 93 transition count 106
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 93 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 93 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 41 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 89 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 89 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 50 place count 86 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 53 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 62 place count 81 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 79 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 78 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 77 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 77 transition count 81
Applied a total of 72 rules in 16 ms. Remains 77 /108 variables (removed 31) and now considering 81/127 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 77/108 places, 81/127 transitions.
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:01:52] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 127/127 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 126
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 99 transition count 116
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 99 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 99 transition count 112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 93 transition count 106
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 93 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 93 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 41 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 89 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 89 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 50 place count 86 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 53 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 62 place count 81 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 79 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 78 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 77 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 77 transition count 81
Applied a total of 72 rules in 15 ms. Remains 77 /108 variables (removed 31) and now considering 81/127 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 77/108 places, 81/127 transitions.
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:01:52] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 127/127 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 126
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 99 transition count 116
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 99 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 99 transition count 112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 93 transition count 106
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 93 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 93 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 41 place count 89 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 89 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 89 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 50 place count 86 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 53 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 62 place count 81 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 64 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 80 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 79 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 78 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 77 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 77 transition count 81
Applied a total of 72 rules in 15 ms. Remains 77 /108 variables (removed 31) and now considering 81/127 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 77/108 places, 81/127 transitions.
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:01:52] [INFO ] Input system was already deterministic with 81 transitions.
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:01:52] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:01:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 12:01:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 127 transitions and 505 arcs took 3 ms.
Total runtime 39205 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 : SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-11

BK_STOP 1717243313326

--------------------
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 SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/545/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/545/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d1m18-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/545/ctl_2_
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="SieveSingleMsgMbox-PT-d1m18"
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 SieveSingleMsgMbox-PT-d1m18, 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 r532-smll-171683810700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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