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.r050-smll-177946901000030.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 Champagne-PT-H05T0R, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.6K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 87K 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 Champagne-PT-H05T0R-ReachabilityCardinality-2024-00
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-01
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-02
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-03
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-04
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-05
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-06
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-07
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-08
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-09
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-10
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-11
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-12
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-13
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-14
FORMULA_NAME Champagne-PT-H05T0R-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779483989992

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H05T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 21:06:32] [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-22 21:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:06:32] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2026-05-22 21:06:32] [INFO ] Transformed 299 places.
[2026-05-22 21:06:32] [INFO ] Transformed 386 transitions.
[2026-05-22 21:06:32] [INFO ] Found NUPN structural information;
[2026-05-22 21:06:33] [INFO ] Parsed PT model containing 299 places and 386 transitions and 966 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (220 resets) in 1967 ms. (20 steps per ms) remains 2/12 properties
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (22 resets) in 519 ms. (76 steps per ms) remains 2/2 properties
[2026-05-22 21:06:33] [INFO ] Flatten gal took : 198 ms
[2026-05-22 21:06:34] [INFO ] Flatten gal took : 107 ms
BEST_FIRST walk for 40004 steps (22 resets) in 694 ms. (57 steps per ms) remains 1/2 properties
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 21:06:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12744121926319426550.gal : 44 ms
[2026-05-22 21:06:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18291412029266679291.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/ReachabilityCardinality12744121926319426550.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18291412029266679291.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7479897167678141178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3890107322962390505.kers'

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 ...330
[2026-05-22 21:06:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7479897167678141178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3890107322962390505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 299 cols 966 entries
Finished phase 1 with 284 SingleSign rule and 0 generalized
[2026-05-22 21:06:34] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3890107322962390505.kers
Total runtime 6 ms.
Loading property file /tmp/ReachabilityCardinality18291412029266679291.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 125
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :125 after 4031
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4031 after 14775
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :14775 after 206318
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :206318 after 591913
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :591913 after 1.3468e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.3468e+08 after 5.6112e+10
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 214/240 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 214/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 59/299 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 59/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 386/685 variables, 299/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/685 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 613 constraints, problems are : Problem set: 0 solved, 1 unsolved in 915 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 299/299 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/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 214/240 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 214/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 59/299 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 59/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 386/685 variables, 299/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/685 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 685/685 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1527 ms.
Refiners :[Domain max(s): 299/299 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2717ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 26 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 386/386 transitions.
Graph (trivial) has 246 edges and 299 vertex of which 23 / 299 are part of one of the 4 SCC in 8 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 280 transition count 263
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 119 rules applied. Total rules applied 218 place count 182 transition count 242
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 15 rules applied. Total rules applied 233 place count 172 transition count 237
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 238 place count 167 transition count 237
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 238 place count 167 transition count 228
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 256 place count 158 transition count 228
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 297 place count 117 transition count 187
Iterating global reduction 4 with 41 rules applied. Total rules applied 338 place count 117 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 117 transition count 186
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 339 place count 117 transition count 180
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 351 place count 111 transition count 180
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 360 place count 102 transition count 147
Iterating global reduction 5 with 9 rules applied. Total rules applied 369 place count 102 transition count 147
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 378 place count 102 transition count 138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 418 place count 82 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 420 place count 81 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 421 place count 81 transition count 118
Free-agglomeration rule applied 24 times.
Iterating global reduction 6 with 24 rules applied. Total rules applied 445 place count 81 transition count 94
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 487 place count 57 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 488 place count 56 transition count 75
Applied a total of 488 rules in 132 ms. Remains 56 /299 variables (removed 243) and now considering 75/386 (removed 311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 56/299 places, 75/386 transitions.
RANDOM walk for 40000 steps (8 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2650673 steps, run timeout after 3001 ms. (steps per millisecond=883 ) properties seen :0 out of 1
Probabilistic random walk after 2650673 steps, saw 419616 distinct states, run finished after 3008 ms. (steps per millisecond=881 ) properties seen :0
[2026-05-22 21:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8856178077640094012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10129350851563723521.kers'
[2026-05-22 21:06:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8856178077640094012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10129350851563723521.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 61 rows 53 cols 145 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-22 21:06:40] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10129350851563723521.kers
Total runtime 0 ms.
[2026-05-22 21:06:40] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/117 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 56/56 constraints, ReadFeed: 10/10 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/56 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/117 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 56/56 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 26 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 56/56 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2026-05-22 21:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 14 similar events)
[2026-05-22 21:06:40] [INFO ] Invariant cache hit.
[2026-05-22 21:06:40] [INFO ] Implicit Places using invariants in 52 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 55/56 places, 75/75 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 55 transition count 71
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 55 transition count 71
Applied a total of 6 rules in 9 ms. Remains 55 /55 variables (removed 0) and now considering 71/75 (removed 4) transitions.
[2026-05-22 21:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9602508922385716313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5308270743920870079.kers'
[2026-05-22 21:06:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9602508922385716313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5308270743920870079.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 61 rows 52 cols 144 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-22 21:06:40] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5308270743920870079.kers
Total runtime 1 ms.
[2026-05-22 21:06:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-22 21:06:40] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2026-05-22 21:06:40] [INFO ] Invariant cache hit.
[2026-05-22 21:06:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 21:06:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/56 places, 71/75 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 205 ms. Remains : 55/56 places, 71/75 transitions.
RANDOM walk for 40000 steps (8 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2937980 steps, run timeout after 3001 ms. (steps per millisecond=979 ) properties seen :0 out of 1
Probabilistic random walk after 2937980 steps, saw 446733 distinct states, run finished after 3001 ms. (steps per millisecond=979 ) properties seen :0
[2026-05-22 21:06:44] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2026-05-22 21:06:44] [INFO ] Invariant cache hit.
[2026-05-22 21:06:44] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/55 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/116 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/55 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/116 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/116 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 26 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/55 places, 71/71 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2026-05-22 21:06:44] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2026-05-22 21:06:44] [INFO ] Invariant cache hit.
[2026-05-22 21:06:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-22 21:06:44] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2026-05-22 21:06:44] [INFO ] Invariant cache hit.
[2026-05-22 21:06:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 21:06:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2026-05-22 21:06:44] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-22 21:06:44] [INFO ] Flow matrix only has 61 transitions (discarded 10 similar events)
[2026-05-22 21:06:44] [INFO ] Invariant cache hit.
[2026-05-22 21:06:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 61/116 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 77 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 61/116 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 65/142 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/116 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 148 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2649 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 55/55 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 4739ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 4742ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4896 ms. Remains : 55/55 places, 71/71 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 93 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 52 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 11 place count 52 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 51 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 51 transition count 59
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 51 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 50 transition count 58
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 50 transition count 58
Applied a total of 19 rules in 15 ms. Remains 50 /55 variables (removed 5) and now considering 58/71 (removed 13) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1957859988973916598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17545380809015874275.kers'
[2026-05-22 21:06:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1957859988973916598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17545380809015874275.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 58 rows 49 cols 136 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 21:06:49] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17545380809015874275.kers
Total runtime 0 ms.
[2026-05-22 21:06:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:06:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-22 21:06:49] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:06:49] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:06:49] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:06:49] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:06:49] [INFO ] Flatten gal took : 6 ms
[2026-05-22 21:06:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13746706680080925411.gal : 2 ms
[2026-05-22 21:06:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17463403010690877262.prop : 1 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/ReachabilityCardinality13746706680080925411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17463403010690877262.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 ...330
Loading property file /tmp/ReachabilityCardinality17463403010690877262.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 200
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :200 after 1000
Reachability property Champagne-PT-H05T0R-ReachabilityCardinality-2024-07 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,904754,0.704196,4580,2,219,11,1312,6,0,260,638,0
Total reachable state count : 904754

Verifying 1 reachability properties.
Reachability property Champagne-PT-H05T0R-ReachabilityCardinality-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Champagne-PT-H05T0R-ReachabilityCardinality-2024-07,529,1.40175,4588,2,91,11,1312,7,0,330,638,0
Over-approximation ignoring read arcs solved 0 properties in 1608 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 21:06:51] [INFO ] Flatten gal took : 27 ms
[2026-05-22 21:06:51] [INFO ] Applying decomposition
[2026-05-22 21:06:51] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4901680991944455876.txt' '-o' '/tmp/graph4901680991944455876.bin' '-w' '/tmp/graph4901680991944455876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4901680991944455876.bin' '-l' '-1' '-v' '-w' '/tmp/graph4901680991944455876.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:06:51] [INFO ] Decomposing Gal with order
[2026-05-22 21:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:06:51] [INFO ] Removed a total of 208 redundant transitions.
[2026-05-22 21:06:51] [INFO ] Flatten gal took : 164 ms
[2026-05-22 21:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 24 ms.
[2026-05-22 21:06:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8894081450954713386.gal : 18 ms
[2026-05-22 21:06:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16772545388060714348.prop : 0 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/ReachabilityCardinality8894081450954713386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16772545388060714348.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality16772545388060714348.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 415
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :415 after 4.63896e+09
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4.63896e+09 after 6.79751e+12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.39587e+18 after 6.50039e+18
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.20799e+18,3.48426,10120,1082,36,12045,532,634,16939,62,1221,0
Total reachable state count : 7207989591476460264

Verifying 1 reachability properties.
Reachability property Champagne-PT-H05T0R-ReachabilityCardinality-2024-07 is true.
FORMULA Champagne-PT-H05T0R-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Champagne-PT-H05T0R-ReachabilityCardinality-2024-07,368640,3.50312,10348,120,26,12045,532,677,16939,71,1221,3878
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 22549 ms.

BK_STOP 1779484015112

--------------------
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="Champagne-PT-H05T0R"
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 Champagne-PT-H05T0R, 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 r050-smll-177946901000030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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