Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400475.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749184377737

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 04:32:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 04:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 04:32:59] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-06 04:32:59] [INFO ] Transformed 2398 places.
[2025-06-06 04:32:59] [INFO ] Transformed 1954 transitions.
[2025-06-06 04:32:59] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 1984 places in 30 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 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 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 377
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 377
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 1101 place count 271 transition count 365
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1192 place count 180 transition count 274
Iterating global reduction 2 with 91 rules applied. Total rules applied 1283 place count 180 transition count 274
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1318 place count 180 transition count 239
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1356 place count 142 transition count 186
Iterating global reduction 3 with 38 rules applied. Total rules applied 1394 place count 142 transition count 186
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1418 place count 142 transition count 162
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1426 place count 134 transition count 150
Iterating global reduction 4 with 8 rules applied. Total rules applied 1434 place count 134 transition count 150
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1442 place count 126 transition count 142
Iterating global reduction 4 with 8 rules applied. Total rules applied 1450 place count 126 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1454 place count 122 transition count 138
Iterating global reduction 4 with 4 rules applied. Total rules applied 1458 place count 122 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1460 place count 122 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1464 place count 118 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 1468 place count 118 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1470 place count 116 transition count 130
Iterating global reduction 5 with 2 rules applied. Total rules applied 1472 place count 116 transition count 130
Applied a total of 1472 rules in 92 ms. Remains 116 /414 variables (removed 298) and now considering 130/1954 (removed 1824) transitions.
// Phase 1: matrix 130 rows 116 cols
[2025-06-06 04:32:59] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:32:59] [INFO ] Implicit Places using invariants in 248 ms returned []
[2025-06-06 04:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:32:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-06 04:33:00] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-06-06 04:33:00] [INFO ] Invariant cache hit.
[2025-06-06 04:33:00] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:02] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:02] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 130/246 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:04] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 174 constraints, problems are : Problem set: 3 solved, 126 unsolved in 9774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 4/116 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 130/246 variables, 116/124 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 50/174 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 126/300 constraints. Problems are: Problem set: 3 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:14] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:14] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:14] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:14] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 4/304 constraints. Problems are: Problem set: 3 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:25] [INFO ] Deduced a trap along path composed of 10 places in 38 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/305 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/305 constraints. Problems are: Problem set: 3 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 305 constraints, problems are : Problem set: 3 solved, 126 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 126/129 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39985ms problems are : Problem set: 3 solved, 126 unsolved
Search for dead transitions found 3 dead transitions in 39993ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 116/414 places, 127/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 127
Applied a total of 3 rules in 5 ms. Remains 113 /116 variables (removed 3) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 113 cols
[2025-06-06 04:33:40] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:33:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 04:33:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:33:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-06 04:33:40] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/414 places, 127/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41087 ms. Remains : 113/414 places, 127/1954 transitions.
Support contains 3 out of 113 places after structural reductions.
[2025-06-06 04:33:40] [INFO ] Flatten gal took : 29 ms
[2025-06-06 04:33:40] [INFO ] Flatten gal took : 12 ms
[2025-06-06 04:33:40] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (8987 resets) in 1540 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4122 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4207 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4220 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 990090 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :1 out of 3
Probabilistic random walk after 990090 steps, saw 462254 distinct states, run finished after 3006 ms. (steps per millisecond=329 ) properties seen :1
[2025-06-06 04:33:44] [INFO ] Invariant cache hit.
[2025-06-06 04:33:44] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 112/198 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 10 (OVERLAPS) 42/240 variables, 27/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 15/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 166 constraints, problems are : Problem set: 1 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/62 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/85 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/197 variables, 85/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 34/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 240/240 variables, and 152 constraints, problems are : Problem set: 2 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 34/49 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 41 stable transitions
Graph (complete) has 358 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 127/127 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 111 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 111 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 110 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 117
Applied a total of 18 rules in 19 ms. Remains 104 /113 variables (removed 9) and now considering 117/127 (removed 10) transitions.
// Phase 1: matrix 117 rows 104 cols
[2025-06-06 04:33:44] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:33:44] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-06 04:33:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:33:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-06 04:33:44] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-06-06 04:33:44] [INFO ] Invariant cache hit.
[2025-06-06 04:33:44] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 5 (OVERLAPS) 117/221 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 45/153 constraints. Problems are: Problem set: 3 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:47] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/154 constraints. Problems are: Problem set: 3 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:48] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/221 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 155 constraints, problems are : Problem set: 3 solved, 113 unsolved in 7755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 117/220 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 45/153 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 17/170 constraints. Problems are: Problem set: 3 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:33:54] [INFO ] Deduced a trap along path composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/171 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 13 (OVERLAPS) 1/221 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 96/268 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 1/269 constraints. Problems are: Problem set: 3 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:15] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/221 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/221 variables, and 270 constraints, problems are : Problem set: 3 solved, 113 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 113/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37822ms problems are : Problem set: 3 solved, 113 unsolved
Search for dead transitions found 3 dead transitions in 37825ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 104/113 places, 114/127 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 101 transition count 114
Applied a total of 3 rules in 1 ms. Remains 101 /104 variables (removed 3) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 101 cols
[2025-06-06 04:34:22] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 04:34:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 04:34:22] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/113 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38496 ms. Remains : 101/113 places, 114/127 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 23 stabilizing places and 29 stable transitions
Graph (complete) has 320 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLCardinality-06 finished in 39299 ms.
All properties solved by simple procedures.
Total runtime 84837 ms.

BK_STOP 1749184463768

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d2m36"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901994400475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;