Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400459.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-d2m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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-d2m06-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749176784871

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 02:26:26] [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 02:26:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:26:26] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2025-06-06 02:26:26] [INFO ] Transformed 2398 places.
[2025-06-06 02:26:26] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:26:26] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1984 places in 27 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 852 rules applied. Total rules applied 852 place count 390 transition count 1126
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 969 place count 273 transition count 392
Iterating global reduction 1 with 117 rules applied. Total rules applied 1086 place count 273 transition count 392
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1096 place count 273 transition count 382
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1186 place count 183 transition count 292
Iterating global reduction 2 with 90 rules applied. Total rules applied 1276 place count 183 transition count 292
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1310 place count 183 transition count 258
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1347 place count 146 transition count 207
Iterating global reduction 3 with 37 rules applied. Total rules applied 1384 place count 146 transition count 207
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1410 place count 146 transition count 181
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1417 place count 139 transition count 171
Iterating global reduction 4 with 7 rules applied. Total rules applied 1424 place count 139 transition count 171
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1431 place count 132 transition count 164
Iterating global reduction 4 with 7 rules applied. Total rules applied 1438 place count 132 transition count 164
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1441 place count 129 transition count 160
Iterating global reduction 4 with 3 rules applied. Total rules applied 1444 place count 129 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1446 place count 129 transition count 158
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1449 place count 126 transition count 155
Iterating global reduction 5 with 3 rules applied. Total rules applied 1452 place count 126 transition count 155
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1454 place count 124 transition count 153
Iterating global reduction 5 with 2 rules applied. Total rules applied 1456 place count 124 transition count 153
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1457 place count 123 transition count 152
Iterating global reduction 5 with 1 rules applied. Total rules applied 1458 place count 123 transition count 152
Applied a total of 1458 rules in 97 ms. Remains 123 /414 variables (removed 291) and now considering 152/1954 (removed 1802) transitions.
// Phase 1: matrix 152 rows 123 cols
[2025-06-06 02:26:26] [INFO ] Computed 5 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:26:27] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-06 02:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:26:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-06 02:26:27] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-06 02:26:27] [INFO ] Invariant cache hit.
[2025-06-06 02:26:27] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:29] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:29] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:30] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:31] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:32] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:32] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:32] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 152/274 variables, 122/146 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 67/213 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (OVERLAPS) 1/275 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:38] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:38] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:38] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:38] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:26:38] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 5 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 5/219 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 14 (OVERLAPS) 0/275 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 219 constraints, problems are : Problem set: 3 solved, 148 unsolved in 20126 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 123/123 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 11/12 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/16 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 13/29 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 152/274 variables, 122/151 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 67/218 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 143/361 constraints. Problems are: Problem set: 3 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/275 variables, and 361 constraints, problems are : Problem set: 3 solved, 148 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/123 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 143/151 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50426ms problems are : Problem set: 3 solved, 148 unsolved
Search for dead transitions found 3 dead transitions in 50440ms
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 : 123/414 places, 149/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 120 transition count 149
Applied a total of 3 rules in 15 ms. Remains 120 /123 variables (removed 3) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 120 cols
[2025-06-06 02:27:18] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:27:18] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-06 02:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:27:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-06 02:27:18] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 120/414 places, 149/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52002 ms. Remains : 120/414 places, 149/1954 transitions.
Support contains 5 out of 120 places after structural reductions.
[2025-06-06 02:27:18] [INFO ] Flatten gal took : 54 ms
[2025-06-06 02:27:18] [INFO ] Flatten gal took : 21 ms
[2025-06-06 02:27:18] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 40000 steps (8972 resets) in 1641 ms. (24 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (4149 resets) in 715 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4107 resets) in 598 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4002 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4114 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
[2025-06-06 02:27:20] [INFO ] Invariant cache hit.
[2025-06-06 02:27:20] [INFO ] State equation strengthened by 66 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/69 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/92 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 132/224 variables, 92/96 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 49/145 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 44/268 variables, 27/172 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 17/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/269 variables, 1/190 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 190 constraints, problems are : Problem set: 1 solved, 3 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:20] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/92 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 132/224 variables, 92/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 49/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 44/268 variables, 27/175 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 17/192 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 1/193 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:21] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 2/195 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/269 variables, 1/196 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/269 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 196 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1406ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 256 ms.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 149/149 transitions.
Graph (complete) has 353 edges and 120 vertex of which 118 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 118 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 117 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 117 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 117 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 116 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 116 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 115 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 114 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 114 transition count 141
Applied a total of 12 rules in 49 ms. Remains 114 /120 variables (removed 6) and now considering 141/149 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 114/120 places, 141/149 transitions.
RANDOM walk for 40000 steps (8937 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4015 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4144 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4151 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
Probably explored full state space saw : 103027 states, properties seen :2
Probabilistic random walk after 254984 steps, saw 103027 distinct states, run finished after 640 ms. (steps per millisecond=398 ) properties seen :2
Explored full state space saw : 103027 states, properties seen :0
Exhaustive walk after 254984 steps, saw 103027 distinct states, run finished after 319 ms. (steps per millisecond=799 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 393 edges and 120 vertex of which 119 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(X(p0)))'
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 149/149 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 116 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 116 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 116 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 114 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 114 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 112 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 112 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 112 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 110 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 108 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 108 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 106 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 106 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 105 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 105 transition count 118
Applied a total of 33 rules in 16 ms. Remains 105 /120 variables (removed 15) and now considering 118/149 (removed 31) transitions.
// Phase 1: matrix 118 rows 105 cols
[2025-06-06 02:27:23] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:27:23] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-06 02:27:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:27:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-06 02:27:24] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-06 02:27:24] [INFO ] Invariant cache hit.
[2025-06-06 02:27:24] [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/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:25] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 6 (OVERLAPS) 118/223 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 45/155 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:27] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:29] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 1/157 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 157 constraints, problems are : Problem set: 3 solved, 114 unsolved in 13484 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 2/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/110 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 45/155 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/172 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 1/223 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 97/270 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 1/271 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:27:55] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/223 variables, and 272 constraints, problems are : Problem set: 3 solved, 114 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 114/117 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43618ms problems are : Problem set: 3 solved, 114 unsolved
Search for dead transitions found 3 dead transitions in 43619ms
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 : 105/120 places, 115/149 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 115
Applied a total of 3 rules in 1 ms. Remains 102 /105 variables (removed 3) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 102 cols
[2025-06-06 02:28:07] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:07] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-06 02:28:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 02:28:08] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/120 places, 115/149 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44609 ms. Remains : 102/120 places, 115/149 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 300 ms.
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Computed a total of 23 stabilizing places and 29 stable transitions
Graph (complete) has 323 edges and 102 vertex of which 101 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 32 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLCardinality-06 finished in 45610 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' '!(G((p0||X(F((p0&&X(F(p0))))))))'
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 149/149 transitions.
Graph (complete) has 393 edges and 120 vertex of which 119 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 116 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 116 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 9 place count 116 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 114 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 114 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 114 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 112 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 112 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 110 transition count 135
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 110 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 108 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 108 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 106 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 106 transition count 131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 105 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 105 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 104 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 104 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 103 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 103 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 102 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 102 transition count 125
Applied a total of 38 rules in 41 ms. Remains 102 /120 variables (removed 18) and now considering 125/149 (removed 24) transitions.
// Phase 1: matrix 125 rows 102 cols
[2025-06-06 02:28:08] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:09] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-06 02:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 02:28:09] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:28:09] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-06 02:28:09] [INFO ] Invariant cache hit.
[2025-06-06 02:28:09] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:10] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 6 (OVERLAPS) 125/227 variables, 102/107 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 56/163 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 163 constraints, problems are : Problem set: 3 solved, 121 unsolved in 7151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 125/226 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 17/179 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 1/227 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 104/284 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 284 constraints, problems are : Problem set: 3 solved, 121 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 121/124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37224ms problems are : Problem set: 3 solved, 121 unsolved
Search for dead transitions found 3 dead transitions in 37225ms
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 SI_LTL mode, iteration 1 : 102/120 places, 122/149 transitions.
Graph (complete) has 324 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 99 /102 variables (removed 3) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 99 cols
[2025-06-06 02:28:46] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 02:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 02:28:46] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/120 places, 122/149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38106 ms. Remains : 99/120 places, 122/149 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLCardinality-11
Product exploration explored 100000 steps with 22458 reset in 232 ms.
Product exploration explored 100000 steps with 22512 reset in 165 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 322 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), false]
RANDOM walk for 40000 steps (9020 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4094 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125206 steps, run visited all 1 properties in 151 ms. (steps per millisecond=829 )
Probabilistic random walk after 125206 steps, saw 53394 distinct states, run finished after 167 ms. (steps per millisecond=749 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-06 02:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:49] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-06-06 02:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:28:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 02:28:49] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:28:49] [INFO ] Redundant transitions in 4 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-06 02:28:49] [INFO ] Invariant cache hit.
[2025-06-06 02:28:49] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:50] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/221 variables, 99/104 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:28:53] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/221 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 160 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/221 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 121/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/221 variables, and 281 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38059ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 38060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39158 ms. Remains : 99/99 places, 122/122 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 322 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), false]
RANDOM walk for 40000 steps (8958 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4154 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125206 steps, run visited all 1 properties in 195 ms. (steps per millisecond=642 )
Probabilistic random walk after 125206 steps, saw 53394 distinct states, run finished after 196 ms. (steps per millisecond=638 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 4 states, 8 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 22429 reset in 137 ms.
Product exploration explored 100000 steps with 22385 reset in 210 ms.
Built C files in :
/tmp/ltsmin16949891479434467757
[2025-06-06 02:29:29] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2025-06-06 02:29:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:29:29] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2025-06-06 02:29:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:29:29] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2025-06-06 02:29:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:29:29] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16949891479434467757
Running compilation step : cd /tmp/ltsmin16949891479434467757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin16949891479434467757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin16949891479434467757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15276512796008398511.hoa' '--buchi-type=spotba'
LTSmin run took 1744 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLCardinality-11 finished in 82584 ms.
All properties solved by simple procedures.
Total runtime 185408 ms.

BK_STOP 1749176971490

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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-d2m06"
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-d2m06, 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-174901994400459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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