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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 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 57K 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-d0m04-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717241414109

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:30:17] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-06-01 11:30:17] [INFO ] Transformed 262 places.
[2024-06-01 11:30:17] [INFO ] Transformed 73 transitions.
[2024-06-01 11:30:17] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 66 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 66 transition count 69
Applied a total of 10 rules in 50 ms. Remains 66 /72 variables (removed 6) and now considering 69/73 (removed 4) transitions.
// Phase 1: matrix 69 rows 66 cols
[2024-06-01 11:30:17] [INFO ] Computed 5 invariants in 16 ms
[2024-06-01 11:30:17] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-01 11:30:17] [INFO ] Invariant cache hit.
[2024-06-01 11:30:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 11:30:18] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-06-01 11:30:18] [INFO ] Invariant cache hit.
[2024-06-01 11:30:18] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-06-01 11:30:19] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-06-01 11:30:19] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-06-01 11:30:19] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-06-01 11:30:20] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-06-01 11:30:20] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:30:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:30:21] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:30:21] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:30:21] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 69/135 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 30/110 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 0/135 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 110 constraints, problems are : Problem set: 0 solved, 68 unsolved in 4457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-06-01 11:30:23] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 69/135 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 30/111 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 68/179 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/179 constraints. Problems are: Problem set: 8 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/179 constraints. Problems are: Problem set: 8 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 179 constraints, problems are : Problem set: 8 solved, 60 unsolved in 3611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 10/10 constraints]
After SMT, in 8311ms problems are : Problem set: 8 solved, 60 unsolved
Search for dead transitions found 8 dead transitions in 8338ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 66/72 places, 61/73 transitions.
Reduce places removed 8 places and 9 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 58 transition count 52
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 54 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 53 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 52 transition count 46
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 14 rules in 4 ms. Remains 52 /66 variables (removed 14) and now considering 46/61 (removed 15) transitions.
// Phase 1: matrix 46 rows 52 cols
[2024-06-01 11:30:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 11:30:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 11:30:26] [INFO ] Invariant cache hit.
[2024-06-01 11:30:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 11:30:26] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/72 places, 46/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9403 ms. Remains : 52/72 places, 46/73 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Support contains 10 out of 48 places after structural reductions.
[2024-06-01 11:30:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 11:30:27] [INFO ] Flatten gal took : 52 ms
[2024-06-01 11:30:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:30:27] [INFO ] Flatten gal took : 30 ms
[2024-06-01 11:30:27] [INFO ] Input system was already deterministic with 46 transitions.
Support contains 2 out of 48 places (down from 10) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8888 resets) in 1050 ms. (38 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (4130 resets) in 581 ms. (68 steps per ms) remains 1/1 properties
// Phase 1: matrix 46 rows 48 cols
[2024-06-01 11:30:27] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 11:30:27] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/77 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/88 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/94 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/94 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/77 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/88 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:30:27] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/94 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 46/46 transitions.
Graph (complete) has 118 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 45
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 43 transition count 43
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 41 transition count 40
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 41 transition count 40
Applied a total of 13 rules in 42 ms. Remains 41 /48 variables (removed 7) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 41/48 places, 40/46 transitions.
RANDOM walk for 40000 steps (8876 resets) in 364 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4137 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 244 steps, run visited all 1 properties in 12 ms. (steps per millisecond=20 )
Probabilistic random walk after 244 steps, saw 136 distinct states, run finished after 18 ms. (steps per millisecond=13 ) properties seen :1
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 10 ms
[2024-06-01 11:30:28] [INFO ] Input system was already deterministic with 46 transitions.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 136 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 46/46 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 45
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 43 transition count 43
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 41 transition count 40
Applied a total of 13 rules in 11 ms. Remains 41 /48 variables (removed 7) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 41/48 places, 40/46 transitions.
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:30:28] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 46/46 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 46 transition count 45
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 43 transition count 42
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 43 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 42 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 42 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 41 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 41 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 41 transition count 39
Applied a total of 14 rules in 12 ms. Remains 41 /48 variables (removed 7) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 41/48 places, 39/46 transitions.
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:30:28] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 46/46 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 45
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 42 transition count 42
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 40 transition count 39
Applied a total of 15 rules in 11 ms. Remains 40 /48 variables (removed 8) and now considering 39/46 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 40/48 places, 39/46 transitions.
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 5 ms
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:30:28] [INFO ] Input system was already deterministic with 39 transitions.
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:30:28] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:30:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:30:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 46 transitions and 181 arcs took 3 ms.
Total runtime 11753 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-d0m04-CTLCardinality-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-12

BK_STOP 1717241428808

--------------------
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-d0m04-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/565/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/565/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d0m04-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/565/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-d0m04"
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-d0m04, 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-171683810500001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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