Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.6K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 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 RingSingleMessageInMbox-PT-d1m080-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749083514772

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 00:31:55] [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-05 00:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:31:56] [INFO ] Load time of PNML (sax parser for PT used): 457 ms
[2025-06-05 00:31:56] [INFO ] Transformed 6690 places.
[2025-06-05 00:31:56] [INFO ] Transformed 11934 transitions.
[2025-06-05 00:31:56] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 622 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 5 formulas.
Deduced a syphon composed of 4305 places in 25 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1105 places :
Symmetric choice reduction at 1 with 1105 rule applications. Total rules 1224 place count 1263 transition count 2423
Iterating global reduction 1 with 1105 rules applied. Total rules applied 2329 place count 1263 transition count 2423
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2401 place count 1263 transition count 2351
Discarding 937 places :
Symmetric choice reduction at 2 with 937 rule applications. Total rules 3338 place count 326 transition count 1414
Iterating global reduction 2 with 937 rules applied. Total rules applied 4275 place count 326 transition count 1414
Ensure Unique test removed 890 transitions
Reduce isomorphic transitions removed 890 transitions.
Iterating post reduction 2 with 890 rules applied. Total rules applied 5165 place count 326 transition count 524
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5295 place count 196 transition count 394
Iterating global reduction 3 with 130 rules applied. Total rules applied 5425 place count 196 transition count 394
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5523 place count 196 transition count 296
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5531 place count 188 transition count 288
Iterating global reduction 4 with 8 rules applied. Total rules applied 5539 place count 188 transition count 288
Applied a total of 5539 rules in 404 ms. Remains 188 /2385 variables (removed 2197) and now considering 288/11934 (removed 11646) transitions.
// Phase 1: matrix 288 rows 188 cols
[2025-06-05 00:31:57] [INFO ] Computed 3 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:31:57] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-06-05 00:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:31:57] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 00:31:59] [INFO ] Implicit Places using invariants and state equation in 1516 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-05 00:31:59] [INFO ] Invariant cache hit.
[2025-06-05 00:31:59] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
At refinement iteration 4 (OVERLAPS) 288/476 variables, 188/191 constraints. Problems are: Problem set: 24 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 111/302 constraints. Problems are: Problem set: 24 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:09] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 8 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:10] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 3 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:10] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 5 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 5/307 constraints. Problems are: Problem set: 45 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:22] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:22] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 2/309 constraints. Problems are: Problem set: 45 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 309 constraints, problems are : Problem set: 45 solved, 242 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 26/172 variables, 2/2 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/4 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 16/188 variables, 1/5 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 5/10 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 288/476 variables, 188/198 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 111/309 constraints. Problems are: Problem set: 45 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 242/551 constraints. Problems are: Problem set: 45 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:57] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 552 constraints, problems are : Problem set: 45 solved, 242 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 242/287 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 45 solved, 242 unsolved
Search for dead transitions found 45 dead transitions in 60466ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/2385 places, 243/11934 transitions.
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 147 transition count 226
Applied a total of 58 rules in 2 ms. Remains 147 /188 variables (removed 41) and now considering 226/243 (removed 17) transitions.
// Phase 1: matrix 226 rows 147 cols
[2025-06-05 00:32:59] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:32:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-05 00:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:32:59] [INFO ] State equation strengthened by 103 read => feed constraints.
[2025-06-05 00:33:00] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/2385 places, 226/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63708 ms. Remains : 147/2385 places, 226/11934 transitions.
Support contains 6 out of 147 places after structural reductions.
[2025-06-05 00:33:00] [INFO ] Flatten gal took : 36 ms
[2025-06-05 00:33:00] [INFO ] Flatten gal took : 16 ms
[2025-06-05 00:33:00] [INFO ] Input system was already deterministic with 226 transitions.
RANDOM walk for 40000 steps (7270 resets) in 2407 ms. (16 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (2057 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2092 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2025-06-05 00:33:01] [INFO ] Invariant cache hit.
[2025-06-05 00:33:01] [INFO ] State equation strengthened by 103 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 156/162 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 58/220 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/224 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 373/373 variables, and 180 constraints, problems are : Problem set: 2 solved, 0 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 31/103 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 58 stable transitions
Graph (complete) has 530 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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(F(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 143 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 143 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 143 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 141 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 141 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 141 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 140 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 140 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 139 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 139 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 135 transition count 186
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 135 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 135 transition count 178
Applied a total of 36 rules in 30 ms. Remains 135 /147 variables (removed 12) and now considering 178/226 (removed 48) transitions.
// Phase 1: matrix 178 rows 135 cols
[2025-06-05 00:33:01] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:01] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-05 00:33:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:01] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-05 00:33:02] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:33:02] [INFO ] Redundant transitions in 8 ms returned []
Running 177 sub problems to find dead transitions.
[2025-06-05 00:33:02] [INFO ] Invariant cache hit.
[2025-06-05 00:33:02] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Problem TDEAD145 is UNSAT
At refinement iteration 4 (OVERLAPS) 178/313 variables, 135/137 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 65/202 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 202 constraints, problems are : Problem set: 1 solved, 176 unsolved in 13267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 178/312 variables, 134/136 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 65/201 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 39/240 constraints. Problems are: Problem set: 1 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:20] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/241 constraints. Problems are: Problem set: 1 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:26] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:26] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:26] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:26] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 4/245 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 137/383 constraints. Problems are: Problem set: 1 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 383 constraints, problems are : Problem set: 1 solved, 176 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 176/177 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43381ms problems are : Problem set: 1 solved, 176 unsolved
Search for dead transitions found 1 dead transitions in 43382ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/147 places, 177/226 transitions.
Graph (complete) has 458 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 176
Applied a total of 2 rules in 13 ms. Remains 134 /135 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 134 cols
[2025-06-05 00:33:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:46] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-05 00:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-05 00:33:46] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 134/147 places, 176/226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44664 ms. Remains : 134/147 places, 176/226 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLCardinality-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLCardinality-01 finished in 44898 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' '!(F(p0))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 226/226 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 142 transition count 221
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 142 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 142 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 140 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 140 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 140 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 138 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 138 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 137 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 137 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 137 transition count 186
Applied a total of 26 rules in 25 ms. Remains 137 /147 variables (removed 10) and now considering 186/226 (removed 40) transitions.
// Phase 1: matrix 186 rows 137 cols
[2025-06-05 00:33:46] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:46] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 00:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:46] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-05 00:33:47] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:33:47] [INFO ] Redundant transitions in 8 ms returned []
Running 185 sub problems to find dead transitions.
[2025-06-05 00:33:47] [INFO ] Invariant cache hit.
[2025-06-05 00:33:47] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Problem TDEAD153 is UNSAT
At refinement iteration 4 (OVERLAPS) 186/323 variables, 137/139 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 71/210 constraints. Problems are: Problem set: 1 solved, 184 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 210 constraints, problems are : Problem set: 1 solved, 184 unsolved in 10210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 186/322 variables, 136/138 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/209 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 39/248 constraints. Problems are: Problem set: 1 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:03] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/249 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/250 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 145/395 constraints. Problems are: Problem set: 1 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/323 variables, and 395 constraints, problems are : Problem set: 1 solved, 184 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40313ms problems are : Problem set: 1 solved, 184 unsolved
Search for dead transitions found 1 dead transitions in 40318ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 137/147 places, 185/226 transitions.
Graph (complete) has 470 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 184
Applied a total of 2 rules in 9 ms. Remains 136 /137 variables (removed 1) and now considering 184/185 (removed 1) transitions.
// Phase 1: matrix 184 rows 136 cols
[2025-06-05 00:34:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:34:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-05 00:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:34:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-05 00:34:28] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 136/147 places, 184/226 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41667 ms. Remains : 136/147 places, 184/226 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLCardinality-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLCardinality-09 finished in 41709 ms.
All properties solved by simple procedures.
Total runtime 152408 ms.

BK_STOP 1749083668369

--------------------
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="RingSingleMessageInMbox-PT-d1m080"
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 RingSingleMessageInMbox-PT-d1m080, 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 r184-tall-174889264200443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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