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.r082-smll-177946993700327.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 DES-PT-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 6 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:55 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 68K 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 DES-PT-01b-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-01b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779653013216

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 20:03:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 20:03:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:03:36] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2026-05-24 20:03:36] [INFO ] Transformed 284 places.
[2026-05-24 20:03:36] [INFO ] Transformed 235 transitions.
[2026-05-24 20:03:36] [INFO ] Found NUPN structural information;
[2026-05-24 20:03:36] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2026-05-24 20:03:37] [INFO ] Flatten gal took : 136 ms
RANDOM walk for 40000 steps (395 resets) in 2754 ms. (14 steps per ms) remains 6/16 properties
FORMULA DES-PT-01b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 20:03:37] [INFO ] Flatten gal took : 91 ms
[2026-05-24 20:03:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15313440375035611990.gal : 46 ms
BEST_FIRST walk for 40004 steps (66 resets) in 821 ms. (48 steps per ms) remains 5/6 properties
FORMULA DES-PT-01b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 20:03:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3691417447395453471.prop : 24 ms
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/ReachabilityCardinality15313440375035611990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3691417447395453471.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
BEST_FIRST walk for 40004 steps (61 resets) in 642 ms. (62 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality3691417447395453471.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
BEST_FIRST walk for 40001 steps (66 resets) in 586 ms. (68 steps per ms) remains 5/5 properties
SDD size :5 after 25
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :25 after 33
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :33 after 109
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :109 after 3109
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3109 after 108309
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :108309 after 631329
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :631329 after 2.5947e+06
BEST_FIRST walk for 40004 steps (72 resets) in 487 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (59 resets) in 582 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (58 resets) in 280 ms. (142 steps per ms) remains 4/5 properties
FORMULA DES-PT-01b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18400766335345924240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6567099806413436447.kers'
[2026-05-24 20:03:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18400766335345924240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6567099806413436447.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 284 cols 683 entries
Finished phase 1 with 171 SingleSign rule and 48 generalized
[2026-05-24 20:03:38] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6567099806413436447.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 124/259 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 124/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 12/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem DES-PT-01b-ReachabilityFireability-2024-08 is UNSAT
FORMULA DES-PT-01b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 25/284 variables, 12/324 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 25/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/349 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 235/519 variables, 284/633 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/633 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/519 variables, 0/633 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 633 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1962 ms.
Refiners :[Domain max(s): 284/284 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 132/259 variables, 41/168 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 132/300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 12/312 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 3/315 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 25/284 variables, 12/327 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 25/352 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 13/365 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/366 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/366 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 7226ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 127 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 235/235 transitions.
Graph (complete) has 513 edges and 284 vertex of which 277 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 277 transition count 225
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 273 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 270 transition count 222
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 17 place count 270 transition count 218
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 266 transition count 218
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 37 place count 254 transition count 206
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 254 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 251 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 251 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 251 transition count 202
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 88 place count 235 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 234 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 234 transition count 185
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 234 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 233 transition count 184
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 233 transition count 184
Applied a total of 95 rules in 256 ms. Remains 233 /284 variables (removed 51) and now considering 184/235 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 233/284 places, 184/235 transitions.
RANDOM walk for 40000 steps (461 resets) in 1005 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (78 resets) in 376 ms. (106 steps per ms) remains 2/3 properties
FORMULA DES-PT-01b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (82 resets) in 313 ms. (127 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9058516189290471172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7455359695154601274.kers'
[2026-05-24 20:03:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9058516189290471172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7455359695154601274.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 233 cols 582 entries
Finished phase 1 with 120 SingleSign rule and 49 generalized
[2026-05-24 20:03:46] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7455359695154601274.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/194 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 37/231 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/233 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 184/417 variables, 233/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/417 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 297 constraints, problems are : Problem set: 0 solved, 2 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/194 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/231 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/233 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 184/417 variables, 233/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/417 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2243ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA DES-PT-01b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 140 ms.
Support contains 54 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 184/184 transitions.
Graph (complete) has 457 edges and 233 vertex of which 229 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 229 transition count 179
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 225 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 223 transition count 177
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 13 place count 223 transition count 172
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 23 place count 218 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 27 place count 214 transition count 168
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 214 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 214 transition count 167
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 211 transition count 163
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 211 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 41 place count 211 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 121 place count 171 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 170 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 170 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 170 transition count 118
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 130 place count 167 transition count 131
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 167 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 134 place count 165 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 135 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 136 place count 164 transition count 127
Applied a total of 136 rules in 85 ms. Remains 164 /233 variables (removed 69) and now considering 127/184 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 164/233 places, 127/184 transitions.
RANDOM walk for 40000 steps (1018 resets) in 612 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (210 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1270248 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1270248 steps, saw 195394 distinct states, run finished after 3009 ms. (steps per millisecond=422 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-79044659580010794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1313234157346788923.kers'
[2026-05-24 20:03:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-79044659580010794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1313234157346788923.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 164 cols 567 entries
Finished phase 1 with 49 SingleSign rule and 54 generalized
[2026-05-24 20:03:52] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1313234157346788923.kers
Total runtime 1 ms.
[2026-05-24 20:03:52] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/129 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 34/163 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 127/290 variables, 163/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/291 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 244 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, ReadFeed: 19/19 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/129 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 34/163 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 127/290 variables, 163/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/291 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 245 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 54 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 127/127 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 164/164 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 127/127 transitions.
Applied a total of 0 rules in 8 ms. Remains 164 /164 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2026-05-24 20:03:53] [INFO ] Invariant cache hit.
[2026-05-24 20:03:53] [INFO ] Implicit Places using invariants in 153 ms returned [32, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 162/164 places, 127/127 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 127
Applied a total of 1 rules in 14 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (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-6420746815019037259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3602156659460587718.kers'
[2026-05-24 20:03:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6420746815019037259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3602156659460587718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 162 cols 567 entries
Finished phase 1 with 48 SingleSign rule and 55 generalized
[2026-05-24 20:03:53] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3602156659460587718.kers
Total runtime 2 ms.
[2026-05-24 20:03:53] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-24 20:03:53] [INFO ] Invariant cache hit.
[2026-05-24 20:03:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-24 20:03:53] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [58, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 380 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 160/164 places, 127/127 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 126
Applied a total of 2 rules in 13 ms. Remains 159 /160 variables (removed 1) and now considering 126/127 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16037039901136362539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16536982748512697483.kers'
[2026-05-24 20:03:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16037039901136362539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16536982748512697483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 159 cols 558 entries
Finished phase 1 with 50 SingleSign rule and 52 generalized
[2026-05-24 20:03:53] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16536982748512697483.kers
Total runtime 2 ms.
[2026-05-24 20:03:53] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 20:03:53] [INFO ] Invariant cache hit.
[2026-05-24 20:03:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-24 20:03:54] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 159/164 places, 126/127 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 949 ms. Remains : 159/164 places, 126/127 transitions.
RANDOM walk for 40000 steps (1039 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32947 steps (162 resets) in 210 ms. (156 steps per ms) remains 0/1 properties
FORMULA DES-PT-01b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 18597 ms.

BK_STOP 1779653034418

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

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