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

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-0707

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3151.396 122249.00 302458.00 362.40 FTFFTTTFFFFFFFFF 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.r114-smll-177955740600439.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 ErlangenMainframeV0-PT-0707, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 5.7K Mar 7 05:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 05:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 05:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 05:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 05:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779861724418

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0707
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-27 06:02:06] [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-27 06:02:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 06:02:07] [INFO ] Load time of PNML (sax parser for PT used): 1045 ms
[2026-05-27 06:02:07] [INFO ] Transformed 243 places.
[2026-05-27 06:02:07] [INFO ] Transformed 6817 transitions.
[2026-05-27 06:02:07] [INFO ] Found NUPN structural information;
[2026-05-27 06:02:07] [INFO ] Parsed PT model containing 243 places and 6817 transitions and 114442 arcs in 1357 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 7277 ms. (5 steps per ms) remains 14/16 properties
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 869 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2225 ms. (17 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 985 ms. (40 steps per ms) remains 14/14 properties
[2026-05-27 06:02:11] [INFO ] Flatten gal took : 2551 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1369 ms. (29 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 406 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1096 ms. (36 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 928 ms. (43 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 614 ms. (65 steps per ms) remains 14/14 properties
[2026-05-27 06:02:13] [INFO ] Flatten gal took : 1459 ms
BEST_FIRST walk for 40001 steps (8 resets) in 503 ms. (79 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 921 ms. (43 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 548 ms. (72 steps per ms) remains 14/14 properties
[2026-05-27 06:02:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7311550469387393093.gal : 657 ms
[2026-05-27 06:02:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5450083128300791263.prop : 17 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/ReachabilityCardinality7311550469387393093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5450083128300791263.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
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17568048897500689185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14177669823156972936.kers'
[2026-05-27 06:02:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17568048897500689185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14177669823156972936.kers]
Culled 0 columns in 20 ms.
// Phase 1: matrix 6817 rows 243 cols 114442 entries
Finished phase 1 with 220 SingleSign rule and 3 generalized
[2026-05-27 06:02:14] [INFO ] Computed 20 invariants in 79 ms
Computed 20 P flows in 81 ms.
Exported basis to /tmp/petrispot-output-14177669823156972936.kers
Total runtime 106 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-02 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-03 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-07 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-13 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 100/161 variables, 13/74 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 100/174 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/174 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 82/243 variables, 7/181 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 82/263 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/263 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality5450083128300791263.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7060/7060 variables, and 506 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5226 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-01 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-05 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 91/148 variables, 12/69 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 91/160 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/160 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 11/159 variables, 1/161 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 11/172 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/172 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 84/243 variables, 7/179 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 84/263 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/263 constraints. Problems are: Problem set: 6 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7060/7060 variables, and 506 constraints, problems are : Problem set: 6 solved, 8 unsolved in 5016 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10939ms problems are : Problem set: 6 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 6817/6817 transitions.
Graph (trivial) has 159 edges and 243 vertex of which 4 / 243 are part of one of the 2 SCC in 20 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 241 transition count 6737
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 165 transition count 6737
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 153 place count 165 transition count 6733
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 161 place count 161 transition count 6733
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 203 place count 119 transition count 6691
Iterating global reduction 2 with 42 rules applied. Total rules applied 245 place count 119 transition count 6691
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 245 place count 119 transition count 6686
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 255 place count 114 transition count 6686
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 297 place count 93 transition count 6665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 298 place count 92 transition count 6655
Iterating global reduction 2 with 1 rules applied. Total rules applied 299 place count 92 transition count 6655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 300 place count 92 transition count 6654
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 91 transition count 6661
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :11 after 195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 91 transition count 6660
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :195 after 4443
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 309 place count 91 transition count 6654
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 316 place count 85 transition count 6653
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :4443 after 106498
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :106498 after 542287
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :542287 after 543220
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :543220 after 544894
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 317 place count 85 transition count 6652
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :544894 after 549007
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :549007 after 552127
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 85 transition count 6651
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 325 place count 84 transition count 6645
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 84 transition count 6645
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 334 place count 84 transition count 6645
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :552127 after 2.08061e+06
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 341 place count 84 transition count 6638
Applied a total of 341 rules in 13597 ms. Remains 84 /243 variables (removed 159) and now considering 6638/6817 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13617 ms. Remains : 84/243 places, 6638/6817 transitions.
RANDOM walk for 40000 steps (8 resets) in 3696 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 412 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 885 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 719 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 648 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 8/8 properties
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :2.08061e+06 after 5.48345e+06
BEST_FIRST walk for 40003 steps (8 resets) in 667 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1333 ms. (29 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 406226 steps, run timeout after 6001 ms. (steps per millisecond=67 ) properties seen :0 out of 8
Probabilistic random walk after 406226 steps, saw 66917 distinct states, run finished after 6013 ms. (steps per millisecond=67 ) 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-14268918681182170200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11413226787227756765.kers'
[2026-05-27 06:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14268918681182170200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11413226787227756765.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 19 ms.
// Phase 1: matrix 6638 rows 83 cols 113978 entries
Finished phase 1 with 61 SingleSign rule and 3 generalized
[2026-05-27 06:02:47] [INFO ] Computed 20 invariants in 67 ms
Computed 20 P flows in 68 ms.
Exported basis to /tmp/petrispot-output-11413226787227756765.kers
Total runtime 86 ms.
[2026-05-27 06:02:47] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/79 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/84 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 6638/6722 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6722 variables, 32/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6722 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/6722 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6722/6722 variables, and 136 constraints, problems are : Problem set: 0 solved, 8 unsolved in 7010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 29/79 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/84 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 6638/6722 variables, 84/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6722 variables, 32/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :5.48345e+06 after 2.20744e+08
At refinement iteration 8 (INCLUDED_ONLY) 0/6722 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/6722 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6722/6722 variables, and 136 constraints, problems are : Problem set: 0 solved, 8 unsolved in 14052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21314ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3767 ms.
Support contains 49 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 6638/6638 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 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 6637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 83 transition count 6637
Applied a total of 2 rules in 1491 ms. Remains 83 /84 variables (removed 1) and now considering 6637/6638 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1491 ms. Remains : 83/84 places, 6637/6638 transitions.
RANDOM walk for 40000 steps (8 resets) in 2652 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 570 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 582 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 551 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 983 ms. (40 steps per ms) remains 6/6 properties
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :2.20744e+08 after 6.50518e+08
Interrupted probabilistic random walk after 397977 steps, run timeout after 6001 ms. (steps per millisecond=66 ) properties seen :0 out of 6
Probabilistic random walk after 397977 steps, saw 69164 distinct states, run finished after 6001 ms. (steps per millisecond=66 ) 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-16721897624915663561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10327966180558646374.kers'
[2026-05-27 06:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16721897624915663561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10327966180558646374.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 20 ms.
// Phase 1: matrix 6637 rows 82 cols 113976 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-27 06:03:22] [INFO ] Computed 20 invariants in 74 ms
Computed 20 P flows in 75 ms.
Exported basis to /tmp/petrispot-output-10327966180558646374.kers
Total runtime 93 ms.
[2026-05-27 06:03:22] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 29/78 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/83 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 6637/6720 variables, 83/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6720 variables, 32/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6720 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/6720 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6720/6720 variables, and 135 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7171 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 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/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 29/78 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/83 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 6637/6720 variables, 83/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6720 variables, 32/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6720 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/6720 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6720/6720 variables, and 135 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10953 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 83/83 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18325ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2439 ms.
Support contains 48 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 6637/6637 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 82 transition count 6636
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 3 place count 82 transition count 6635
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 6634
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 11 place count 81 transition count 6628
Applied a total of 11 rules in 4466 ms. Remains 81 /83 variables (removed 2) and now considering 6628/6637 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4470 ms. Remains : 81/83 places, 6628/6637 transitions.
RANDOM walk for 40000 steps (8 resets) in 2695 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 726 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 736 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 638 ms. (62 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 197047 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 3
Probabilistic random walk after 197047 steps, saw 33850 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) 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-3701521879974322331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7672953659343009905.kers'
[2026-05-27 06:03:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3701521879974322331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7672953659343009905.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 20 ms.
// Phase 1: matrix 6628 rows 79 cols 113940 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-27 06:03:51] [INFO ] Computed 20 invariants in 73 ms
Computed 20 P flows in 74 ms.
Exported basis to /tmp/petrispot-output-7672953659343009905.kers
Total runtime 92 ms.
[2026-05-27 06:03:52] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 27/75 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/81 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6628/6709 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6709 variables, 27/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6709 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/6709 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6709/6709 variables, and 128 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 27/75 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 6/81 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6628/6709 variables, 81/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6709 variables, 27/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6709 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/6709 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6709/6709 variables, and 128 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6516 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10517ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 859 ms.
Support contains 9 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 6628/6628 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 6626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 79 transition count 6626
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 79 transition count 6620
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 73 transition count 6620
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 29 place count 60 transition count 4435
Ensure Unique test removed 6 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 48 place count 54 transition count 4435
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 48 transition count 445
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 48 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 46 transition count 443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 45 transition count 442
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 44 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 43 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 43 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 42 transition count 313
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 39 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 39 transition count 307
Applied a total of 83 rules in 773 ms. Remains 39 /81 variables (removed 42) and now considering 307/6628 (removed 6321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 773 ms. Remains : 39/81 places, 307/6628 transitions.
RANDOM walk for 40000 steps (8 resets) in 4069 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 902833 steps, run visited all 1 properties in 1373 ms. (steps per millisecond=657 )
Probabilistic random walk after 902833 steps, saw 97764 distinct states, run finished after 1380 ms. (steps per millisecond=654 ) properties seen :1
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 120345 ms.

BK_STOP 1779861846667

--------------------
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="ErlangenMainframeV0-PT-0707"
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 ErlangenMainframeV0-PT-0707, 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 r114-smll-177955740600439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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