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

About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP07C07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3111.855 390648.00 959406.00 983.30 TTTTTTFTTTTFTFTT 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-178021499200263.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 ErlangenMainframeV2-PT-bP07C07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 8.7K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 10:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 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 6.3M 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 ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780390058115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP07C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-06-02 08:47:40] [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-06-02 08:47:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 08:47:41] [INFO ] Load time of PNML (sax parser for PT used): 947 ms
[2026-06-02 08:47:41] [INFO ] Transformed 299 places.
[2026-06-02 08:47:41] [INFO ] Transformed 6883 transitions.
[2026-06-02 08:47:41] [INFO ] Found NUPN structural information;
[2026-06-02 08:47:41] [INFO ] Parsed PT model containing 299 places and 6883 transitions and 127701 arcs in 1270 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 14843 ms. (2 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 353 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 337 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 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 213 ms. (18 steps per ms) remains 16/16 properties
[2026-06-02 08:47:46] [INFO ] Flatten gal took : 3301 ms
BEST_FIRST walk for 4004 steps (8 resets) in 187 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
[2026-06-02 08:47:47] [INFO ] Flatten gal took : 1241 ms
[2026-06-02 08:47:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6779045336996170384.gal : 515 ms
[2026-06-02 08:47:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7237060370279212993.prop : 20 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/ReachabilityCardinality6779045336996170384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7237060370279212993.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/ReachabilityCardinality7237060370279212993.prop.
Interrupted probabilistic random walk after 461113 steps, run timeout after 12025 ms. (steps per millisecond=38 ) properties seen :0 out of 16
Probabilistic random walk after 461113 steps, saw 64008 distinct states, run finished after 12037 ms. (steps per millisecond=38 ) 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-4450344556793346033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11235520747061834761.kers'
[2026-06-02 08:47:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4450344556793346033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11235520747061834761.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 6883 rows 299 cols 127701 entries
Finished phase 1 with 274 SingleSign rule and 3 generalized
[2026-06-02 08:47:59] [INFO ] Computed 22 invariants in 84 ms
Computed 22 P flows in 90 ms.
Exported basis to /tmp/petrispot-output-11235520747061834761.kers
Total runtime 112 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 63/115 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 63/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 84/199 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 84/213 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 100/299 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 100/321 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 16 unsolved
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 3
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :6 after 15
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :15 after 103
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :103 after 4300
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :4300 after 4355
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :4355 after 4546
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7182/7182 variables, and 620 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5041 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 63/115 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 63/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :4546 after 63353
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :63353 after 94821
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 84/199 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 84/214 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-00 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-14 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 100/299 variables, 8/222 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 100/322 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 299/7182 variables, and 322 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5010 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/299 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10640ms problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 6883/6883 transitions.
Graph (trivial) has 228 edges and 299 vertex of which 10 / 299 are part of one of the 4 SCC in 19 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 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 293 transition count 6756
Reduce places removed 116 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 128 rules applied. Total rules applied 245 place count 177 transition count 6744
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 250 place count 174 transition count 6742
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 252 place count 172 transition count 6742
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 252 place count 172 transition count 6737
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 262 place count 167 transition count 6737
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 296 place count 133 transition count 6703
Iterating global reduction 4 with 34 rules applied. Total rules applied 330 place count 133 transition count 6703
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 330 place count 133 transition count 6698
Deduced a syphon composed of 5 places in 15 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 340 place count 128 transition count 6698
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 346 place count 122 transition count 6672
Iterating global reduction 4 with 6 rules applied. Total rules applied 352 place count 122 transition count 6672
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 400 place count 98 transition count 6648
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 414 place count 91 transition count 6676
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 426 place count 91 transition count 6664
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 428 place count 89 transition count 6658
Iterating global reduction 5 with 2 rules applied. Total rules applied 430 place count 89 transition count 6658
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 440 place count 89 transition count 6648
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 442 place count 88 transition count 6661
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 443 place count 88 transition count 6660
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 458 place count 88 transition count 6645
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 461 place count 88 transition count 6642
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 464 place count 85 transition count 6642
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 465 place count 85 transition count 6641
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :94821 after 7.8771e+06
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 471 place count 85 transition count 6641
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 477 place count 85 transition count 6635
Applied a total of 477 rules in 11820 ms. Remains 85 /299 variables (removed 214) and now considering 6635/6883 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11839 ms. Remains : 85/299 places, 6635/6883 transitions.
RANDOM walk for 40000 steps (8 resets) in 7961 ms. (5 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 6454 ms. (6 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5273 ms. (7 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 6124 ms. (6 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4261 ms. (9 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5087 ms. (7 steps per ms) remains 14/14 properties
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :7.8771e+06 after 1.2761e+08
BEST_FIRST walk for 40000 steps (8 resets) in 5439 ms. (7 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5751 ms. (6 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 3690 ms. (10 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 4711 ms. (8 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5526 ms. (7 steps per ms) remains 13/14 properties
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 5186 ms. (7 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5071 ms. (7 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 4162 ms. (9 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 4218 ms. (9 steps per ms) remains 13/13 properties
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :1.2761e+08 after 1.78569e+09
Interrupted probabilistic random walk after 2711270 steps, run timeout after 66001 ms. (steps per millisecond=41 ) properties seen :2 out of 13
Probabilistic random walk after 2711270 steps, saw 396388 distinct states, run finished after 66001 ms. (steps per millisecond=41 ) properties seen :2
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14519348378960022828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4194075429986200972.kers'
[2026-06-02 08:49:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14519348378960022828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4194075429986200972.kers]
Culled 0 columns in 22 ms.
// Phase 1: matrix 6635 rows 85 cols 127095 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-06-02 08:49:49] [INFO ] Computed 22 invariants in 84 ms
Computed 22 P flows in 85 ms.
Exported basis to /tmp/petrispot-output-4194075429986200972.kers
Total runtime 104 ms.
[2026-06-02 08:49:49] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 8/64 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/85 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 6635/6720 variables, 85/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6720 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6720 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/6720 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6720/6720 variables, and 138 constraints, problems are : Problem set: 0 solved, 11 unsolved in 14343 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 8/64 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 21/85 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 6635/6720 variables, 85/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6720 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6720 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/6720 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6720/6720 variables, and 138 constraints, problems are : Problem set: 0 solved, 11 unsolved in 25154 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39778ms problems are : Problem set: 0 solved, 11 unsolved
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 8076 ms.
Support contains 48 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 6635/6635 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 6634
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 6634
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 84 transition count 6633
Applied a total of 4 rules in 4348 ms. Remains 84 /85 variables (removed 1) and now considering 6633/6635 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4348 ms. Remains : 84/85 places, 6633/6635 transitions.
RANDOM walk for 40000 steps (8 resets) in 5875 ms. (6 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5420 ms. (7 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3439 ms. (11 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5749 ms. (6 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 4443 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5301 ms. (7 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5354 ms. (7 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 4082 ms. (9 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 966090 steps, run timeout after 33001 ms. (steps per millisecond=29 ) properties seen :1 out of 7
Probabilistic random walk after 966090 steps, saw 163015 distinct states, run finished after 33002 ms. (steps per millisecond=29 ) properties seen :1
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18118829399070513943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5062726135414129464.kers'
[2026-06-02 08:51:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18118829399070513943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5062726135414129464.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 6633 rows 84 cols 127091 entries
Finished phase 1 with 59 SingleSign rule and 3 generalized
[2026-06-02 08:51:26] [INFO ] Computed 22 invariants in 79 ms
Computed 22 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-5062726135414129464.kers
Total runtime 103 ms.
[2026-06-02 08:51:26] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 22/84 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6633/6717 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6717 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6717/6717 variables, and 137 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12665 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/62 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 22/84 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6633/6717 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6717 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6717/6717 variables, and 137 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12319 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25201ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4418 ms.
Support contains 48 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 6633/6633 transitions.
Applied a total of 0 rules in 1462 ms. Remains 84 /84 variables (removed 0) and now considering 6633/6633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1463 ms. Remains : 84/84 places, 6633/6633 transitions.
RANDOM walk for 40000 steps (8 resets) in 5772 ms. (6 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5090 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3281 ms. (12 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5288 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 4562 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5181 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 4673 ms. (8 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 810902 steps, run timeout after 27001 ms. (steps per millisecond=30 ) properties seen :0 out of 6
Probabilistic random walk after 810902 steps, saw 135988 distinct states, run finished after 27002 ms. (steps per millisecond=30 ) properties seen :0
[2026-06-02 08:52:33] [INFO ] Invariant cache hit.
[2026-06-02 08:52:33] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 22/84 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6633/6717 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6717 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6717/6717 variables, and 137 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12641 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 8/62 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 22/84 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6633/6717 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6717 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6717/6717 variables, and 137 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9493 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22235ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4291 ms.
Support contains 48 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 6633/6633 transitions.
Applied a total of 0 rules in 1495 ms. Remains 84 /84 variables (removed 0) and now considering 6633/6633 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1496 ms. Remains : 84/84 places, 6633/6633 transitions.
RANDOM walk for 40000 steps (8 resets) in 6379 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5610 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 4097 ms. (9 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5570 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 4290 ms. (9 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5181 ms. (7 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 679299 steps, run timeout after 24001 ms. (steps per millisecond=28 ) properties seen :0 out of 5
Probabilistic random walk after 679299 steps, saw 118056 distinct states, run finished after 24001 ms. (steps per millisecond=28 ) properties seen :0
[2026-06-02 08:53:34] [INFO ] Invariant cache hit.
[2026-06-02 08:53:34] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/84 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6633/6717 variables, 84/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6717 variables, 30/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6717 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/6717 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6717/6717 variables, and 136 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6404 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 8/62 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 22/84 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6633/6717 variables, 84/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6717 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/6717 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6717/6717 variables, and 137 constraints, problems are : Problem set: 0 solved, 5 unsolved in 11897 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18357ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 3424 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 6633/6633 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 84 transition count 6628
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 79 transition count 6628
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 17 place count 72 transition count 4569
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 72 transition count 4569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 70 transition count 2139
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 70 transition count 2139
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 38 place count 65 transition count 2139
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 65 transition count 2133
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 65 transition count 2130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 50 place count 62 transition count 2130
Applied a total of 50 rules in 906 ms. Remains 62 /84 variables (removed 22) and now considering 2130/6633 (removed 4503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 62/84 places, 2130/6633 transitions.
RANDOM walk for 40000 steps (8 resets) in 5202 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2917 ms. (13 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2115 ms. (18 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 457408 steps, run timeout after 6001 ms. (steps per millisecond=76 ) properties seen :1 out of 2
Probabilistic random walk after 457408 steps, saw 73750 distinct states, run finished after 6001 ms. (steps per millisecond=76 ) properties seen :1
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-06-02 08:54:05] [INFO ] Flow matrix only has 2126 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-8375171531201544048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9607307495035963942.kers'
[2026-06-02 08:54:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8375171531201544048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9607307495035963942.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2126 rows 62 cols 41393 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-06-02 08:54:05] [INFO ] Computed 22 invariants in 24 ms
Computed 22 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-9607307495035963942.kers
Total runtime 31 ms.
[2026-06-02 08:54:05] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/33 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/62 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2126/2188 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2188 variables, 30/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2188 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2188 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2188/2188 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/33 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/62 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2126/2188 variables, 62/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2188 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2188/2188 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2765ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1333 steps, including 148 resets, run visited all 1 properties in 96 ms. (steps per millisecond=13 )
FORMULA ErlangenMainframeV2-PT-bP07C07-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 103 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 388644 ms.

BK_STOP 1780390448763

--------------------
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="ErlangenMainframeV2-PT-bP07C07"
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 ErlangenMainframeV2-PT-bP07C07, 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-178021499200263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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