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

About the Execution of ITS-Tools for FlexibleBarrier-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
738.928 27032.00 70905.00 234.60 FTTFFFTFTFFTFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809100446.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100446
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779929283420

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-28 00:48:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 00:48:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 00:48:06] [INFO ] Load time of PNML (sax parser for PT used): 523 ms
[2026-05-28 00:48:06] [INFO ] Transformed 5372 places.
[2026-05-28 00:48:06] [INFO ] Transformed 6193 transitions.
[2026-05-28 00:48:06] [INFO ] Found NUPN structural information;
[2026-05-28 00:48:06] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 752 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (298 resets) in 4314 ms. (9 steps per ms) remains 10/12 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (22 resets) in 414 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (20 resets) in 340 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (21 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 898 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (21 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
[2026-05-28 00:48:08] [INFO ] Flatten gal took : 1305 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18024853946626418500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9064574732836100173.kers'
[2026-05-28 00:48:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18024853946626418500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9064574732836100173.kers]
[2026-05-28 00:48:09] [INFO ] Flatten gal took : 401 ms
Culled 0 columns in 11 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:09] [INFO ] Computed 22 invariants in 116 ms
Computed 22 P flows in 118 ms.
Exported basis to /tmp/petrispot-output-9064574732836100173.kers
Total runtime 128 ms.
[2026-05-28 00:48:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11951779854500225060.gal : 148 ms
[2026-05-28 00:48:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7829834273318124563.prop : 2 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/ReachabilityCardinality11951779854500225060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7829834273318124563.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
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, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality7829834273318124563.prop.
At refinement iteration 2 (OVERLAPS) 5102/5180 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5180 variables, 5102/5200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5180 variables, 0/5200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 192/5372 variables, 2/5202 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5372 variables, 192/5394 constraints. Problems are: Problem set: 0 solved, 10 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: 0 solved, 10 unsolved in 5046 ms.
Refiners :[Domain max(s): 5372/5372 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/5372 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5102/5180 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5180 variables, 5102/5200 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 16688ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 78 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5120 edges and 5372 vertex of which 116 / 5372 are part of one of the 19 SCC in 36 ms
Free SCC test removed 97 places
Drop transitions (Empty/Sink Transition effects.) removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1225 transitions
Trivial Post-agglo rules discarded 1225 transitions
Performed 1225 trivial Post agglomeration. Transition count delta: 1225
Iterating post reduction 0 with 1225 rules applied. Total rules applied 1226 place count 5275 transition count 4851
Reduce places removed 1225 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 1250 rules applied. Total rules applied 2476 place count 4050 transition count 4826
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 2501 place count 4025 transition count 4826
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 390 Pre rules applied. Total rules applied 2501 place count 4025 transition count 4436
Deduced a syphon composed of 390 places in 5 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 3 with 780 rules applied. Total rules applied 3281 place count 3635 transition count 4436
Discarding 2154 places :
Symmetric choice reduction at 3 with 2154 rule applications. Total rules 5435 place count 1481 transition count 2282
Iterating global reduction 3 with 2154 rules applied. Total rules applied 7589 place count 1481 transition count 2282
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 7589 place count 1481 transition count 2269
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 7615 place count 1468 transition count 2269
Discarding 333 places :
Symmetric choice reduction at 3 with 333 rule applications. Total rules 7948 place count 1135 transition count 1936
Iterating global reduction 3 with 333 rules applied. Total rules applied 8281 place count 1135 transition count 1936
Ensure Unique test removed 314 transitions
Reduce isomorphic transitions removed 314 transitions.
Iterating post reduction 3 with 314 rules applied. Total rules applied 8595 place count 1135 transition count 1622
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 8815 place count 1025 transition count 1512
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 4 with 38 rules applied. Total rules applied 8853 place count 1025 transition count 1474
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 8872 place count 1006 transition count 1455
Iterating global reduction 5 with 19 rules applied. Total rules applied 8891 place count 1006 transition count 1455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 8893 place count 1005 transition count 1455
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 8895 place count 1005 transition count 1453
Free-agglomeration rule applied 773 times.
Iterating global reduction 5 with 773 rules applied. Total rules applied 9668 place count 1005 transition count 680
Reduce places removed 773 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 286 transitions
Reduce isomorphic transitions removed 286 transitions.
Iterating post reduction 5 with 1059 rules applied. Total rules applied 10727 place count 232 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 10746 place count 232 transition count 375
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 10748 place count 232 transition count 375
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 10749 place count 232 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10750 place count 231 transition count 374
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 102 edges and 230 vertex of which 34 / 230 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
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 6 with 3 rules applied. Total rules applied 10753 place count 213 transition count 373
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 10788 place count 212 transition count 339
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 20 Pre rules applied. Total rules applied 10788 place count 212 transition count 319
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 10828 place count 192 transition count 319
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 10847 place count 192 transition count 300
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 10895 place count 168 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 10897 place count 168 transition count 274
Free-agglomeration rule applied 21 times.
Iterating global reduction 10 with 21 rules applied. Total rules applied 10918 place count 168 transition count 253
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 40 rules applied. Total rules applied 10958 place count 146 transition count 235
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 10959 place count 145 transition count 234
Iterating global reduction 11 with 1 rules applied. Total rules applied 10960 place count 145 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 10961 place count 145 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 12 with 18 rules applied. Total rules applied 10979 place count 145 transition count 215
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 10980 place count 145 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 10981 place count 144 transition count 214
Applied a total of 10981 rules in 2323 ms. Remains 144 /5372 variables (removed 5228) and now considering 214/6193 (removed 5979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2332 ms. Remains : 144/5372 places, 214/6193 transitions.
RANDOM walk for 40000 steps (8 resets) in 385 ms. (103 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/9 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/5 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9780409798836000937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4525953961785304866.kers'
[2026-05-28 00:48:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9780409798836000937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4525953961785304866.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 214 rows 139 cols 440 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-28 00:48:28] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4525953961785304866.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/120 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/306 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/319 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/324 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/325 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/358 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 14/20 constraints, State Equation: 129/144 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/120 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/306 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/319 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/324 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/325 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/329 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/329 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/335 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/335 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 12/347 variables, 10/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/347 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/347 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/358 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1777 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, State Equation: 139/144 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1983ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 367 steps, including 27 resets, run visited all 1 properties in 4 ms. (steps per millisecond=91 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 18 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 24648 ms.

BK_STOP 1779929310452

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-177955809100446"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;