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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.2K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.5K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-bP06C06-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780384917233

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-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-06-02 07:21:59] [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 07:21:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 07:22:00] [INFO ] Load time of PNML (sax parser for PT used): 604 ms
[2026-06-02 07:22:00] [INFO ] Transformed 279 places.
[2026-06-02 07:22:00] [INFO ] Transformed 2491 transitions.
[2026-06-02 07:22:00] [INFO ] Found NUPN structural information;
[2026-06-02 07:22:00] [INFO ] Parsed PT model containing 279 places and 2491 transitions and 38716 arcs in 838 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 10302 ms. (3 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 259 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 460 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 291 ms. (13 steps per ms) remains 16/16 properties
[2026-06-02 07:22:03] [INFO ] Flatten gal took : 1855 ms
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 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 4003 steps (8 resets) in 287 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 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
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 310 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
[2026-06-02 07:22:04] [INFO ] Flatten gal took : 687 ms
[2026-06-02 07:22:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11358518923202713892.gal : 272 ms
[2026-06-02 07:22:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1222117524177105257.prop : 40 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/ReachabilityCardinality11358518923202713892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1222117524177105257.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1222117524177105257.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 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 11
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :11 after 1437
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :1437 after 1524
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1524 after 1696
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1696 after 22086
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :22086 after 108226
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :108226 after 1.00857e+07
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :1.00857e+07 after 6.64977e+07
Interrupted probabilistic random walk after 922401 steps, run timeout after 12001 ms. (steps per millisecond=76 ) properties seen :0 out of 16
Probabilistic random walk after 922401 steps, saw 126163 distinct states, run finished after 12014 ms. (steps per millisecond=76 ) 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-12887481136914146299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5212554443576756380.kers'
[2026-06-02 07:22:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12887481136914146299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5212554443576756380.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2491 rows 279 cols 38716 entries
Finished phase 1 with 256 SingleSign rule and 3 generalized
[2026-06-02 07:22:16] [INFO ] Computed 20 invariants in 26 ms
Computed 20 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-5212554443576756380.kers
Total runtime 36 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-01 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-07 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-08 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-11 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-12 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 124/202 variables, 13/91 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 124/215 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/215 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-03 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-09 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 77/279 variables, 7/222 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 77/299 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/299 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2491/2770 variables, 279/578 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2770 variables, 0/578 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2770 variables, 0/578 constraints. Problems are: Problem set: 7 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2770/2770 variables, and 578 constraints, problems are : Problem set: 7 solved, 9 unsolved in 3600 ms.
Refiners :[Domain max(s): 279/279 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 132/194 variables, 13/75 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 132/207 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 1/208 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/208 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-14 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 85/279 variables, 7/215 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 85/300 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 1/301 constraints. Problems are: Problem set: 8 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/2770 variables, and 301 constraints, problems are : Problem set: 8 solved, 8 unsolved in 5009 ms.
Refiners :[Domain max(s): 279/279 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/279 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8959ms problems are : Problem set: 8 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 2491/2491 transitions.
Graph (trivial) has 192 edges and 279 vertex of which 6 / 279 are part of one of the 2 SCC in 7 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 275 transition count 2392
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 99 rules applied. Total rules applied 192 place count 183 transition count 2385
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 197 place count 181 transition count 2382
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 200 place count 178 transition count 2382
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 200 place count 178 transition count 2373
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 218 place count 169 transition count 2373
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 253 place count 134 transition count 2338
Iterating global reduction 4 with 35 rules applied. Total rules applied 288 place count 134 transition count 2338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 290 place count 134 transition count 2336
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 290 place count 134 transition count 2333
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 296 place count 131 transition count 2333
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 298 place count 129 transition count 2318
Iterating global reduction 5 with 2 rules applied. Total rules applied 300 place count 129 transition count 2318
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 342 place count 108 transition count 2297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 348 place count 105 transition count 2297
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 351 place count 105 transition count 2294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 353 place count 104 transition count 2305
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 360 place count 104 transition count 2298
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 367 place count 97 transition count 2298
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 369 place count 97 transition count 2296
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 97 transition count 2294
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 373 place count 95 transition count 2294
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 374 place count 95 transition count 2293
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 95 transition count 2293
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 388 place count 95 transition count 2293
Applied a total of 388 rules in 2646 ms. Remains 95 /279 variables (removed 184) and now considering 2293/2491 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2657 ms. Remains : 95/279 places, 2293/2491 transitions.
RANDOM walk for 40000 steps (8 resets) in 4895 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1388 ms. (28 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1711 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1149 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1601 ms. (24 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1143 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1272 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1222 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1287 ms. (31 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 815092 steps, run timeout after 15001 ms. (steps per millisecond=54 ) properties seen :0 out of 8
Probabilistic random walk after 815092 steps, saw 247172 distinct states, run finished after 15001 ms. (steps per millisecond=54 ) properties seen :0
[2026-06-02 07:22:48] [INFO ] Flow matrix only has 2282 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9844939146673654527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1332409064964036343.kers'
[2026-06-02 07:22:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9844939146673654527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1332409064964036343.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2282 rows 95 cols 38250 entries
Finished phase 1 with 72 SingleSign rule and 3 generalized
[2026-06-02 07:22:48] [INFO ] Computed 20 invariants in 26 ms
Computed 20 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-1332409064964036343.kers
Total runtime 34 ms.
[2026-06-02 07:22:48] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 22/75 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/95 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2282/2377 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2377 variables, 22/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2377 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2377 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2377/2377 variables, and 137 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2117 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 22/22 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 22/75 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 20/95 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2282/2377 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2377 variables, 22/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2377 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/2377 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2377/2377 variables, and 138 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6296ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2245 ms.
Support contains 51 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 2293/2293 transitions.
Graph (trivial) has 9 edges and 95 vertex of which 2 / 95 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 2 place count 94 transition count 2290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 93 transition count 2290
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 93 transition count 2288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 91 transition count 2288
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 15 place count 91 transition count 2280
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 91 transition count 2278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 89 transition count 2278
Applied a total of 19 rules in 898 ms. Remains 89 /95 variables (removed 6) and now considering 2278/2293 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 898 ms. Remains : 89/95 places, 2278/2293 transitions.
RANDOM walk for 40000 steps (8 resets) in 1427 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1215 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1323 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1236 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 171030 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 5
Probabilistic random walk after 171030 steps, saw 50891 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2026-06-02 07:23:02] [INFO ] Flow matrix only has 2273 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3866283002653833518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17200072364845193512.kers'
[2026-06-02 07:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3866283002653833518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17200072364845193512.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2273 rows 89 cols 38212 entries
Finished phase 1 with 66 SingleSign rule and 3 generalized
[2026-06-02 07:23:02] [INFO ] Computed 20 invariants in 22 ms
Computed 20 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-17200072364845193512.kers
Total runtime 29 ms.
[2026-06-02 07:23:02] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 17/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 20/89 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2273/2362 variables, 89/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2362 variables, 22/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2362 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/2362 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2362/2362 variables, and 131 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 22/22 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 17/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 20/89 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2273/2362 variables, 89/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2362 variables, 22/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2362 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/2362 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2362/2362 variables, and 132 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3065 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4918ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1067 ms.
Support contains 42 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 2278/2278 transitions.
Graph (trivial) has 17 edges and 89 vertex of which 2 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 88 transition count 2273
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 2272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 84 transition count 2272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 84 transition count 2271
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 83 transition count 2271
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 81 transition count 2258
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 81 transition count 2258
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 78 transition count 2255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 77 transition count 2251
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 77 transition count 2251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 77 transition count 2249
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 26 place count 77 transition count 2248
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 77 transition count 2245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 32 place count 74 transition count 2245
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 38 place count 74 transition count 2239
Applied a total of 38 rules in 953 ms. Remains 74 /89 variables (removed 15) and now considering 2239/2278 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 74/89 places, 2239/2278 transitions.
RANDOM walk for 40000 steps (8 resets) in 1841 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1206 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 177008 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :1 out of 3
Probabilistic random walk after 177008 steps, saw 34868 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :1
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-06-02 07:23:13] [INFO ] Flow matrix only has 2237 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6214279747446395832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17535085175044462006.kers'
[2026-06-02 07:23:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6214279747446395832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17535085175044462006.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 6 ms.
// Phase 1: matrix 2237 rows 73 cols 38069 entries
Finished phase 1 with 51 SingleSign rule and 3 generalized
[2026-06-02 07:23:13] [INFO ] Computed 20 invariants in 22 ms
Computed 20 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-17535085175044462006.kers
Total runtime 29 ms.
[2026-06-02 07:23:13] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/54 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/74 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2237/2311 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2311 variables, 18/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2311 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2311 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2311/2311 variables, and 112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1292 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 20/74 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2237/2311 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2311 variables, 18/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2311 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2311 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2311/2311 variables, and 113 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 74/74 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3505ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 262 ms.
Support contains 8 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 2239/2239 transitions.
Graph (trivial) has 22 edges and 74 vertex of which 2 / 74 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 2 place count 73 transition count 2236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 72 transition count 2236
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 3 place count 72 transition count 2225
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 25 place count 61 transition count 2225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 55 transition count 1560
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 55 transition count 1560
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 50 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 50 transition count 294
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 46 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 46 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 46 transition count 282
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 64 place count 45 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 45 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 45 transition count 277
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 45 transition count 271
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 84 place count 38 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 37 transition count 268
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 2 edges and 34 vertex of which 2 / 34 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 4 with 4 rules applied. Total rules applied 89 place count 33 transition count 268
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 91 place count 33 transition count 266
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 92 place count 32 transition count 170
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 32 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 32 transition count 169
Applied a total of 94 rules in 263 ms. Remains 32 /74 variables (removed 42) and now considering 169/2239 (removed 2070) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 32/74 places, 169/2239 transitions.
RANDOM walk for 1548 steps (0 resets) in 28 ms. (53 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 78188 ms.

BK_STOP 1780384997494

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-bP06C06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP06C06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499200255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP06C06.tgz
mv ErlangenMainframeV2-PT-bP06C06 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;