fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499100095
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV1-PT-bP06C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
889.432 40953.00 113164.00 179.50 TTFTFFFTTFTTFTFF normal

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.r338-smll-178021499100095.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 ErlangenMainframeV1-PT-bP06C06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.1K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.4K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.8M May 26 18:17 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 ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780270047112

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-31 23:27:29] [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-31 23:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 23:27:30] [INFO ] Load time of PNML (sax parser for PT used): 682 ms
[2026-05-31 23:27:30] [INFO ] Transformed 273 places.
[2026-05-31 23:27:30] [INFO ] Transformed 2487 transitions.
[2026-05-31 23:27:30] [INFO ] Found NUPN structural information;
[2026-05-31 23:27:30] [INFO ] Parsed PT model containing 273 places and 2487 transitions and 34329 arcs in 941 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 8899 ms. (4 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 816 ms. (4 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 16/16 properties
[2026-05-31 23:27:33] [INFO ] Flatten gal took : 1721 ms
BEST_FIRST walk for 4003 steps (8 resets) in 284 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 250 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 271 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 206 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 233 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 557 ms. (7 steps per ms) remains 16/16 properties
[2026-05-31 23:27:34] [INFO ] Flatten gal took : 628 ms
[2026-05-31 23:27:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9538805989827356989.gal : 327 ms
[2026-05-31 23:27:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13899875871053963868.prop : 21 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/ReachabilityCardinality9538805989827356989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13899875871053963868.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
Loading property file /tmp/ReachabilityCardinality13899875871053963868.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :5 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 58
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :58 after 1524
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1524 after 2186
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :2186 after 2221
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :2221 after 2291
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :2291 after 4980
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :4980 after 27886
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :27886 after 1.37911e+07
Reachability property ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-10 is true.
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 822786 steps, run timeout after 9001 ms. (steps per millisecond=91 ) properties seen :0 out of 16
Probabilistic random walk after 822786 steps, saw 122690 distinct states, run finished after 9011 ms. (steps per millisecond=91 ) 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-5089933318670997899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4939289521340532111.kers'
[2026-05-31 23:27:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5089933318670997899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4939289521340532111.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2487 rows 273 cols 34329 entries
Finished phase 1 with 252 SingleSign rule and 3 generalized
[2026-05-31 23:27:43] [INFO ] Computed 18 invariants in 23 ms
Computed 18 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-4939289521340532111.kers
Total runtime 31 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :1.37911e+07 after 8.7708e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-04 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 5/78 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-02 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-06 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-09 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-14 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 199/272 variables, 12/90 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 199/289 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/289 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/273 variables, 1/290 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/291 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/291 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2487/2760 variables, 273/564 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2760 variables, 0/564 constraints. Problems are: Problem set: 5 solved, 10 unsolved
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :8.7708e+07 after 9.43977e+07
At refinement iteration 11 (OVERLAPS) 0/2760 variables, 0/564 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2760/2760 variables, and 564 constraints, problems are : Problem set: 5 solved, 10 unsolved in 3347 ms.
Refiners :[Domain max(s): 273/273 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 5/51 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/51 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 211/257 variables, 11/62 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 211/273 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/273 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 15/272 variables, 1/274 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 15/289 constraints. Problems are: Problem set: 5 solved, 10 unsolved
SMT process timed out in 9669ms, After SMT, problems are : Problem set: 5 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 46 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 2487/2487 transitions.
Graph (trivial) has 208 edges and 273 vertex of which 8 / 273 are part of one of the 3 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 268 transition count 2372
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 118 rules applied. Total rules applied 225 place count 162 transition count 2360
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 229 place count 159 transition count 2359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 158 transition count 2359
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 230 place count 158 transition count 2355
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 238 place count 154 transition count 2355
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 269 place count 123 transition count 2324
Iterating global reduction 4 with 31 rules applied. Total rules applied 300 place count 123 transition count 2324
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 300 place count 123 transition count 2319
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 310 place count 118 transition count 2319
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 316 place count 112 transition count 2293
Iterating global reduction 4 with 6 rules applied. Total rules applied 322 place count 112 transition count 2293
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 356 place count 95 transition count 2276
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 370 place count 88 transition count 2302
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 382 place count 88 transition count 2290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 383 place count 87 transition count 2288
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 87 transition count 2288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 390 place count 87 transition count 2282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 392 place count 87 transition count 2280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 86 transition count 2290
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 396 place count 86 transition count 2288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 398 place count 84 transition count 2288
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 399 place count 84 transition count 2287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 84 transition count 2297
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 403 place count 83 transition count 2295
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 414 place count 83 transition count 2284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 83 transition count 2284
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 420 place count 83 transition count 2284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 82 transition count 2283
Applied a total of 421 rules in 2869 ms. Remains 82 /273 variables (removed 191) and now considering 2283/2487 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 82/273 places, 2283/2487 transitions.
RANDOM walk for 40000 steps (8 resets) in 3858 ms. (10 steps per ms) remains 8/10 properties
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1069 ms. (37 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1036 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 750 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 984 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1086 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 344 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 904 ms. (44 steps per ms) remains 8/8 properties
[2026-05-31 23:27:59] [INFO ] Flow matrix only has 2279 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12707590229716208249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-99314889867128891.kers'
[2026-05-31 23:27:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12707590229716208249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-99314889867128891.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2279 rows 82 cols 33843 entries
Finished phase 1 with 61 SingleSign rule and 3 generalized
[2026-05-31 23:27:59] [INFO ] Computed 18 invariants in 22 ms
Computed 18 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-99314889867128891.kers
Total runtime 30 ms.
[2026-05-31 23:27:59] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 17/82 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2279/2361 variables, 82/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2361 variables, 26/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2361 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2361 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2361/2361 variables, and 126 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2336 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 17/82 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2279/2361 variables, 82/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2361 variables, 26/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2361 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/2361 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2361/2361 variables, and 128 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4417 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6912ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 1517 ms.
Support contains 15 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 2283/2283 transitions.
Graph (trivial) has 30 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 81 transition count 2278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 78 transition count 2278
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 78 transition count 2273
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 73 transition count 2273
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 68 transition count 1640
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 68 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 66 transition count 830
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 66 transition count 830
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 63 transition count 827
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 62 transition count 795
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 62 transition count 795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 61 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 61 transition count 579
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 57 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 57 transition count 573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 56 transition count 570
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 56 transition count 570
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 65 place count 56 transition count 562
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 56 transition count 556
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 77 place count 50 transition count 556
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 84 place count 50 transition count 549
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 49 transition count 548
Applied a total of 85 rules in 286 ms. Remains 49 /82 variables (removed 33) and now considering 548/2283 (removed 1735) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 49/82 places, 548/2283 transitions.
RANDOM walk for 7636 steps (0 resets) in 213 ms. (35 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV1-PT-bP06C06-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 38332 ms.

BK_STOP 1780270088065

--------------------
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="ErlangenMainframeV1-PT-bP06C06"
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 ErlangenMainframeV1-PT-bP06C06, 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 r338-smll-178021499100095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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