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.r130-smll-177955809100447.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 FlexibleBarrier-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.2K Mar 7 06:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 06:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 FlexibleBarrier-PT-20b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779929322016

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-28 00:48:44] [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-28 00:48:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 00:48:45] [INFO ] Load time of PNML (sax parser for PT used): 597 ms
[2026-05-28 00:48:45] [INFO ] Transformed 5372 places.
[2026-05-28 00:48:45] [INFO ] Transformed 6193 transitions.
[2026-05-28 00:48:45] [INFO ] Found NUPN structural information;
[2026-05-28 00:48:45] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 842 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (296 resets) in 2523 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (7 resets) in 153 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (7 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (7 resets) in 92 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (7 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
[2026-05-28 00:48:47] [INFO ] Flatten gal took : 905 ms
[2026-05-28 00:48:47] [INFO ] Flatten gal took : 423 ms
[2026-05-28 00:48:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12775653501299717917.gal : 188 ms
[2026-05-28 00:48:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6324269064808077767.prop : 3 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/ReachabilityCardinality12775653501299717917.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6324269064808077767.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/ReachabilityCardinality6324269064808077767.prop.
Interrupted probabilistic random walk after 82851 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 16
Probabilistic random walk after 82851 steps, saw 51351 distinct states, run finished after 3008 ms. (steps per millisecond=27 ) 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-5602963046729065067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12967057671365818544.kers'
[2026-05-28 00:48:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5602963046729065067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12967057671365818544.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 6193 rows 5372 cols 15575 entries
Finished phase 1 with 5350 SingleSign rule and 0 generalized
[2026-05-28 00:48:49] [INFO ] Computed 22 invariants in 58 ms
Computed 22 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-12967057671365818544.kers
Total runtime 68 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2024-14 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5192/5372 variables, 22/202 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5372 variables, 5192/5394 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5372/11565 variables, and 5394 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5038 ms.
Refiners :[Domain max(s): 5372/5372 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/5372 constraints, PredecessorRefiner: 16/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5233/5372 variables, 22/161 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5372 variables, 5233/5394 constraints. Problems are: Problem set: 1 solved, 15 unsolved
SMT process timed out in 19045ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 139 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 3958 edges and 5372 vertex of which 48 / 5372 are part of one of the 8 SCC in 27 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 897 transitions
Trivial Post-agglo rules discarded 897 transitions
Performed 897 trivial Post agglomeration. Transition count delta: 897
Iterating post reduction 0 with 897 rules applied. Total rules applied 898 place count 5332 transition count 5248
Reduce places removed 897 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 910 rules applied. Total rules applied 1808 place count 4435 transition count 5235
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1821 place count 4422 transition count 5235
Performed 710 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 710 Pre rules applied. Total rules applied 1821 place count 4422 transition count 4525
Deduced a syphon composed of 710 places in 8 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 3241 place count 3712 transition count 4525
Discarding 2140 places :
Symmetric choice reduction at 3 with 2140 rule applications. Total rules 5381 place count 1572 transition count 2385
Iterating global reduction 3 with 2140 rules applied. Total rules applied 7521 place count 1572 transition count 2385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7522 place count 1572 transition count 2384
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 7522 place count 1572 transition count 2371
Deduced a syphon composed of 13 places in 8 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 7548 place count 1559 transition count 2371
Discarding 310 places :
Symmetric choice reduction at 4 with 310 rule applications. Total rules 7858 place count 1249 transition count 2061
Iterating global reduction 4 with 310 rules applied. Total rules applied 8168 place count 1249 transition count 2061
Ensure Unique test removed 295 transitions
Reduce isomorphic transitions removed 295 transitions.
Iterating post reduction 4 with 295 rules applied. Total rules applied 8463 place count 1249 transition count 1766
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 5 with 264 rules applied. Total rules applied 8727 place count 1117 transition count 1634
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 8749 place count 1106 transition count 1634
Free-agglomeration rule applied 190 times.
Iterating global reduction 5 with 190 rules applied. Total rules applied 8939 place count 1106 transition count 1444
Reduce places removed 190 places and 0 transitions.
Iterating post reduction 5 with 190 rules applied. Total rules applied 9129 place count 916 transition count 1444
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 9136 place count 909 transition count 1437
Iterating global reduction 6 with 7 rules applied. Total rules applied 9143 place count 909 transition count 1437
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 9150 place count 909 transition count 1430
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 9159 place count 909 transition count 1421
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 9173 place count 909 transition count 1421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 9174 place count 908 transition count 1420
Applied a total of 9174 rules in 2983 ms. Remains 908 /5372 variables (removed 4464) and now considering 1420/6193 (removed 4773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2994 ms. Remains : 908/5372 places, 1420/6193 transitions.
RANDOM walk for 40000 steps (892 resets) in 1710 ms. (23 steps per ms) remains 13/15 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (29 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (29 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (29 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (20 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (30 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (28 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (29 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (27 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
[2026-05-28 00:49:12] [INFO ] Flow matrix only has 1394 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13094269898888108458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14896322304370593744.kers'
[2026-05-28 00:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13094269898888108458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14896322304370593744.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1394 rows 908 cols 4310 entries
Finished phase 1 with 886 SingleSign rule and 0 generalized
[2026-05-28 00:49:12] [INFO ] Computed 22 invariants in 18 ms
Computed 22 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-14896322304370593744.kers
Total runtime 20 ms.
[2026-05-28 00:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 805/908 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/908 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1394/2302 variables, 908/930 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2302 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2302 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/2302 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2302/2302 variables, and 931 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 908/908 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 805/908 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 2 (INCLUDED_ONLY) 0/908 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 68
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :68 after 2324
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :2324 after 110659
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :110659 after 2.54917e+08
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :2.54917e+08 after 1.35321e+15
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.35321e+15 after 7.94424e+26
At refinement iteration 3 (INCLUDED_ONLY) 0/908 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :7.94424e+26 after 4.4807e+33
At refinement iteration 5 (OVERLAPS) 1394/2302 variables, 908/935 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2302 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2302 variables, 9/945 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2302 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2302 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/2302 variables, 2/948 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2302 variables, 2/950 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2302 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2302 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/2302 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2302/2302 variables, and 952 constraints, problems are : Problem set: 0 solved, 13 unsolved in 18583 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 908/908 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/9 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20664ms problems are : Problem set: 0 solved, 13 unsolved
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 10 properties in 3805 ms.
Support contains 24 out of 908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 908/908 places, 1420/1420 transitions.
Graph (trivial) has 364 edges and 908 vertex of which 21 / 908 are part of one of the 10 SCC in 2 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 897 transition count 1367
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 865 transition count 1367
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 65 place count 865 transition count 1360
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 79 place count 858 transition count 1360
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 99 place count 858 transition count 1340
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 168 place count 789 transition count 1271
Iterating global reduction 3 with 69 rules applied. Total rules applied 237 place count 789 transition count 1271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 245 place count 789 transition count 1263
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 303 place count 760 transition count 1234
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 312 place count 760 transition count 1225
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 338 place count 734 transition count 1199
Iterating global reduction 5 with 26 rules applied. Total rules applied 364 place count 734 transition count 1199
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 390 place count 734 transition count 1173
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 399 place count 734 transition count 1164
Free-agglomeration rule applied 208 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 208 rules applied. Total rules applied 607 place count 734 transition count 950
Reduce places removed 209 places and 0 transitions.
Graph (trivial) has 105 edges and 525 vertex of which 34 / 525 are part of one of the 17 SCC in 0 ms
Free SCC test removed 17 places
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 6 with 212 rules applied. Total rules applied 819 place count 508 transition count 948
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 37 rules applied. Total rules applied 856 place count 506 transition count 913
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 857 place count 505 transition count 913
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 857 place count 505 transition count 895
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 893 place count 487 transition count 895
Discarding 105 places :
Symmetric choice reduction at 9 with 105 rule applications. Total rules 998 place count 382 transition count 790
Iterating global reduction 9 with 105 rules applied. Total rules applied 1103 place count 382 transition count 790
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 9 with 105 rules applied. Total rules applied 1208 place count 382 transition count 685
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 10 with 46 rules applied. Total rules applied 1254 place count 359 transition count 662
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1258 place count 357 transition count 662
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1262 place count 357 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1281 place count 357 transition count 639
Free-agglomeration rule applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1299 place count 357 transition count 621
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 11 with 98 rules applied. Total rules applied 1397 place count 329 transition count 551
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 12 with 90 rules applied. Total rules applied 1487 place count 284 transition count 506
Discarding 98 places :
Symmetric choice reduction at 13 with 98 rule applications. Total rules 1585 place count 186 transition count 408
Iterating global reduction 13 with 98 rules applied. Total rules applied 1683 place count 186 transition count 408
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 13 with 98 rules applied. Total rules applied 1781 place count 186 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 1792 place count 186 transition count 299
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1793 place count 186 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1794 place count 185 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1795 place count 185 transition count 297
Applied a total of 1795 rules in 360 ms. Remains 185 /908 variables (removed 723) and now considering 297/1420 (removed 1123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 185/908 places, 297/1420 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6639683828314987271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14634535205167462519.kers'
[2026-05-28 00:49:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6639683828314987271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14634535205167462519.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 297 rows 183 cols 752 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-28 00:49:37] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14634535205167462519.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 165/185 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 297/482 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 2/1 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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 165/185 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 297/482 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 197 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 753 steps, including 78 resets, run visited all 2 properties in 3 ms. (steps per millisecond=251 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 53943 ms.

BK_STOP 1779929378361

--------------------
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="FlexibleBarrier-PT-20b"
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 FlexibleBarrier-PT-20b, 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 r130-smll-177955809100447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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