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.r098-tall-177955695600518.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 DLCround-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695600518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 8.3K Mar 6 17:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 6 17:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 6 17:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 6 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 17:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 17:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K 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 DLCround-PT-03b-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-03b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779627933900

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 13:05:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 13:05:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:05:35] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2026-05-24 13:05:35] [INFO ] Transformed 1383 places.
[2026-05-24 13:05:35] [INFO ] Transformed 1887 transitions.
[2026-05-24 13:05:35] [INFO ] Found NUPN structural information;
[2026-05-24 13:05:35] [INFO ] Parsed PT model containing 1383 places and 1887 transitions and 4809 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1705 ms. (23 steps per ms) remains 4/15 properties
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 13:05:36] [INFO ] Flatten gal took : 293 ms
BEST_FIRST walk for 40004 steps (8 resets) in 856 ms. (46 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
[2026-05-24 13:05:36] [INFO ] Flatten gal took : 170 ms
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
[2026-05-24 13:05:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4670717090424764764.gal : 99 ms
[2026-05-24 13:05:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14538694102722454498.prop : 1 ms
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 4/4 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4670717090424764764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14538694102722454498.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13873550951007274650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7378795518280660281.kers'
[2026-05-24 13:05:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13873550951007274650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7378795518280660281.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1887 rows 1383 cols 4809 entries
Finished phase 1 with 1331 SingleSign rule and 0 generalized
[2026-05-24 13:05:36] [INFO ] Computed 52 invariants in 7 ms
Computed 52 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7378795518280660281.kers
Total runtime 9 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality14538694102722454498.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1285/1373 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1373 variables, 1285/1424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1373 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/1383 variables, 1/1425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 10/1435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 0/1435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 131
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :131 after 1339
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1339 after 2406
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2406 after 28185
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :28185 after 34645
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :34645 after 49101
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :49101 after 242081
At refinement iteration 8 (OVERLAPS) 1887/3270 variables, 1383/2818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :242081 after 9.00399e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/3270 variables, 0/2818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9.00399e+06 after 2.87294e+07
At refinement iteration 10 (OVERLAPS) 0/3270 variables, 0/2818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3270/3270 variables, and 2818 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2410 ms.
Refiners :[Domain max(s): 1383/1383 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 4/2 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/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem DLCround-PT-03b-ReachabilityCardinality-2024-04 is UNSAT
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1285/1373 variables, 51/139 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1373 variables, 1285/1424 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2.87294e+07 after 2.67656e+10
At refinement iteration 4 (INCLUDED_ONLY) 0/1373 variables, 0/1424 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/1383 variables, 1/1425 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1383 variables, 10/1435 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1383 variables, 0/1435 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1887/3270 variables, 1383/2818 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3270 variables, 1/2819 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :2.67656e+10 after 9.75169e+13
At refinement iteration 10 (INCLUDED_ONLY) 0/3270 variables, 0/2819 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3270 variables, 0/2819 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 3270/3270 variables, and 2819 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5013 ms.
Refiners :[Domain max(s): 1383/1383 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 1383/1383 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7552ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 85 out of 1383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1383/1383 places, 1887/1887 transitions.
Graph (trivial) has 1175 edges and 1383 vertex of which 131 / 1383 are part of one of the 18 SCC in 10 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 533 transitions
Trivial Post-agglo rules discarded 533 transitions
Performed 533 trivial Post agglomeration. Transition count delta: 533
Iterating post reduction 0 with 533 rules applied. Total rules applied 534 place count 1270 transition count 1222
Reduce places removed 533 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 563 rules applied. Total rules applied 1097 place count 737 transition count 1192
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 20 rules applied. Total rules applied 1117 place count 723 transition count 1186
Reduce places removed 2 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 3 with 49 rules applied. Total rules applied 1166 place count 721 transition count 1139
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 51 rules applied. Total rules applied 1217 place count 674 transition count 1135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1218 place count 673 transition count 1135
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 1218 place count 673 transition count 1103
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1282 place count 641 transition count 1103
SDD proceeding with computation,4 properties remain. new max is 65536
Discarding 106 places :
Symmetric choice reduction at 6 with 106 rule applications. Total rules 1388 place count 535 transition count 997
Iterating global reduction 6 with 106 rules applied. Total rules applied 1494 place count 535 transition count 997
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 1498 place count 535 transition count 993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1499 place count 534 transition count 993
SDD size :9.75169e+13 after 7.0649e+14
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 32 Pre rules applied. Total rules applied 1499 place count 534 transition count 961
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 1563 place count 502 transition count 961
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1574 place count 491 transition count 893
Iterating global reduction 8 with 11 rules applied. Total rules applied 1585 place count 491 transition count 893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1586 place count 491 transition count 892
Performed 113 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 9 with 226 rules applied. Total rules applied 1812 place count 378 transition count 778
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1816 place count 374 transition count 750
Iterating global reduction 9 with 4 rules applied. Total rules applied 1820 place count 374 transition count 750
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -306
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 9 with 98 rules applied. Total rules applied 1918 place count 325 transition count 1056
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 1969 place count 325 transition count 1005
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1975 place count 319 transition count 920
Iterating global reduction 10 with 6 rules applied. Total rules applied 1981 place count 319 transition count 920
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1985 place count 317 transition count 945
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1990 place count 317 transition count 940
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 2034 place count 317 transition count 896
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2037 place count 314 transition count 870
Iterating global reduction 11 with 3 rules applied. Total rules applied 2040 place count 314 transition count 870
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2042 place count 314 transition count 868
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2044 place count 313 transition count 880
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 2046 place count 313 transition count 878
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2047 place count 313 transition count 877
Free-agglomeration rule applied 56 times with reduction of 6 identical transitions.
Iterating global reduction 13 with 56 rules applied. Total rules applied 2103 place count 313 transition count 815
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 13 with 126 rules applied. Total rules applied 2229 place count 257 transition count 745
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 14 with 32 rules applied. Total rules applied 2261 place count 257 transition count 713
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 2266 place count 257 transition count 713
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2267 place count 257 transition count 713
Applied a total of 2267 rules in 417 ms. Remains 257 /1383 variables (removed 1126) and now considering 713/1887 (removed 1174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 257/1383 places, 713/1887 transitions.
RANDOM walk for 40000 steps (8 resets) in 538 ms. (74 steps per ms) remains 1/3 properties
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2026-05-24 13:05:44] [INFO ] Flow matrix only has 525 transitions (discarded 188 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10478469860091766193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17714466916747143297.kers'
[2026-05-24 13:05:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10478469860091766193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17714466916747143297.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 525 rows 251 cols 1724 entries
Finished phase 1 with 205 SingleSign rule and 0 generalized
[2026-05-24 13:05:44] [INFO ] Computed 52 invariants in 5 ms
Computed 52 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17714466916747143297.kers
Total runtime 6 ms.
[2026-05-24 13:05:44] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/238 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/251 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/257 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 525/782 variables, 257/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 93/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/782 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/238 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/251 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/257 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 525/782 variables, 257/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 93/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/782 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 782/782 variables, and 402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 522ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 42 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 713/713 transitions.
Graph (trivial) has 102 edges and 257 vertex of which 11 / 257 are part of one of the 4 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 250 transition count 691
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 239 transition count 689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 237 transition count 689
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 27 place count 237 transition count 677
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 51 place count 225 transition count 677
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 56 place count 225 transition count 672
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 59 place count 222 transition count 668
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 222 transition count 668
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 66 place count 222 transition count 664
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 94 place count 208 transition count 650
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 116 place count 208 transition count 628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 117 place count 207 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 207 transition count 618
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 146 place count 193 transition count 687
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 173 place count 193 transition count 660
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 174 place count 192 transition count 647
Iterating global reduction 7 with 1 rules applied. Total rules applied 175 place count 192 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 232 place count 192 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 233 place count 191 transition count 582
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 191 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 235 place count 191 transition count 581
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 245 place count 191 transition count 569
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 268 place count 181 transition count 556
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 271 place count 181 transition count 553
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 273 place count 181 transition count 553
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 274 place count 181 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 276 place count 180 transition count 551
Applied a total of 276 rules in 101 ms. Remains 180 /257 variables (removed 77) and now considering 551/713 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 180/257 places, 551/713 transitions.
RANDOM walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1018288 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 1
Probabilistic random walk after 1018288 steps, saw 837800 distinct states, run finished after 3007 ms. (steps per millisecond=338 ) properties seen :0
[2026-05-24 13:05:48] [INFO ] Flow matrix only has 373 transitions (discarded 178 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17787973551524546303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15611539875171007114.kers'
[2026-05-24 13:05:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17787973551524546303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15611539875171007114.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 6 ms.
// Phase 1: matrix 373 rows 169 cols 1462 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 13:05:48] [INFO ] Computed 52 invariants in 8 ms
Computed 52 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15611539875171007114.kers
Total runtime 10 ms.
[2026-05-24 13:05:48] [INFO ] State equation strengthened by 77 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/163 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/170 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/180 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 373/553 variables, 180/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 77/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/163 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/170 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/180 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 373/553 variables, 180/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 77/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 89 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=22 )
FORMULA DLCround-PT-03b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 14142 ms.

BK_STOP 1779627949668

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DLCround-PT-03b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DLCround-PT-03b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695600518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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