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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 8.2K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:01 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 440K 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-H09T1U-ReachabilityCardinality-2024-00
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-01
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-02
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-03
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-04
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-05
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-06
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-07
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-08
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-09
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-10
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-11
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-12
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-13
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-14
FORMULA_NAME Champagne-PT-H09T1U-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779532038240

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-H09T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 10:27:20] [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-23 10:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:27:20] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2026-05-23 10:27:20] [INFO ] Transformed 1273 places.
[2026-05-23 10:27:20] [INFO ] Transformed 1915 transitions.
[2026-05-23 10:27:20] [INFO ] Found NUPN structural information;
[2026-05-23 10:27:20] [INFO ] Parsed PT model containing 1273 places and 1915 transitions and 5106 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (41 resets) in 2560 ms. (15 steps per ms) remains 2/14 properties
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 866 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2026-05-23 10:27:22] [INFO ] Flatten gal took : 477 ms
[2026-05-23 10:27:22] [INFO ] Flatten gal took : 150 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1019665302034079569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7366135177475924895.kers'
[2026-05-23 10:27:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1019665302034079569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7366135177475924895.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1915 rows 1273 cols 5106 entries
Finished phase 1 with 1224 SingleSign rule and 0 generalized
[2026-05-23 10:27:22] [INFO ] Computed 49 invariants in 18 ms
Computed 49 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-7366135177475924895.kers
Total runtime 25 ms.
[2026-05-23 10:27:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6886809905635846513.gal : 157 ms
[2026-05-23 10:27:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14591173095978525721.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/ReachabilityCardinality6886809905635846513.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14591173095978525721.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality14591173095978525721.prop.
At refinement iteration 2 (OVERLAPS) 497/520 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 497/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 753/1273 variables, 30/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 753/1322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1915/3188 variables, 1273/2595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3188 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 102
At refinement iteration 10 (OVERLAPS) 0/3188 variables, 0/2595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :102 after 4097
After SMT solving in domain Real declared 3188/3188 variables, and 2595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2488 ms.
Refiners :[Domain max(s): 1273/1273 constraints, Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 1273/1273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 497/520 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 497/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 753/1273 variables, 30/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 753/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1273 variables, 3/1327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1273 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1915/3188 variables, 1273/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3188 variables, 2/2602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4097 after 413344
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :413344 after 1.15274e+06
SMT process timed out in 8350ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 1273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 1915/1915 transitions.
Graph (trivial) has 1253 edges and 1273 vertex of which 384 / 1273 are part of one of the 43 SCC in 16 ms
SDD proceeding with computation,2 properties remain. new max is 512
Free SCC test removed 341 places
SDD size :1.15274e+06 after 1.15354e+06
Drop transitions (Empty/Sink Transition effects.) removed 411 transitions
Reduce isomorphic transitions removed 411 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 400 place count 932 transition count 1105
Reduce places removed 399 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 480 rules applied. Total rules applied 880 place count 533 transition count 1024
Reduce places removed 40 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 55 rules applied. Total rules applied 935 place count 493 transition count 1009
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 21 rules applied. Total rules applied 956 place count 478 transition count 1003
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 959 place count 475 transition count 1003
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.15354e+06 after 1.15557e+06
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 959 place count 475 transition count 995
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 975 place count 467 transition count 995
Discarding 154 places :
Symmetric choice reduction at 5 with 154 rule applications. Total rules 1129 place count 313 transition count 841
Iterating global reduction 5 with 154 rules applied. Total rules applied 1283 place count 313 transition count 841
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 1283 place count 313 transition count 807
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 1351 place count 279 transition count 807
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 1380 place count 250 transition count 593
Iterating global reduction 5 with 29 rules applied. Total rules applied 1409 place count 250 transition count 593
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1438 place count 250 transition count 564
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.15557e+06 after 1.1585e+06
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 1570 place count 184 transition count 498
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1582 place count 178 transition count 538
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1611 place count 178 transition count 509
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1612 place count 177 transition count 502
Iterating global reduction 7 with 1 rules applied. Total rules applied 1613 place count 177 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1614 place count 177 transition count 501
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1618 place count 177 transition count 497
Free-agglomeration rule applied 86 times.
Iterating global reduction 8 with 86 rules applied. Total rules applied 1704 place count 177 transition count 411
Reduce places removed 86 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Iterating post reduction 8 with 324 rules applied. Total rules applied 2028 place count 91 transition count 173
Ensure Unique test removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 2030 place count 89 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2037 place count 89 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2038 place count 89 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2039 place count 88 transition count 165
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 10 with 76 rules applied. Total rules applied 2115 place count 62 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 11 with 42 rules applied. Total rules applied 2157 place count 62 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 2158 place count 62 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2159 place count 61 transition count 72
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 2164 place count 61 transition count 67
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2170 place count 55 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 2172 place count 55 transition count 65
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 2177 place count 55 transition count 65
Applied a total of 2177 rules in 374 ms. Remains 55 /1273 variables (removed 1218) and now considering 65/1915 (removed 1850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 55/1273 places, 65/1915 transitions.
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/2 properties
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 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-14754105521941365974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4733899172591897304.kers'
[2026-05-23 10:27:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14754105521941365974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4733899172591897304.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 134 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-23 10:27:31] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4733899172591897304.kers
Total runtime 6 ms.
[2026-05-23 10:27:31] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.1585e+06 after 1.17542e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/10 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/33 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/35 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/35 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 17/52 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/52 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/56 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/56 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/120 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 9/20 constraints, State Equation: 27/55 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/10 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/33 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/35 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/35 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 17/52 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/52 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/56 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/56 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/67 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/67 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 17/84 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/84 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 36/120 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/120 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/120 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA Champagne-PT-H09T1U-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 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 11246 ms.

BK_STOP 1779532051615

--------------------
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-H09T1U"
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-H09T1U, 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-177946901100134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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