fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931340000510
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyB-PT-B11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 29967.00 0.00 0.00 TFFFTFFFFTTTFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 12:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 6 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 6 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 09:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 6 09:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:15 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 36M 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-B11-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B11-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749406086942

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-B11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 18:08:08] [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 18:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 18:08:10] [INFO ] Load time of PNML (sax parser for PT used): 1510 ms
[2025-06-08 18:08:10] [INFO ] Transformed 2737 places.
[2025-06-08 18:08:10] [INFO ] Transformed 42767 transitions.
[2025-06-08 18:08:10] [INFO ] Found NUPN structural information;
[2025-06-08 18:08:10] [INFO ] Parsed PT model containing 2737 places and 42767 transitions and 723915 arcs in 1911 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (238 resets) in 5373 ms. (7 steps per ms) remains 8/15 properties
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 524 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 309 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (29 resets) in 786 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 423 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (29 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 504 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 293 ms. (136 steps per ms) remains 8/8 properties
// Phase 1: matrix 42767 rows 2737 cols
[2025-06-08 18:08:15] [INFO ] Computed 10 invariants in 1203 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/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2652/2718 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2718 variables, 2652/2727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2718 variables, 0/2727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/2737 variables, 1/2728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2737 variables, 19/2747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2737 variables, 0/2747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-08 18:08:17] [INFO ] Flatten gal took : 4780 ms
SMT process timed out in 6870ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 2737 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2737/2737 places, 42767/42767 transitions.
Graph (trivial) has 2601 edges and 2737 vertex of which 144 / 2737 are part of one of the 23 SCC in 19 ms
Free SCC test removed 121 places
Drop transitions (Empty/Sink Transition effects.) removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Graph (complete) has 4705 edges and 2616 vertex of which 2598 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.139 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
[2025-06-08 18:08:21] [INFO ] Flatten gal took : 3648 ms
Drop transitions (Trivial Post-Agglo cleanup.) removed 1955 transitions
Trivial Post-agglo rules discarded 1955 transitions
Performed 1955 trivial Post agglomeration. Transition count delta: 1955
Iterating post reduction 0 with 1964 rules applied. Total rules applied 1966 place count 2598 transition count 40636
Reduce places removed 1955 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 2012 rules applied. Total rules applied 3978 place count 643 transition count 40579
Reduce places removed 22 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 66 rules applied. Total rules applied 4044 place count 621 transition count 40535
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
[2025-06-08 18:08:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10382040656786664022.gal : 704 ms
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 46 rules applied. Total rules applied 4090 place count 577 transition count 40533
[2025-06-08 18:08:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17520471075486943259.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/ReachabilityCardinality10382040656786664022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17520471075486943259.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 ...330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4091 place count 576 transition count 40533
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 99 Pre rules applied. Total rules applied 4091 place count 576 transition count 40434
Deduced a syphon composed of 99 places in 25 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 5 with 198 rules applied. Total rules applied 4289 place count 477 transition count 40434
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 4383 place count 383 transition count 40340
Iterating global reduction 5 with 94 rules applied. Total rules applied 4477 place count 383 transition count 40340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 4481 place count 383 transition count 40336
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4483 place count 381 transition count 40336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4483 place count 381 transition count 40335
Deduced a syphon composed of 1 places in 34 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4485 place count 380 transition count 40335
Discarding 43 places :
Symmetric choice reduction at 7 with 43 rule applications. Total rules 4528 place count 337 transition count 2206
Iterating global reduction 7 with 43 rules applied. Total rules applied 4571 place count 337 transition count 2206
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 4591 place count 337 transition count 2186
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 4595 place count 333 transition count 2182
Iterating global reduction 8 with 4 rules applied. Total rules applied 4599 place count 333 transition count 2182
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 4603 place count 329 transition count 2178
Iterating global reduction 8 with 4 rules applied. Total rules applied 4607 place count 329 transition count 2178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 4610 place count 329 transition count 2175
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 4676 place count 296 transition count 2142
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4677 place count 296 transition count 2141
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 4686 place count 287 transition count 2132
Iterating global reduction 10 with 9 rules applied. Total rules applied 4695 place count 287 transition count 2132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 4700 place count 282 transition count 2127
Iterating global reduction 10 with 5 rules applied. Total rules applied 4705 place count 282 transition count 2127
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 4709 place count 278 transition count 2123
Iterating global reduction 10 with 4 rules applied. Total rules applied 4713 place count 278 transition count 2123
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 4723 place count 273 transition count 2141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4724 place count 273 transition count 2140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 4728 place count 273 transition count 2136
Free-agglomeration rule applied 72 times.
Iterating global reduction 11 with 72 rules applied. Total rules applied 4800 place count 273 transition count 2064
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 11 with 72 rules applied. Total rules applied 4872 place count 201 transition count 2064
Renaming transitions due to excessive name length > 1024 char.
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 4879 place count 194 transition count 2057
Iterating global reduction 12 with 7 rules applied. Total rules applied 4886 place count 194 transition count 2057
Drop transitions (Redundant composition of simpler transitions.) removed 770 transitions
Redundant transition composition rules discarded 770 transitions
Iterating global reduction 12 with 770 rules applied. Total rules applied 5656 place count 194 transition count 1287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 5658 place count 194 transition count 1285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 5660 place count 192 transition count 1285
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 5670 place count 192 transition count 1285
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 5678 place count 192 transition count 1277
Applied a total of 5678 rules in 7764 ms. Remains 192 /2737 variables (removed 2545) and now considering 1277/42767 (removed 41490) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7774 ms. Remains : 192/2737 places, 1277/42767 transitions.
RANDOM walk for 40000 steps (815 resets) in 2378 ms. (16 steps per ms) remains 4/8 properties
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (92 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
// Phase 1: matrix 1277 rows 192 cols
[2025-06-08 18:08:29] [INFO ] Computed 10 invariants in 9 ms
[2025-06-08 18:08:29] [INFO ] State equation strengthened by 1113 read => feed constraints.
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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 149/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 33/192 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1277/1469 variables, 192/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1469 variables, 1113/1315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1469 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1469/1469 variables, and 1315 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 1113/1113 constraints, PredecessorRefiner: 4/3 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 149/159 variables, 7/7 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 18:08:30] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:31] [INFO ] Deduced a trap composed of 26 places in 290 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:31] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:31] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:31] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:32] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:32] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:32] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 33/192 variables, 3/18 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 18:08:33] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1277/1469 variables, 192/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1469 variables, 1113/1324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1469 variables, 3/1327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1469 variables, 0/1327 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 18:08:34] [INFO ] Deduced a trap composed of 17 places in 393 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 18:08:35] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 28 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1469 variables, 2/1329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1469 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1469 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1469/1469 variables, and 1329 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, ReadFeed: 1113/1113 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7359ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 613 steps, including 33 resets, run visited all 4 properties in 20 ms. (steps per millisecond=30 )
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B11-ReachabilityCardinality-2025-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 30 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 28144 ms.

BK_STOP 1749406116909

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyB-PT-B11"
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-B11, 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-174931340000510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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