Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339700310.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ErlangenMainframeV0-PT-0909, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339700310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 62M
-rw-r--r-- 1 mcc users 6.9K Jun 6 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 6 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 6 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 6 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 6 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Jun 6 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 61M Jun 5 20:08 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 ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749358531151

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0909
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 04:55: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]
[2025-06-08 04:55:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 04:55:34] [INFO ] Load time of PNML (sax parser for PT used): 2112 ms
[2025-06-08 04:55:34] [INFO ] Transformed 283 places.
[2025-06-08 04:55:35] [INFO ] Transformed 59341 transitions.
[2025-06-08 04:55:35] [INFO ] Found NUPN structural information;
[2025-06-08 04:55:35] [INFO ] Parsed PT model containing 283 places and 59341 transitions and 1260524 arcs in 2644 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 31810 ms. (1 steps per ms) remains 5/10 properties
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 14421 ms. (2 steps per ms) remains 5/5 properties
[2025-06-08 04:55:49] [INFO ] Flatten gal took : 11600 ms
BEST_FIRST walk for 40004 steps (8 resets) in 5053 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1472 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5333 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 13248 ms. (3 steps per ms) remains 5/5 properties
// Phase 1: matrix 59341 rows 283 cols
[2025-06-08 04:55:59] [INFO ] Computed 24 invariants in 1304 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 93/175 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 93/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 108/283 variables, 9/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 108/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-08 04:56:01] [INFO ] Flatten gal took : 12674 ms
[2025-06-08 04:56:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1798292664541300346.gal : 1117 ms
[2025-06-08 04:56:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3953281246992428584.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1798292664541300346.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3953281246992428584.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
SMT process timed out in 7033ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 59341/59341 transitions.
Graph (trivial) has 113 edges and 283 vertex of which 4 / 283 are part of one of the 2 SCC in 15 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 281 transition count 59312
Reduce places removed 25 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 44 rules applied. Total rules applied 70 place count 256 transition count 59293
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 89 place count 237 transition count 59293
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 89 place count 237 transition count 59280
Deduced a syphon composed of 13 places in 64 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 115 place count 224 transition count 59280
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 137 place count 202 transition count 59258
Iterating global reduction 3 with 22 rules applied. Total rules applied 159 place count 202 transition count 59258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 163 place count 198 transition count 43463
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 198 transition count 43463
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 194 transition count 11873
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 194 transition count 11873
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 10 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 237 place count 163 transition count 11842
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 163 transition count 11841
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 163 transition count 11830
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 260 place count 152 transition count 11830
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 152 transition count 11830
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 152 transition count 11830
Applied a total of 262 rules in 46793 ms. Remains 152 /283 variables (removed 131) and now considering 11830/59341 (removed 47511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46808 ms. Remains : 152/283 places, 11830/59341 transitions.
RANDOM walk for 40000 steps (8 resets) in 3672 ms. (10 steps per ms) remains 4/5 properties
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1747 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
[2025-06-08 04:56:54] [INFO ] Flow matrix only has 11827 transitions (discarded 3 similar events)
// Phase 1: matrix 11827 rows 152 cols
[2025-06-08 04:56:54] [INFO ] Computed 24 invariants in 118 ms
[2025-06-08 04:56:54] [INFO ] State equation strengthened by 3912 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/118 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/152 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11827/11979 variables, 152/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11979 variables, 3912/4088 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11979 variables, 0/4088 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/11979 variables, 0/4088 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11979/11979 variables, and 4088 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8211 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 152/152 constraints, ReadFeed: 3912/3912 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/118 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:05] [INFO ] Deduced a trap composed of 13 places in 2755 ms of which 93 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-08 is UNSAT
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 34/152 variables, 9/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality3953281246992428584.prop.
[2025-06-08 04:57:12] [INFO ] Deduced a trap composed of 9 places in 6365 ms of which 434 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:17] [INFO ] Deduced a trap composed of 14 places in 5128 ms of which 266 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:23] [INFO ] Deduced a trap composed of 15 places in 5573 ms of which 305 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:28] [INFO ] Deduced a trap composed of 15 places in 5337 ms of which 378 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:33] [INFO ] Deduced a trap composed of 17 places in 5424 ms of which 293 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:39] [INFO ] Deduced a trap composed of 16 places in 5230 ms of which 265 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:44] [INFO ] Deduced a trap composed of 18 places in 4971 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:49] [INFO ] Deduced a trap composed of 18 places in 5211 ms of which 364 ms to minimize.
SMT process timed out in 55227ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 11830/11830 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 152 transition count 11826
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 148 transition count 11824
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 146 transition count 11824
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 146 transition count 11822
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 144 transition count 11822
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 139 transition count 9227
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 138 transition count 9227
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 136 transition count 4907
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 136 transition count 4907
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 47 place count 128 transition count 4899
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 127 transition count 4467
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 126 transition count 4467
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 126 transition count 4465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 124 transition count 4465
Applied a total of 54 rules in 2287 ms. Remains 124 /152 variables (removed 28) and now considering 4465/11830 (removed 7365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2287 ms. Remains : 124/152 places, 4465/11830 transitions.
RANDOM walk for 40000 steps (8 resets) in 1336 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 167228 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 3
Probabilistic random walk after 167228 steps, saw 109125 distinct states, run finished after 3009 ms. (steps per millisecond=55 ) properties seen :0
[2025-06-08 04:57:55] [INFO ] Flow matrix only has 4461 transitions (discarded 4 similar events)
// Phase 1: matrix 4461 rows 124 cols
[2025-06-08 04:57:55] [INFO ] Computed 22 invariants in 52 ms
[2025-06-08 04:57:55] [INFO ] State equation strengthened by 1976 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/124 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4461/4585 variables, 124/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4585 variables, 1976/2122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4585 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/4585 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4585/4585 variables, and 2122 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 124/124 constraints, ReadFeed: 1976/1976 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/94 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:57] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:57:58] [INFO ] Deduced a trap composed of 11 places in 491 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/124 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:00] [INFO ] Deduced a trap composed of 8 places in 2146 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:02] [INFO ] Deduced a trap composed of 8 places in 2146 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:04] [INFO ] Deduced a trap composed of 12 places in 1712 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:06] [INFO ] Deduced a trap composed of 16 places in 1778 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:07] [INFO ] Deduced a trap composed of 10 places in 1811 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:09] [INFO ] Deduced a trap composed of 11 places in 1669 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:11] [INFO ] Deduced a trap composed of 11 places in 1822 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:13] [INFO ] Deduced a trap composed of 12 places in 1724 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:15] [INFO ] Deduced a trap composed of 13 places in 1721 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:16] [INFO ] Deduced a trap composed of 12 places in 1680 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:18] [INFO ] Deduced a trap composed of 16 places in 1907 ms of which 57 ms to minimize.
Problem ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-05 is UNSAT
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:20] [INFO ] Deduced a trap composed of 13 places in 1948 ms of which 67 ms to minimize.
Problem ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-15 is UNSAT
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 12/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4461/4585 variables, 124/160 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4585 variables, 1976/2136 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 04:58:24] [INFO ] Deduced a trap composed of 16 places in 1817 ms of which 51 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4585 variables, 1/2137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4585 variables, 0/2137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4585 variables, 0/2137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4585/4585 variables, and 2137 constraints, problems are : Problem set: 2 solved, 1 unsolved in 27700 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 124/124 constraints, ReadFeed: 1976/1976 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29655ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 200 ms.
Support contains 31 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 4465/4465 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 124 transition count 4454
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 113 transition count 4452
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 111 transition count 4452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 111 transition count 4450
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 109 transition count 4450
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 39 place count 100 transition count 3146
Iterating global reduction 3 with 9 rules applied. Total rules applied 48 place count 100 transition count 3146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 100 transition count 3145
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 99 transition count 3145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 97 transition count 2857
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 96 transition count 2857
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 94 transition count 1129
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 94 transition count 1129
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 81 place count 83 transition count 1118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 80 transition count 998
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 78 transition count 998
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 78 transition count 996
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 78 transition count 994
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 99 place count 76 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 76 transition count 989
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 76 transition count 989
Applied a total of 101 rules in 395 ms. Remains 76 /124 variables (removed 48) and now considering 989/4465 (removed 3476) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 76/124 places, 989/4465 transitions.
RANDOM walk for 40000 steps (8 resets) in 452 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 481833 steps, run visited all 1 properties in 1642 ms. (steps per millisecond=293 )
Probabilistic random walk after 481833 steps, saw 264337 distinct states, run finished after 1646 ms. (steps per millisecond=292 ) properties seen :1
FORMULA ErlangenMainframeV0-PT-0909-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 174909 ms.

BK_STOP 1749358707422

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV0-PT-0909"
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-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-0909, 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 r254-tall-174931339700310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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