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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.4K 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 7.8K Apr 12 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 19:37 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 1.1M 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-d2m04-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717247008435

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:03:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:03:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:03:30] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-06-01 13:03:30] [INFO ] Transformed 2398 places.
[2024-06-01 13:03:30] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:03:30] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 123 ms.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 114 places :
Symmetric choice reduction at 1 with 114 rule applications. Total rules 967 place count 275 transition count 396
Iterating global reduction 1 with 114 rules applied. Total rules applied 1081 place count 275 transition count 396
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1091 place count 275 transition count 386
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 1174 place count 192 transition count 303
Iterating global reduction 2 with 83 rules applied. Total rules applied 1257 place count 192 transition count 303
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1285 place count 192 transition count 275
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1324 place count 153 transition count 224
Iterating global reduction 3 with 39 rules applied. Total rules applied 1363 place count 153 transition count 224
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1386 place count 153 transition count 201
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1393 place count 146 transition count 186
Iterating global reduction 4 with 7 rules applied. Total rules applied 1400 place count 146 transition count 186
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1407 place count 139 transition count 179
Iterating global reduction 4 with 7 rules applied. Total rules applied 1414 place count 139 transition count 179
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1416 place count 137 transition count 177
Iterating global reduction 4 with 2 rules applied. Total rules applied 1418 place count 137 transition count 177
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1420 place count 135 transition count 175
Iterating global reduction 4 with 2 rules applied. Total rules applied 1422 place count 135 transition count 175
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1424 place count 133 transition count 173
Iterating global reduction 4 with 2 rules applied. Total rules applied 1426 place count 133 transition count 173
Applied a total of 1426 rules in 160 ms. Remains 133 /414 variables (removed 281) and now considering 173/1954 (removed 1781) transitions.
// Phase 1: matrix 173 rows 133 cols
[2024-06-01 13:03:31] [INFO ] Computed 5 invariants in 24 ms
[2024-06-01 13:03:31] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-06-01 13:03:31] [INFO ] Invariant cache hit.
[2024-06-01 13:03:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 13:03:32] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-06-01 13:03:32] [INFO ] Invariant cache hit.
[2024-06-01 13:03:32] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 13:03:34] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 30 ms to minimize.
[2024-06-01 13:03:34] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:03:36] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 3 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:03:37] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:03:38] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 8 (OVERLAPS) 173/306 variables, 133/148 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 78/226 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/226 constraints. Problems are: Problem set: 15 solved, 157 unsolved
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:03:42] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/306 variables, 2/228 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/306 variables, 0/228 constraints. Problems are: Problem set: 17 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 228 constraints, problems are : Problem set: 17 solved, 155 unsolved in 16002 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 17 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 7/118 variables, 2/7 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/9 constraints. Problems are: Problem set: 17 solved, 155 unsolved
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/10 constraints. Problems are: Problem set: 17 solved, 155 unsolved
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-06-01 13:03:50] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/12 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 10/128 variables, 1/13 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 7/20 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 172/300 variables, 128/148 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 77/225 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 15/240 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 0/240 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 14 (OVERLAPS) 6/306 variables, 5/245 constraints. Problems are: Problem set: 17 solved, 155 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 1/246 constraints. Problems are: Problem set: 17 solved, 155 unsolved
Problem TDEAD152 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 140/386 constraints. Problems are: Problem set: 22 solved, 150 unsolved
[2024-06-01 13:04:04] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:04:04] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 2/388 constraints. Problems are: Problem set: 22 solved, 150 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/388 constraints. Problems are: Problem set: 22 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 388 constraints, problems are : Problem set: 22 solved, 150 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 155/172 constraints, Known Traps: 17/17 constraints]
After SMT, in 46656ms problems are : Problem set: 22 solved, 150 unsolved
Search for dead transitions found 22 dead transitions in 46678ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/414 places, 151/1954 transitions.
Reduce places removed 36 places and 40 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 97 transition count 105
Reduce places removed 16 places and 21 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 58 place count 81 transition count 84
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 78 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 78 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 78 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 77 transition count 78
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 77 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 76 transition count 77
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 76 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 75 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 75 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 71 rules in 11 ms. Remains 75 /133 variables (removed 58) and now considering 76/151 (removed 75) transitions.
// Phase 1: matrix 76 rows 75 cols
[2024-06-01 13:04:19] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 13:04:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 13:04:19] [INFO ] Invariant cache hit.
[2024-06-01 13:04:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 13:04:19] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 75/414 places, 76/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48415 ms. Remains : 75/414 places, 76/1954 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Support contains 4 out of 70 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:04:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 13:04:19] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:04:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:04:19] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:04:19] [INFO ] Input system was already deterministic with 76 transitions.
Support contains 3 out of 70 places (down from 4) after GAL structural reductions.
RANDOM walk for 40000 steps (8935 resets) in 1939 ms. (20 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4093 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3963 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4054 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Probably explored full state space saw : 1032 states, properties seen :2
Probabilistic random walk after 2455 steps, saw 1032 distinct states, run finished after 22 ms. (steps per millisecond=111 ) properties seen :2
Explored full state space saw : 1032 states, properties seen :0
Exhaustive walk after 2455 steps, saw 1032 distinct states, run finished after 7 ms. (steps per millisecond=350 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 10 ms
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 10 ms
[2024-06-01 13:04:20] [INFO ] Input system was already deterministic with 76 transitions.
Computed a total of 70 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 70 transition count 76
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 76/76 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 69 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 65 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 65 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 65 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 62 transition count 66
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 62 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 62 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 60 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 60 transition count 60
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 58 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 58 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 58 transition count 57
Applied a total of 30 rules in 6 ms. Remains 58 /70 variables (removed 12) and now considering 57/76 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 58/70 places, 57/76 transitions.
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:04:20] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 67 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 65 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 65 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 65 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 64 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 64 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 63 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 63 transition count 64
Applied a total of 18 rules in 5 ms. Remains 63 /70 variables (removed 7) and now considering 64/76 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 63/70 places, 64/76 transitions.
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:04:20] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 76/76 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 69 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 65 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 65 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 65 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 62 transition count 66
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 62 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 62 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 60 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 60 transition count 60
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 58 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 58 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 58 transition count 57
Applied a total of 30 rules in 7 ms. Remains 58 /70 variables (removed 12) and now considering 57/76 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 58/70 places, 57/76 transitions.
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:04:20] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 76/76 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 69 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 66 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 66 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 66 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 64 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 64 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 64 transition count 67
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 17 place count 62 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 62 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 60 transition count 61
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 60 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 60 transition count 60
Applied a total of 24 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 60/76 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 60/70 places, 60/76 transitions.
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:04:20] [INFO ] Input system was already deterministic with 60 transitions.
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:04:20] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:04:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:04:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 76 transitions and 297 arcs took 3 ms.
Total runtime 50691 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-d2m04-CTLCardinality-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-12
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-15

BK_STOP 1717247061165

--------------------
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-d2m04-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/575/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/575/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/575/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d2m04-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/575/ctl_3_
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-d2m04"
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-d2m04, 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-171683810800097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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