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-177946993700303.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-00a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.0K Mar 6 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 18:26 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.8K Mar 15 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 6 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 6 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:54 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 31K 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-00a-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-00a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779644053213

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-00a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 17:34:15] [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 17:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 17:34:15] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-24 17:34:15] [INFO ] Transformed 115 places.
[2026-05-24 17:34:15] [INFO ] Transformed 76 transitions.
[2026-05-24 17:34:15] [INFO ] Found NUPN structural information;
[2026-05-24 17:34:15] [INFO ] Parsed PT model containing 115 places and 76 transitions and 373 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
[2026-05-24 17:34:16] [INFO ] Flatten gal took : 69 ms
RANDOM walk for 40000 steps (902 resets) in 2262 ms. (17 steps per ms) remains 3/16 properties
FORMULA DES-PT-00a-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 17:34:16] [INFO ] Flatten gal took : 27 ms
[2026-05-24 17:34:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10035913371126053795.gal : 27 ms
[2026-05-24 17:34:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality406217110211860372.prop : 10 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/ReachabilityCardinality10035913371126053795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality406217110211860372.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 ...328
Loading property file /tmp/ReachabilityCardinality406217110211860372.prop.
BEST_FIRST walk for 40002 steps (239 resets) in 950 ms. (42 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 21
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :21 after 113
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :113 after 163
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :163 after 1229
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1229 after 1875
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1875 after 6885
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :6885 after 9693
BEST_FIRST walk for 40004 steps (255 resets) in 878 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (284 resets) in 1255 ms. (31 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :9693 after 43683
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15805655614026510560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15583091165884819511.kers'
[2026-05-24 17:34:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15805655614026510560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15583091165884819511.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 114 cols 306 entries
Finished phase 1 with 20 SingleSign rule and 38 generalized
[2026-05-24 17:34:17] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15583091165884819511.kers
Total runtime 1 ms.
[2026-05-24 17:34:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem DES-PT-00a-ReachabilityFireability-2024-00 is UNSAT
FORMULA DES-PT-00a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 24/122 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 10/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem DES-PT-00a-ReachabilityFireability-2024-07 is UNSAT
FORMULA DES-PT-00a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 14/112 variables, 13/145 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 14/159 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 7/166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/115 variables, 3/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 3/172 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/177 variables, 115/287 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/288 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/177 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 288 constraints, problems are : Problem set: 2 solved, 1 unsolved in 733 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 19/58 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 27/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/101 variables, 18/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 36/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 7/146 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/113 variables, 12/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 12/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/171 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 61/174 variables, 113/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 1/285 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/177 variables, 2/287 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 2/289 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 1/290 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/177 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 290 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1202 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2169ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 38 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 62/62 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 113 transition count 59
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 113 transition count 59
Applied a total of 6 rules in 88 ms. Remains 113 /115 variables (removed 2) and now considering 59/62 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 113/115 places, 59/62 transitions.
RANDOM walk for 40000 steps (823 resets) in 1090 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (218 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1687861 steps, run timeout after 3001 ms. (steps per millisecond=562 ) properties seen :0 out of 1
Probabilistic random walk after 1687861 steps, saw 217669 distinct states, run finished after 3010 ms. (steps per millisecond=560 ) 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-14951810233051399727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5879394621255448221.kers'
[2026-05-24 17:34:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14951810233051399727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5879394621255448221.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 59 rows 112 cols 304 entries
Finished phase 1 with 17 SingleSign rule and 38 generalized
[2026-05-24 17:34:23] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5879394621255448221.kers
Total runtime 1 ms.
[2026-05-24 17:34:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 27/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/100 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 35/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/113 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 13/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/172 variables, 113/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/172 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 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/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 27/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/100 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 35/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/113 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 13/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 59/172 variables, 113/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/172 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 38 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 59/59 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 113/113 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 59/59 transitions.
Applied a total of 0 rules in 8 ms. Remains 113 /113 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2026-05-24 17:34:24] [INFO ] Invariant cache hit.
[2026-05-24 17:34:24] [INFO ] Implicit Places using invariants in 236 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 255 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/113 places, 59/59 transitions.
Applied a total of 0 rules in 18 ms. Remains 112 /112 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 282 ms. Remains : 112/113 places, 59/59 transitions.
RANDOM walk for 40000 steps (851 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (224 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1870083 steps, run timeout after 3001 ms. (steps per millisecond=623 ) properties seen :0 out of 1
Probabilistic random walk after 1870083 steps, saw 239013 distinct states, run finished after 3001 ms. (steps per millisecond=623 ) 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-8200268352817910472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16897169655739609936.kers'
[2026-05-24 17:34:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8200268352817910472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16897169655739609936.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 112 cols 304 entries
Finished phase 1 with 17 SingleSign rule and 38 generalized
[2026-05-24 17:34:27] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16897169655739609936.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 27/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/99 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 34/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/112 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/171 variables, 112/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/171 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 1/1 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/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 27/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/99 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 34/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/112 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 59/171 variables, 112/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/171 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/171 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 581 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 38 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 59/59 transitions.
Applied a total of 0 rules in 11 ms. Remains 112 /112 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 112/112 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 59/59 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2026-05-24 17:34:28] [INFO ] Invariant cache hit.
[2026-05-24 17:34:28] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-24 17:34:28] [INFO ] Invariant cache hit.
[2026-05-24 17:34:28] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2026-05-24 17:34:28] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-24 17:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 17/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 37/165 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 59/171 variables, 112/284 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 284 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3177 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 17/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 37/165 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 59/171 variables, 112/284 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 58/342 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/171 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 344 constraints, problems are : Problem set: 0 solved, 58 unsolved in 15961 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19159ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 19161ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19586 ms. Remains : 112/112 places, 59/59 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 17:34:48] [INFO ] Flatten gal took : 17 ms
[2026-05-24 17:34:48] [INFO ] Applying decomposition
[2026-05-24 17:34:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10927713517043541127.txt' '-o' '/tmp/graph10927713517043541127.bin' '-w' '/tmp/graph10927713517043541127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10927713517043541127.bin' '-l' '-1' '-v' '-w' '/tmp/graph10927713517043541127.weights' '-q' '0' '-e' '0.001'
[2026-05-24 17:34:48] [INFO ] Decomposing Gal with order
[2026-05-24 17:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 17:34:48] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-24 17:34:48] [INFO ] Flatten gal took : 91 ms
[2026-05-24 17:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2026-05-24 17:34:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15079821910030200078.gal : 8 ms
[2026-05-24 17:34:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4544231690701798249.prop : 1 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/ReachabilityCardinality15079821910030200078.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4544231690701798249.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality4544231690701798249.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 657
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :657 after 13695
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.4197e+10,0.271519,11548,494,46,15679,195,330,24156,60,374,0
Total reachable state count : 24196956529

Verifying 1 reachability properties.
Invariant property DES-PT-00a-ReachabilityFireability-2024-02 does not hold.
FORMULA DES-PT-00a-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-00a-ReachabilityFireability-2024-02,4.3465e+06,0.284114,11720,85,24,15679,195,433,24156,67,374,1807
All properties solved without resorting to model-checking.
Total runtime 33378 ms.

BK_STOP 1779644088833

--------------------
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-00a"
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-00a, 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-177946993700303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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