Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 6 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 6 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:12 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 3.4M 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-B07-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B07-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749397308261

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-B07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 15:41:49] [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 15:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 15:41:50] [INFO ] Load time of PNML (sax parser for PT used): 450 ms
[2025-06-08 15:41:50] [INFO ] Transformed 2133 places.
[2025-06-08 15:41:50] [INFO ] Transformed 6753 transitions.
[2025-06-08 15:41:50] [INFO ] Found NUPN structural information;
[2025-06-08 15:41:50] [INFO ] Parsed PT model containing 2133 places and 6753 transitions and 67789 arcs in 662 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-B07-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (304 resets) in 1730 ms. (23 steps per ms) remains 9/11 properties
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (46 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 404 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 389 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 539 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 655 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (44 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 262 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
// Phase 1: matrix 6753 rows 2133 cols
[2025-06-08 15:41:52] [INFO ] Flatten gal took : 1312 ms
[2025-06-08 15:41:52] [INFO ] Computed 8 invariants in 263 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-08 15:41:53] [INFO ] Flatten gal took : 601 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 15:41:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11086777222097533472.gal : 207 ms
[2025-06-08 15:41:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6406608766624746846.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/ReachabilityCardinality11086777222097533472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6406608766624746846.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 ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem MedleyB-PT-B07-ReachabilityCardinality-2025-09 is UNSAT
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1990/2114 variables, 7/131 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2114 variables, 1990/2121 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2114 variables, 0/2121 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/2133 variables, 1/2122 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2133 variables, 19/2141 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2133 variables, 0/2141 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality6406608766624746846.prop.
At refinement iteration 8 (OVERLAPS) 6753/8886 variables, 2133/4274 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8886/8886 variables, and 4274 constraints, problems are : Problem set: 1 solved, 8 unsolved in 7279 ms.
Refiners :[Domain max(s): 2133/2133 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 2133/2133 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2051/2114 variables, 7/70 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2114 variables, 2051/2121 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:04] [INFO ] Deduced a trap composed of 395 places in 3304 ms of which 878 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:07] [INFO ] Deduced a trap composed of 395 places in 3075 ms of which 542 ms to minimize.
SMT process timed out in 15203ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 63 out of 2133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2133/2133 places, 6753/6753 transitions.
Graph (trivial) has 1981 edges and 2133 vertex of which 116 / 2133 are part of one of the 19 SCC in 8 ms
Free SCC test removed 97 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 3353 edges and 2036 vertex of which 2023 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.73 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1479 transitions
Trivial Post-agglo rules discarded 1479 transitions
Performed 1479 trivial Post agglomeration. Transition count delta: 1479
Iterating post reduction 0 with 1485 rules applied. Total rules applied 1487 place count 2023 transition count 5136
Reduce places removed 1479 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 1518 rules applied. Total rules applied 3005 place count 544 transition count 5097
Reduce places removed 17 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 2 with 63 rules applied. Total rules applied 3068 place count 527 transition count 5051
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 3114 place count 481 transition count 5051
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 3114 place count 481 transition count 4968
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 3280 place count 398 transition count 4968
Discarding 78 places :
Symmetric choice reduction at 4 with 78 rule applications. Total rules 3358 place count 320 transition count 4890
Iterating global reduction 4 with 78 rules applied. Total rules applied 3436 place count 320 transition count 4890
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3439 place count 320 transition count 4887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3439 place count 320 transition count 4886
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3441 place count 319 transition count 4886
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 3469 place count 291 transition count 962
Iterating global reduction 5 with 28 rules applied. Total rules applied 3497 place count 291 transition count 962
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 3506 place count 291 transition count 953
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 3513 place count 284 transition count 946
Iterating global reduction 6 with 7 rules applied. Total rules applied 3520 place count 284 transition count 946
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 3525 place count 279 transition count 941
Iterating global reduction 6 with 5 rules applied. Total rules applied 3530 place count 279 transition count 941
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3535 place count 279 transition count 936
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 3585 place count 254 transition count 911
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3592 place count 247 transition count 904
Iterating global reduction 7 with 7 rules applied. Total rules applied 3599 place count 247 transition count 904
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 3604 place count 242 transition count 899
Iterating global reduction 7 with 5 rules applied. Total rules applied 3609 place count 242 transition count 899
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3612 place count 239 transition count 896
Iterating global reduction 7 with 3 rules applied. Total rules applied 3615 place count 239 transition count 896
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3623 place count 235 transition count 911
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3624 place count 235 transition count 910
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 3626 place count 235 transition count 908
Free-agglomeration rule applied 59 times.
Iterating global reduction 8 with 59 rules applied. Total rules applied 3685 place count 235 transition count 849
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 8 with 59 rules applied. Total rules applied 3744 place count 176 transition count 849
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 3749 place count 171 transition count 844
Iterating global reduction 9 with 5 rules applied. Total rules applied 3754 place count 171 transition count 844
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 9 with 133 rules applied. Total rules applied 3887 place count 171 transition count 711
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3888 place count 171 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3889 place count 170 transition count 710
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 3897 place count 170 transition count 710
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3902 place count 170 transition count 705
Applied a total of 3902 rules in 2558 ms. Remains 170 /2133 variables (removed 1963) and now considering 705/6753 (removed 6048) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2569 ms. Remains : 170/2133 places, 705/6753 transitions.
RANDOM walk for 40000 steps (1200 resets) in 1224 ms. (32 steps per ms) remains 7/8 properties
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (159 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (166 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (162 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (163 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (165 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (154 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (160 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
// Phase 1: matrix 705 rows 170 cols
[2025-06-08 15:42:10] [INFO ] Computed 7 invariants in 8 ms
[2025-06-08 15:42:10] [INFO ] State equation strengthened by 510 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 99/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 694/852 variables, 158/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 260/425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 18/870 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/870 variables, 249/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/870 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 5/875 variables, 4/686 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/875 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/875 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/875 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 875/875 variables, and 687 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 510/510 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 99/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:14] [INFO ] Deduced a trap composed of 31 places in 501 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:14] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:14] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 14 ms to minimize.
Problem MedleyB-PT-B07-ReachabilityCardinality-2025-10 is UNSAT
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:14] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:15] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:15] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:15] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :14 after 20
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :20 after 22
SDD proceeding with computation,9 properties remain. new max is 256
At refinement iteration 7 (OVERLAPS) 694/852 variables, 158/172 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD size :22 after 245
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :245 after 5620
At refinement iteration 8 (INCLUDED_ONLY) 0/852 variables, 260/432 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 3/435 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 18/870 variables, 8/443 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/870 variables, 249/692 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/870 variables, 2/694 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :5620 after 37184
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :37184 after 38398
At refinement iteration 14 (INCLUDED_ONLY) 0/870 variables, 0/694 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 5/875 variables, 4/698 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :38398 after 39690
At refinement iteration 16 (INCLUDED_ONLY) 0/875 variables, 1/699 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :39690 after 141188
At refinement iteration 17 (INCLUDED_ONLY) 0/875 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/875 variables, 0/699 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 875/875 variables, and 699 constraints, problems are : Problem set: 1 solved, 6 unsolved in 4626 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 510/510 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7220ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :141188 after 759388
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 274 ms.
Support contains 32 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 705/705 transitions.
Graph (trivial) has 65 edges and 170 vertex of which 2 / 170 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 169 transition count 675
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 34 rules applied. Total rules applied 63 place count 141 transition count 669
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 137 transition count 669
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 67 place count 137 transition count 667
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 135 transition count 667
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 75 place count 131 transition count 663
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 131 transition count 663
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 93 place count 124 transition count 656
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 190 place count 124 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 121 transition count 556
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 121 transition count 556
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 204 place count 121 transition count 548
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 205 place count 120 transition count 547
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 120 transition count 547
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 119 transition count 546
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 119 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 5 with 69 rules applied. Total rules applied 277 place count 119 transition count 477
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 285 place count 119 transition count 469
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 293 place count 111 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 294 place count 111 transition count 468
Applied a total of 294 rules in 132 ms. Remains 111 /170 variables (removed 59) and now considering 468/705 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 111/170 places, 468/705 transitions.
RANDOM walk for 40000 steps (1231 resets) in 329 ms. (121 steps per ms) remains 3/4 properties
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (205 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (178 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (187 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
// Phase 1: matrix 468 rows 111 cols
[2025-06-08 15:42:18] [INFO ] Computed 7 invariants in 2 ms
[2025-06-08 15:42:18] [INFO ] State equation strengthened by 369 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 456/555 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 200/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/573 variables, 7/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 168/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/579 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/579 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 487 constraints, problems are : Problem set: 0 solved, 3 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:19] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:19] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 456/555 variables, 99/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 200/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 18/573 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 168/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 6/579 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/579 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/579 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 491 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1679ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 25 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 468/468 transitions.
Graph (trivial) has 27 edges and 111 vertex of which 4 / 111 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 109 transition count 460
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 105 transition count 460
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 104 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 104 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 103 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 103 transition count 458
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 99 transition count 454
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 99 transition count 453
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 96 transition count 450
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 96 transition count 450
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 94 transition count 448
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 94 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 94 transition count 447
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 39 place count 94 transition count 441
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 46 place count 88 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 88 transition count 439
Applied a total of 47 rules in 174 ms. Remains 88 /111 variables (removed 23) and now considering 439/468 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 88/111 places, 439/468 transitions.
RANDOM walk for 40000 steps (8 resets) in 439 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :759388 after 1.74184e+08
Interrupted probabilistic random walk after 1338880 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :2 out of 3
Probabilistic random walk after 1338880 steps, saw 195620 distinct states, run finished after 3006 ms. (steps per millisecond=445 ) properties seen :2
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 439 rows 88 cols
[2025-06-08 15:42:24] [INFO ] Computed 7 invariants in 7 ms
[2025-06-08 15:42:24] [INFO ] State equation strengthened by 365 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/72 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 417/489 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 195/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/507 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 167/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/522 variables, 8/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/522 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/522 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/527 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/527 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/527 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/527 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 460 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 365/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/72 variables, 6/7 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 15:42:24] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 417/489 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 195/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 1/276 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 15:42:25] [INFO ] Deduced a trap composed of 11 places in 770 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 15:42:25] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/507 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 167/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/522 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/527 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/527 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/527 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/527 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 365/365 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1829ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 860 steps, including 165 resets, run visited all 1 properties in 13 ms. (steps per millisecond=66 )
FORMULA MedleyB-PT-B07-ReachabilityCardinality-2025-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 16 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 36349 ms.

BK_STOP 1749397345987

--------------------
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-B07"
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-B07, 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-174931340000478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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