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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
485.855 17714.00 54657.00 127.30 TTTTTFFTFTTTFFFT 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-178021499100079.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-bP04C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:32 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 200K 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-bP04C04-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780262193914

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-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-31 21:16:36] [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 21:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 21:16:36] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2026-05-31 21:16:36] [INFO ] Transformed 233 places.
[2026-05-31 21:16:36] [INFO ] Transformed 507 transitions.
[2026-05-31 21:16:36] [INFO ] Found NUPN structural information;
[2026-05-31 21:16:36] [INFO ] Parsed PT model containing 233 places and 507 transitions and 3455 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
[2026-05-31 21:16:38] [INFO ] Flatten gal took : 434 ms
[2026-05-31 21:16:38] [INFO ] Flatten gal took : 102 ms
RANDOM walk for 40000 steps (8 resets) in 4237 ms. (9 steps per ms) remains 11/16 properties
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-31 21:16:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7164267285087985029.gal : 213 ms
[2026-05-31 21:16:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16288810608490478845.prop : 11 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/ReachabilityCardinality7164267285087985029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16288810608490478845.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 871 ms. (45 steps per ms) remains 11/11 properties

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/ReachabilityCardinality16288810608490478845.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 1144 ms. (34 steps per ms) remains 10/11 properties
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :5 after 8
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :8 after 119
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :119 after 361
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :361 after 388
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :388 after 3455
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :3455 after 3619
BEST_FIRST walk for 40002 steps (8 resets) in 1154 ms. (34 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :3619 after 279341
BEST_FIRST walk for 40003 steps (8 resets) in 521 ms. (76 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 539 ms. (74 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :279341 after 1.35759e+06
BEST_FIRST walk for 40001 steps (8 resets) in 368 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 338 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 9/10 properties
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 497 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 611 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1781596138857909993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6705533908091761417.kers'
[2026-05-31 21:16:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1781596138857909993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6705533908091761417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 507 rows 233 cols 3455 entries
Finished phase 1 with 216 SingleSign rule and 3 generalized
[2026-05-31 21:16:40] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6705533908091761417.kers
Total runtime 5 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-14 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 156/232 variables, 10/89 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 156/245 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/233 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 1/247 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 507/740 variables, 233/480 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/740 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 480 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1861 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 9/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/72 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-01 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-04 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-07 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 163/232 variables, 10/82 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 163/245 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/248 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/248 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/233 variables, 1/249 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/250 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/250 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 507/740 variables, 233/483 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 3/486 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 0/486 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/740 variables, 0/486 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 486 constraints, problems are : Problem set: 4 solved, 5 unsolved in 4791 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6860ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 0 properties in 2378 ms.
Support contains 39 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 507/507 transitions.
Graph (trivial) has 166 edges and 233 vertex of which 10 / 233 are part of one of the 4 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 227 transition count 423
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 151 place count 154 transition count 419
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 153 transition count 415
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 149 transition count 415
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 160 place count 149 transition count 407
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 176 place count 141 transition count 407
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 211 place count 106 transition count 372
Iterating global reduction 4 with 35 rules applied. Total rules applied 246 place count 106 transition count 372
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 253 place count 106 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 105 transition count 365
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 254 place count 105 transition count 362
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 260 place count 102 transition count 362
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 292 place count 86 transition count 346
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 302 place count 81 transition count 353
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 304 place count 81 transition count 351
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 309 place count 81 transition count 346
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 314 place count 76 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 316 place count 76 transition count 344
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 319 place count 76 transition count 344
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 322 place count 76 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 325 place count 76 transition count 341
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 326 place count 75 transition count 340
Applied a total of 326 rules in 325 ms. Remains 75 /233 variables (removed 158) and now considering 340/507 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 75/233 places, 340/507 transitions.
RANDOM walk for 40000 steps (8 resets) in 1249 ms. (32 steps per ms) remains 2/5 properties
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
[2026-05-31 21:16:50] [INFO ] Flow matrix only has 339 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11493268279722723665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13817562735606151734.kers'
[2026-05-31 21:16:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11493268279722723665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13817562735606151734.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 339 rows 74 cols 3115 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-31 21:16:50] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13817562735606151734.kers
Total runtime 5 ms.
[2026-05-31 21:16:50] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/74 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/75 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 339/414 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 106 constraints, problems are : Problem set: 0 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/0 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/74 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/75 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 339/414 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 17/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 106 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA ErlangenMainframeV1-PT-bP04C04-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 16 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 15405 ms.

BK_STOP 1780262211628

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

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