Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000150.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 MedleyA-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 82K May 29 14:32 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 MedleyA-PT-07-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyA-PT-07-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748849377814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 07:29:40] [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-02 07:29:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:29:40] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-06-02 07:29:40] [INFO ] Transformed 145 places.
[2025-06-02 07:29:40] [INFO ] Transformed 287 transitions.
[2025-06-02 07:29:40] [INFO ] Found NUPN structural information;
[2025-06-02 07:29:40] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:29:42] [INFO ] Flatten gal took : 189 ms
[2025-06-02 07:29:42] [INFO ] Flatten gal took : 63 ms
[2025-06-02 07:29:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7327896046580820169.gal : 38 ms
[2025-06-02 07:29:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9817300387146185709.prop : 8 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/ReachabilityCardinality7327896046580820169.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9817300387146185709.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (1409 resets) in 3164 ms. (12 steps per ms) remains 11/13 properties
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

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
Loading property file /tmp/ReachabilityCardinality9817300387146185709.prop.
BEST_FIRST walk for 40003 steps (311 resets) in 456 ms. (87 steps per ms) remains 11/11 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :20 after 34
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :34 after 66
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :66 after 1955
Invariant property MedleyA-PT-07-ReachabilityCardinality-2025-08 does not hold.
Invariant property MedleyA-PT-07-ReachabilityCardinality-2025-06 does not hold.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-07-ReachabilityCardinality-2025-01 does not hold.
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :1955 after 4459
BEST_FIRST walk for 40002 steps (327 resets) in 1001 ms. (39 steps per ms) remains 11/11 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :4459 after 5976
BEST_FIRST walk for 40003 steps (425 resets) in 326 ms. (122 steps per ms) remains 11/11 properties
Reachability property MedleyA-PT-07-ReachabilityCardinality-2025-13 is true.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :5976 after 29905
BEST_FIRST walk for 40003 steps (317 resets) in 1065 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (387 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (316 resets) in 249 ms. (160 steps per ms) remains 11/11 properties
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :29905 after 71050
BEST_FIRST walk for 40004 steps (311 resets) in 287 ms. (138 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (294 resets) in 285 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (290 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (329 resets) in 253 ms. (157 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (330 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
Invariant property MedleyA-PT-07-ReachabilityCardinality-2025-10 does not hold.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-07-ReachabilityCardinality-2025-05 does not hold.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
// Phase 1: matrix 285 rows 143 cols
[2025-06-02 07:29:43] [INFO ] Computed 11 invariants in 23 ms
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.
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :71050 after 113634
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 49/117 variables, 6/74 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 49/123 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/124 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 26/143 variables, 4/128 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 26/154 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 285/428 variables, 143/297 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 297 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1544 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem MedleyA-PT-07-ReachabilityCardinality-2025-15 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 51/113 variables, 6/68 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 51/119 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/120 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:45] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:46] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 2/122 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property MedleyA-PT-07-ReachabilityCardinality-2025-00 does not hold.
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :113634 after 212599
[2025-06-02 07:29:46] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/123 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem MedleyA-PT-07-ReachabilityCardinality-2025-04 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 30/143 variables, 4/127 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 30/157 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:46] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:46] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:46] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:47] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:47] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:47] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:47] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 7/164 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/164 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 285/428 variables, 143/307 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 3/310 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:47] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 1/311 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:48] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:48] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 2/313 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :212599 after 503189
[2025-06-02 07:29:50] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 314 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5008 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6756ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 285/285 transitions.
Graph (complete) has 445 edges and 143 vertex of which 140 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 140 transition count 273
Reduce places removed 8 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 132 transition count 266
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 125 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 34 place count 125 transition count 263
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 122 transition count 263
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 57 place count 105 transition count 242
Iterating global reduction 3 with 17 rules applied. Total rules applied 74 place count 105 transition count 242
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 92 place count 96 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 96 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 94 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 94 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 109 place count 94 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 93 transition count 224
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 114 place count 93 transition count 221
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 90 transition count 221
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 90 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 89 transition count 220
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 123 place count 89 transition count 220
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 89 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 88 transition count 219
Applied a total of 125 rules in 206 ms. Remains 88 /143 variables (removed 55) and now considering 219/285 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 88/143 places, 219/285 transitions.
RANDOM walk for 40000 steps (2534 resets) in 436 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (642 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (604 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (479 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (539 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1347202 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :3 out of 4
Probabilistic random walk after 1347202 steps, saw 236811 distinct states, run finished after 3011 ms. (steps per millisecond=447 ) properties seen :3
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 219 rows 88 cols
[2025-06-02 07:29:54] [INFO ] Computed 10 invariants in 3 ms
[2025-06-02 07:29:54] [INFO ] State equation strengthened by 67 read => feed constraints.
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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/77 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/284 variables, 77/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 66/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/299 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/301 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/307 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/307 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/77 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:54] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:54] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:54] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 207/284 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 66/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/299 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/301 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/307 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:55] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:55] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:55] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:55] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/307 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/307 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1677ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 9 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 219/219 transitions.
Graph (complete) has 302 edges and 88 vertex of which 84 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 84 transition count 200
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 28 place count 75 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 74 transition count 199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 29 place count 74 transition count 196
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 71 transition count 196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 39 place count 67 transition count 191
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 67 transition count 191
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 63 place count 57 transition count 181
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 53 transition count 190
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 53 transition count 185
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 81 place count 48 transition count 185
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 82 place count 48 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 48 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 46 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 45 transition count 184
Applied a total of 87 rules in 84 ms. Remains 45 /88 variables (removed 43) and now considering 184/219 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 45/88 places, 184/219 transitions.
RANDOM walk for 40000 steps (4716 resets) in 1330 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1070 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :503189 after 632387
Probably explored full state space saw : 72660 states, properties seen :0
Probabilistic random walk after 407373 steps, saw 72660 distinct states, run finished after 614 ms. (steps per millisecond=663 ) properties seen :0
Explored full state space saw : 72660 states, properties seen :0
Exhaustive walk after 407373 steps, saw 72660 distinct states, run finished after 563 ms. (steps per millisecond=723 ) properties seen :0
FORMULA MedleyA-PT-07-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_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 17158 ms.

BK_STOP 1748849397686

--------------------
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="MedleyA-PT-07"
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 MedleyA-PT-07, 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 r128-smll-174876524000150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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