Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CO4-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 177K Mar 3 18:30 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 CO4-PT-12-LTLCardinality-00
FORMULA_NAME CO4-PT-12-LTLCardinality-01
FORMULA_NAME CO4-PT-12-LTLCardinality-02
FORMULA_NAME CO4-PT-12-LTLCardinality-03
FORMULA_NAME CO4-PT-12-LTLCardinality-04
FORMULA_NAME CO4-PT-12-LTLCardinality-05
FORMULA_NAME CO4-PT-12-LTLCardinality-06
FORMULA_NAME CO4-PT-12-LTLCardinality-07
FORMULA_NAME CO4-PT-12-LTLCardinality-08
FORMULA_NAME CO4-PT-12-LTLCardinality-09
FORMULA_NAME CO4-PT-12-LTLCardinality-10
FORMULA_NAME CO4-PT-12-LTLCardinality-11
FORMULA_NAME CO4-PT-12-LTLCardinality-12
FORMULA_NAME CO4-PT-12-LTLCardinality-13
FORMULA_NAME CO4-PT-12-LTLCardinality-14
FORMULA_NAME CO4-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779522920206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 07:55:21] [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]
[2026-05-23 07:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:55:21] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-23 07:55:21] [INFO ] Transformed 649 places.
[2026-05-23 07:55:21] [INFO ] Transformed 782 transitions.
[2026-05-23 07:55:21] [INFO ] Found NUPN structural information;
[2026-05-23 07:55:21] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-12-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 104 place count 377 transition count 473
Iterating global reduction 1 with 84 rules applied. Total rules applied 188 place count 377 transition count 473
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 256 place count 309 transition count 387
Iterating global reduction 1 with 68 rules applied. Total rules applied 324 place count 309 transition count 387
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 329 place count 309 transition count 382
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 361 place count 277 transition count 350
Iterating global reduction 2 with 32 rules applied. Total rules applied 393 place count 277 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 395 place count 277 transition count 348
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 414 place count 258 transition count 329
Iterating global reduction 3 with 19 rules applied. Total rules applied 433 place count 258 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 437 place count 258 transition count 325
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 443 place count 252 transition count 319
Iterating global reduction 4 with 6 rules applied. Total rules applied 449 place count 252 transition count 319
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 451 place count 250 transition count 317
Iterating global reduction 4 with 2 rules applied. Total rules applied 453 place count 250 transition count 317
Applied a total of 453 rules in 130 ms. Remains 250 /477 variables (removed 227) and now considering 317/563 (removed 246) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5101799221624229914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13164409430690276646.kers'
[2026-05-23 07:55:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5101799221624229914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13164409430690276646.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 250 cols 752 entries
Finished phase 1 with 244 SingleSign rule and 0 generalized
[2026-05-23 07:55:21] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13164409430690276646.kers
Total runtime 2 ms.
[2026-05-23 07:55:22] [INFO ] Implicit Places using invariants in 243 ms returned [6, 176]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 276 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 248/477 places, 317/563 transitions.
Applied a total of 0 rules in 11 ms. Remains 248 /248 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 432 ms. Remains : 248/477 places, 317/563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 317/317 transitions.
Applied a total of 0 rules in 4 ms. Remains 248 /248 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17334104298189789048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8622527530483144965.kers'
[2026-05-23 07:55:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17334104298189789048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8622527530483144965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 248 cols 736 entries
Finished phase 1 with 244 SingleSign rule and 0 generalized
[2026-05-23 07:55:22] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8622527530483144965.kers
Total runtime 1 ms.
[2026-05-23 07:55:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 07:55:22] [INFO ] Invariant cache hit.
[2026-05-23 07:55:22] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-23 07:55:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/565 variables, 248/254 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 254 constraints, problems are : Problem set: 0 solved, 316 unsolved in 21952 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 317/565 variables, 248/255 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 316/571 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 574 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52062ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 52073ms
Finished structural reductions in LTL mode , in 1 iterations and 52352 ms. Remains : 248/248 places, 317/317 transitions.
Support contains 8 out of 248 places after structural reductions.
[2026-05-23 07:56:14] [INFO ] Flatten gal took : 45 ms
[2026-05-23 07:56:14] [INFO ] Flatten gal took : 22 ms
[2026-05-23 07:56:14] [INFO ] Input system was already deterministic with 317 transitions.
RANDOM walk for 40000 steps (266 resets) in 750 ms. (53 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (138 resets) in 619 ms. (64 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (176 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (248 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (176 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
[2026-05-23 07:56:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/80 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/91 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 17/108 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 199/307 variables, 92/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 183/490 variables, 88/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 63/553 variables, 42/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 7/560 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/564 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/565 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/565 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/565 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 252 constraints, problems are : Problem set: 0 solved, 4 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/80 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 17/108 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 199/307 variables, 92/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 183/490 variables, 88/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 63/553 variables, 42/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/553 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 7/560 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 4/564 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1/565 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/565 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/565 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 257 constraints, problems are : Problem set: 0 solved, 4 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1260ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 187 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=187 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 56 ms.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 423 edges and 248 vertex of which 243 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(G(F(!p1))||(F(!p1)&&F(p2))))))'
Support contains 3 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 317/317 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 246 transition count 315
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 246 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 244 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 244 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 242 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 242 transition count 310
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 242 transition count 309
Applied a total of 14 rules in 18 ms. Remains 242 /248 variables (removed 6) and now considering 309/317 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5048731798665455309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3036629905106775064.kers'
[2026-05-23 07:56:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5048731798665455309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3036629905106775064.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 242 cols 720 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-23 07:56:16] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3036629905106775064.kers
Total runtime 1 ms.
[2026-05-23 07:56:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 07:56:17] [INFO ] Invariant cache hit.
[2026-05-23 07:56:17] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-23 07:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/551 variables, 242/249 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 249 constraints, problems are : Problem set: 0 solved, 308 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/551 variables, 242/249 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 308/557 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 559 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50069ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 50084ms
Starting structural reductions in LTL mode, iteration 1 : 242/248 places, 309/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50339 ms. Remains : 242/248 places, 309/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(G(F(p1))||(F(p1)&&F(p2))))))'
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-12-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CO4-PT-12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLCardinality-03 finished in 50811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 317/317 transitions.
Graph (trivial) has 260 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 421 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 240 transition count 213
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 192 place count 145 transition count 213
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 192 place count 145 transition count 191
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 236 place count 123 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 237 place count 122 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 122 transition count 190
Performed 49 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 336 place count 73 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 340 place count 73 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 344 place count 69 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 348 place count 69 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 350 place count 68 transition count 116
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 378 place count 54 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 387 place count 54 transition count 110
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 398 place count 43 transition count 88
Iterating global reduction 4 with 11 rules applied. Total rules applied 409 place count 43 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 417 place count 43 transition count 80
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 420 place count 40 transition count 71
Iterating global reduction 5 with 3 rules applied. Total rules applied 423 place count 40 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 425 place count 40 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 427 place count 39 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 436 place count 39 transition count 66
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 39 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 439 place count 37 transition count 64
Applied a total of 439 rules in 54 ms. Remains 37 /248 variables (removed 211) and now considering 64/317 (removed 253) transitions.
[2026-05-23 07:57:07] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14173344496906440479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8371705370895075485.kers'
[2026-05-23 07:57:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14173344496906440479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8371705370895075485.kers]
Normalized transition count is 59 out of 60 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 37 cols 188 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-23 07:57:07] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8371705370895075485.kers
Total runtime 0 ms.
[2026-05-23 07:57:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 07:57:07] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-23 07:57:07] [INFO ] Invariant cache hit.
[2026-05-23 07:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:57:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-23 07:57:07] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-23 07:57:07] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-23 07:57:07] [INFO ] Invariant cache hit.
[2026-05-23 07:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 59/95 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 1/96 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/97 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 42 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 59/95 variables, 36/40 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 53/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 1/96 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 95 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2837ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/248 places, 64/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2984 ms. Remains : 37/248 places, 64/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLCardinality-08
Product exploration explored 100000 steps with 72 reset in 147 ms.
Product exploration explored 100000 steps with 81 reset in 64 ms.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 283 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2026-05-23 07:57:11] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-23 07:57:11] [INFO ] Invariant cache hit.
[2026-05-23 07:57:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 07:57:11] [INFO ] Flow matrix only has 60 transitions (discarded 4 similar events)
[2026-05-23 07:57:11] [INFO ] Invariant cache hit.
[2026-05-23 07:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:57:11] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2026-05-23 07:57:11] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 37/37 places, 64/64 transitions.
Computed a total of 9 stabilizing places and 13 stable transitions
Computed a total of 9 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 299 ms.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 211 reset in 44 ms.
Stuttering criterion allowed to conclude after 1406 steps with 175 reset in 2 ms.
FORMULA CO4-PT-12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLCardinality-08 finished in 4284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 248 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 248/248 places, 317/317 transitions.
Graph (trivial) has 261 edges and 248 vertex of which 3 / 248 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 421 edges and 246 vertex of which 241 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 240 transition count 212
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 194 place count 144 transition count 212
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 194 place count 144 transition count 191
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 236 place count 123 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 237 place count 122 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 122 transition count 190
Performed 48 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 334 place count 74 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 338 place count 74 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 70 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 70 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 348 place count 69 transition count 117
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 378 place count 54 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 387 place count 54 transition count 112
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 398 place count 43 transition count 90
Iterating global reduction 4 with 11 rules applied. Total rules applied 409 place count 43 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 417 place count 43 transition count 82
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 420 place count 40 transition count 73
Iterating global reduction 5 with 3 rules applied. Total rules applied 423 place count 40 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 424 place count 40 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 426 place count 39 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 437 place count 39 transition count 68
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 438 place count 39 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 37 transition count 66
Applied a total of 440 rules in 38 ms. Remains 37 /248 variables (removed 211) and now considering 66/317 (removed 251) transitions.
[2026-05-23 07:57:12] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1252949096021587908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14161652639077309901.kers'
[2026-05-23 07:57:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1252949096021587908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14161652639077309901.kers]
Normalized transition count is 61 out of 62 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 37 cols 196 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-23 07:57:12] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14161652639077309901.kers
Total runtime 0 ms.
[2026-05-23 07:57:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 07:57:12] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2026-05-23 07:57:12] [INFO ] Invariant cache hit.
[2026-05-23 07:57:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:57:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2026-05-23 07:57:12] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2026-05-23 07:57:12] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2026-05-23 07:57:12] [INFO ] Invariant cache hit.
[2026-05-23 07:57:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 61/98 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 42 constraints, problems are : Problem set: 0 solved, 51 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 61/98 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 51/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 93 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2475ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2477ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/248 places, 66/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2602 ms. Remains : 37/248 places, 66/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLCardinality-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLCardinality-10 finished in 2685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 317/317 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 244 transition count 313
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 244 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 244 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 240 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 240 transition count 308
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 237 transition count 305
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 237 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 237 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 236 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 236 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 236 transition count 302
Applied a total of 27 rules in 18 ms. Remains 236 /248 variables (removed 12) and now considering 302/317 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6365379335125811004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15941072442035911403.kers'
[2026-05-23 07:57:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6365379335125811004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15941072442035911403.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 236 cols 704 entries
Finished phase 1 with 232 SingleSign rule and 0 generalized
[2026-05-23 07:57:14] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15941072442035911403.kers
Total runtime 1 ms.
[2026-05-23 07:57:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 07:57:14] [INFO ] Invariant cache hit.
[2026-05-23 07:57:14] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2026-05-23 07:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/538 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 0/538 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 242 constraints, problems are : Problem set: 0 solved, 301 unsolved in 18967 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/538 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 301/543 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 544 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49013ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 49014ms
Starting structural reductions in LTL mode, iteration 1 : 236/248 places, 302/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49230 ms. Remains : 236/248 places, 302/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-12-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CO4-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-12-LTLCardinality-11 finished in 49521 ms.
All properties solved by simple procedures.
Total runtime 162884 ms.

BK_STOP 1779523084266

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="CO4-PT-12"
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-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-12, 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 r066-tall-177946967700371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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