Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900430.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 MedleyB-PT-B01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 155K 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 MedleyB-PT-B01-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B01-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749386108204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 12:35:09] [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 12:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:35:09] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-08 12:35:09] [INFO ] Transformed 925 places.
[2025-06-08 12:35:09] [INFO ] Transformed 1037 transitions.
[2025-06-08 12:35:09] [INFO ] Found NUPN structural information;
[2025-06-08 12:35:09] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (601 resets) in 1388 ms. (28 steps per ms) remains 7/12 properties
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (163 resets) in 349 ms. (114 steps per ms) remains 7/7 properties
[2025-06-08 12:35:10] [INFO ] Flatten gal took : 226 ms
BEST_FIRST walk for 40002 steps (164 resets) in 362 ms. (110 steps per ms) remains 7/7 properties
[2025-06-08 12:35:10] [INFO ] Flatten gal took : 63 ms
BEST_FIRST walk for 40003 steps (152 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
[2025-06-08 12:35:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11854259437740523588.gal : 68 ms
BEST_FIRST walk for 40003 steps (164 resets) in 262 ms. (152 steps per ms) remains 7/7 properties
[2025-06-08 12:35:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17045551942498127924.prop : 7 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/ReachabilityCardinality11854259437740523588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17045551942498127924.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (163 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17045551942498127924.prop.
BEST_FIRST walk for 40004 steps (163 resets) in 671 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (156 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
// Phase 1: matrix 1037 rows 925 cols
[2025-06-08 12:35:10] [INFO ] Computed 4 invariants in 29 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.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :13 after 16
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :16 after 39
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :39 after 43
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :43 after 80
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :80 after 2713
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :2713 after 10807
At refinement iteration 2 (OVERLAPS) 849/925 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Reachability property MedleyB-PT-B01-ReachabilityCardinality-2025-01 is true.
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :10807 after 53995
At refinement iteration 3 (INCLUDED_ONLY) 0/925 variables, 849/929 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :53995 after 76258
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 0/929 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Invariant property MedleyB-PT-B01-ReachabilityCardinality-2025-00 does not hold.
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :76258 after 3.6438e+06
At refinement iteration 5 (OVERLAPS) 1037/1962 variables, 925/1854 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1962 variables, 0/1854 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1962 variables, 0/1854 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 1854 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1346 ms.
Refiners :[Domain max(s): 925/925 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 925/925 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 861/925 variables, 4/68 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/925 variables, 861/929 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:13] [INFO ] Deduced a trap composed of 481 places in 948 ms of which 345 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:14] [INFO ] Deduced a trap composed of 395 places in 514 ms of which 228 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:14] [INFO ] Deduced a trap composed of 395 places in 479 ms of which 222 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3.6438e+06 after 3.74669e+06
[2025-06-08 12:35:15] [INFO ] Deduced a trap composed of 395 places in 479 ms of which 245 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:15] [INFO ] Deduced a trap composed of 395 places in 308 ms of which 133 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 5/934 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:16] [INFO ] Deduced a trap composed of 396 places in 513 ms of which 283 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:16] [INFO ] Deduced a trap composed of 396 places in 334 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:17] [INFO ] Deduced a trap composed of 395 places in 348 ms of which 137 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/1962 variables, and 937 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5014 ms.
Refiners :[Domain max(s): 925/925 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/925 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6491ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Graph (trivial) has 779 edges and 925 vertex of which 48 / 925 are part of one of the 8 SCC in 6 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 1187 edges and 885 vertex of which 880 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 556 rules applied. Total rules applied 558 place count 880 transition count 427
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 561 rules applied. Total rules applied 1119 place count 326 transition count 420
Reduce places removed 3 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 2 with 50 rules applied. Total rules applied 1169 place count 323 transition count 373
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 1216 place count 276 transition count 373
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1216 place count 276 transition count 335
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1292 place count 238 transition count 335
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1327 place count 203 transition count 300
Iterating global reduction 4 with 35 rules applied. Total rules applied 1362 place count 203 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1364 place count 203 transition count 298
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1373 place count 194 transition count 263
Iterating global reduction 5 with 9 rules applied. Total rules applied 1382 place count 194 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1383 place count 194 transition count 262
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1385 place count 192 transition count 260
Iterating global reduction 6 with 2 rules applied. Total rules applied 1387 place count 192 transition count 260
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1388 place count 191 transition count 259
Iterating global reduction 6 with 1 rules applied. Total rules applied 1389 place count 191 transition count 259
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1405 place count 183 transition count 251
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1407 place count 181 transition count 249
Iterating global reduction 6 with 2 rules applied. Total rules applied 1409 place count 181 transition count 249
Performed 7 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1423 place count 174 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1425 place count 174 transition count 262
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 174 transition count 240
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1473 place count 152 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1474 place count 152 transition count 235
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1478 place count 152 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1480 place count 152 transition count 233
Applied a total of 1480 rules in 206 ms. Remains 152 /925 variables (removed 773) and now considering 233/1037 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 152/925 places, 233/1037 transitions.
RANDOM walk for 40000 steps (1348 resets) in 226 ms. (176 steps per ms) remains 1/5 properties
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (360 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
// Phase 1: matrix 233 rows 152 cols
[2025-06-08 12:35:17] [INFO ] Computed 3 invariants in 1 ms
[2025-06-08 12:35:17] [INFO ] State equation strengthened by 62 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/307 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/352 variables, 22/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/375 variables, 13/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/384 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/385 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/385 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/0 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/307 variables, 110/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/352 variables, 22/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/375 variables, 13/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/384 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/385 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:35:18] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/385 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/385 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 152/152 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 30 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 233/233 transitions.
Graph (trivial) has 60 edges and 152 vertex of which 2 / 152 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 311 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 150 transition count 202
Reduce places removed 27 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 123 transition count 195
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 73 place count 116 transition count 193
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 73 place count 116 transition count 186
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 109 transition count 186
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 106 transition count 183
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 106 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 105 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 105 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 104 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 104 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 109 place count 98 transition count 175
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 114 place count 98 transition count 170
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 119 place count 93 transition count 165
Iterating global reduction 4 with 5 rules applied. Total rules applied 124 place count 93 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 128 place count 93 transition count 161
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 131 place count 90 transition count 158
Iterating global reduction 5 with 3 rules applied. Total rules applied 134 place count 90 transition count 158
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 88 transition count 156
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 88 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 150 place count 88 transition count 144
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 154 place count 88 transition count 140
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 158 place count 84 transition count 140
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 84 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 84 transition count 139
Applied a total of 160 rules in 53 ms. Remains 84 /152 variables (removed 68) and now considering 139/233 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 84/152 places, 139/233 transitions.
RANDOM walk for 8845 steps (458 resets) in 43 ms. (201 steps per ms) remains 0/1 properties
FORMULA MedleyB-PT-B01-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 8993 ms.

BK_STOP 1749386118467

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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-174931339900430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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