fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074400750
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for HirschbergSinclair-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
510.384 8355.00 22824.00 47.70 FFTTFFFFFFTFTTTT 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.r146-tall-177961074400750.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 HirschbergSinclair-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400750
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 173K 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 HirschbergSinclair-PT-15-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779751733069

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 23:28:54] [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-25 23:28:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:28:54] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2026-05-25 23:28:54] [INFO ] Transformed 330 places.
[2026-05-25 23:28:54] [INFO ] Transformed 296 transitions.
[2026-05-25 23:28:54] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 23:28:54] [INFO ] Flatten gal took : 128 ms
[2026-05-25 23:28:54] [INFO ] Flatten gal took : 28 ms
RANDOM walk for 40000 steps (133 resets) in 1543 ms. (25 steps per ms) remains 6/16 properties
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 23:28:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10229149112230800657.gal : 22 ms
[2026-05-25 23:28:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality661587534783881319.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/ReachabilityCardinality10229149112230800657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality661587534783881319.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 ...328
BEST_FIRST walk for 40003 steps (20 resets) in 308 ms. (129 steps per ms) remains 5/6 properties
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality661587534783881319.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 17
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :17 after 58
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :58 after 642
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :642 after 9266
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :9266 after 5.61668e+06
BEST_FIRST walk for 40004 steps (20 resets) in 319 ms. (125 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :5.61668e+06 after 1.12337e+07
BEST_FIRST walk for 40001 steps (17 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.12337e+07 after 2.041e+07
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.041e+07 after 9.17151e+08
BEST_FIRST walk for 40003 steps (17 resets) in 245 ms. (162 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 400 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16441384723823302561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1223987733034631925.kers'
[2026-05-25 23:28:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16441384723823302561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1223987733034631925.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 330 cols 906 entries
Finished phase 1 with 279 SingleSign rule and 17 generalized
[2026-05-25 23:28:55] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1223987733034631925.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 149/237 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/240 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-10 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 77/317 variables, 13/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/613 variables, 317/351 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 0/351 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/626 variables, 13/364 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 0/364 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/626 variables, 0/364 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 626/626 variables, and 364 constraints, problems are : Problem set: 4 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 156/174 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/21 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/194 variables, 7/28 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/208 variables, 1/29 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 107/315 variables, 18/47 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/47 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 296/611 variables, 315/362 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/611 variables, 1/363 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/611 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/626 variables, 15/378 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 1/379 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 0/379 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/626 variables, 0/379 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 626/626 variables, and 379 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2058ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 18 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 296/296 transitions.
Graph (complete) has 628 edges and 330 vertex of which 312 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 312 transition count 183
Reduce places removed 107 places and 0 transitions.
Graph (complete) has 339 edges and 205 vertex of which 177 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 112 rules applied. Total rules applied 226 place count 177 transition count 179
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 258 place count 173 transition count 151
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 260 place count 171 transition count 149
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 171 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 263 place count 170 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 170 transition count 148
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 279 place count 170 transition count 133
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 294 place count 155 transition count 133
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 307 place count 142 transition count 120
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 313 place count 139 transition count 117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 316 place count 136 transition count 117
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 316 place count 136 transition count 101
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 348 place count 120 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 350 place count 119 transition count 100
Applied a total of 350 rules in 90 ms. Remains 119 /330 variables (removed 211) and now considering 100/296 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 119/330 places, 100/296 transitions.
RANDOM walk for 40000 steps (396 resets) in 648 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (115 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2158447 steps, run timeout after 3001 ms. (steps per millisecond=719 ) properties seen :0 out of 1
Probabilistic random walk after 2158447 steps, saw 358609 distinct states, run finished after 3008 ms. (steps per millisecond=717 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5048674706832642994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5759298577739570116.kers'
[2026-05-25 23:29:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5048674706832642994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5759298577739570116.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 100 rows 111 cols 227 entries
Finished phase 1 with 91 SingleSign rule and 9 generalized
[2026-05-25 23:29:00] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5759298577739570116.kers
Total runtime 3 ms.
[2026-05-25 23:29:00] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/115 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/215 variables, 115/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/219 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 119/119 constraints, ReadFeed: 5/5 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/115 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/215 variables, 115/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/219 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 119/119 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 455ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 34 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3 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 7222 ms.

BK_STOP 1779751741424

--------------------
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="HirschbergSinclair-PT-15"
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 HirschbergSinclair-PT-15, 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 r146-tall-177961074400750"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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