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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 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-d0m06-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717241532998

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:32:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:32:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:32:16] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-06-01 11:32:16] [INFO ] Transformed 262 places.
[2024-06-01 11:32:16] [INFO ] Transformed 73 transitions.
[2024-06-01 11:32:16] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 73
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 65 transition count 67
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 65 transition count 67
Applied a total of 13 rules in 57 ms. Remains 65 /72 variables (removed 7) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 65 cols
[2024-06-01 11:32:16] [INFO ] Computed 5 invariants in 26 ms
[2024-06-01 11:32:17] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-06-01 11:32:17] [INFO ] Invariant cache hit.
[2024-06-01 11:32:17] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-01 11:32:17] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 11:32:17] [INFO ] Invariant cache hit.
[2024-06-01 11:32:17] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:18] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:19] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 5 ms to minimize.
[2024-06-01 11:32:19] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:19] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:32:19] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:32:19] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:32:20] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:32:20] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:20] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 67/131 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 29/107 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:21] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 1/132 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/132 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (OVERLAPS) 0/132 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 109 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:24] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/64 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 67/131 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 61/170 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 1/132 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/132 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:28] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 3 ms to minimize.
[2024-06-01 11:32:28] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:32:28] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:32:28] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/132 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:29] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/132 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/132 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-01 11:32:31] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/132 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/132 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (OVERLAPS) 0/132 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 182 constraints, problems are : Problem set: 0 solved, 66 unsolved in 10785 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 17/17 constraints]
After SMT, in 17837ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 17861ms
Starting structural reductions in LTL mode, iteration 1 : 65/72 places, 67/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18869 ms. Remains : 65/72 places, 67/73 transitions.
Support contains 19 out of 65 places after structural reductions.
[2024-06-01 11:32:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 11:32:35] [INFO ] Flatten gal took : 42 ms
[2024-06-01 11:32:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:32:35] [INFO ] Flatten gal took : 20 ms
[2024-06-01 11:32:35] [INFO ] Input system was already deterministic with 67 transitions.
Support contains 8 out of 65 places (down from 19) after GAL structural reductions.
RANDOM walk for 40000 steps (8911 resets) in 2005 ms. (19 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (4161 resets) in 750 ms. (53 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (3442 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4123 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4146 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
[2024-06-01 11:32:36] [INFO ] Invariant cache hit.
[2024-06-01 11:32:36] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/41 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 11/52 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/110 variables, 52/57 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 20/77 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 21/131 variables, 12/89 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 9/98 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/132 variables, 1/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/132 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 99 constraints, problems are : Problem set: 2 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/52 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 11:32:36] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:32:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:32:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:32:37] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/110 variables, 52/61 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 20/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 21/131 variables, 12/94 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 9/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/131 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/132 variables, 1/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/132 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/132 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 104 constraints, problems are : Problem set: 2 solved, 1 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 405ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 67/67 transitions.
Graph (complete) has 174 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 65
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 60 transition count 62
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 59 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 59 transition count 60
Applied a total of 12 rules in 31 ms. Remains 59 /65 variables (removed 6) and now considering 60/67 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 59/65 places, 60/67 transitions.
RANDOM walk for 40000 steps (8996 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4142 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 18437 steps, run visited all 1 properties in 70 ms. (steps per millisecond=263 )
Probabilistic random walk after 18437 steps, saw 7903 distinct states, run finished after 75 ms. (steps per millisecond=245 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:32:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 9 ms
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:37] [INFO ] Input system was already deterministic with 67 transitions.
Computed a total of 9 stabilizing places and 11 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 67/67 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 67
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 59 transition count 61
Applied a total of 12 rules in 8 ms. Remains 59 /65 variables (removed 6) and now considering 61/67 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 59/65 places, 61/67 transitions.
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:37] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 67/67 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 67
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 60 transition count 62
Applied a total of 10 rules in 8 ms. Remains 60 /65 variables (removed 5) and now considering 62/67 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 60/65 places, 62/67 transitions.
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:37] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 67/67 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 67
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 59 transition count 61
Applied a total of 12 rules in 8 ms. Remains 59 /65 variables (removed 6) and now considering 61/67 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 59/65 places, 61/67 transitions.
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:37] [INFO ] Input system was already deterministic with 61 transitions.
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 11:32:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 11:32:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 11:32:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 67 transitions and 266 arcs took 2 ms.
Total runtime 21711 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-d0m06-CTLCardinality-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-11

BK_STOP 1717241557919

--------------------
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-d0m06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/586/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/586/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d0m06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/586/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-d0m06"
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-d0m06, 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-171683810600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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