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

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

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 8.1K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 12:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 6 09:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:14 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-B10-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B10-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749403614039

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-B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 17:26:55] [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 17:26:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 17:26:56] [INFO ] Load time of PNML (sax parser for PT used): 1419 ms
[2025-06-08 17:26:56] [INFO ] Transformed 1234 places.
[2025-06-08 17:26:57] [INFO ] Transformed 41201 transitions.
[2025-06-08 17:26:57] [INFO ] Found NUPN structural information;
[2025-06-08 17:26:57] [INFO ] Parsed PT model containing 1234 places and 41201 transitions and 720567 arcs in 1896 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (260 resets) in 4132 ms. (9 steps per ms) remains 8/14 properties
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 459 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 556 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 476 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 550 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 380 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (31 resets) in 468 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 373 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (33 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
// Phase 1: matrix 41201 rows 1234 cols
[2025-06-08 17:27:00] [INFO ] Computed 10 invariants in 959 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1170/1234 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1234 variables, 1170/1244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1234 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-08 17:27:03] [INFO ] Flatten gal took : 4648 ms
SMT process timed out in 6564ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 41201/41201 transitions.
Graph (trivial) has 1144 edges and 1234 vertex of which 134 / 1234 are part of one of the 22 SCC in 14 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 2936 edges and 1122 vertex of which 1108 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.140 ms
Discarding 14 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.
[2025-06-08 17:27:07] [INFO ] Flatten gal took : 3545 ms
Drop transitions (Trivial Post-Agglo cleanup.) removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 707 rules applied. Total rules applied 709 place count 1108 transition count 40343
Reduce places removed 701 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 735 rules applied. Total rules applied 1444 place count 407 transition count 40309
Reduce places removed 16 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 2 with 51 rules applied. Total rules applied 1495 place count 391 transition count 40274
[2025-06-08 17:27:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9973346487752837071.gal : 717 ms
[2025-06-08 17:27:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8486508912296528833.prop : 1 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/ReachabilityCardinality9973346487752837071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8486508912296528833.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 37 rules applied. Total rules applied 1532 place count 356 transition count 40272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1533 place count 355 transition count 40272
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 1533 place count 355 transition count 40247
Deduced a syphon composed of 25 places in 30 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1583 place count 330 transition count 40247
Discarding 61 places :
Symmetric choice reduction at 5 with 61 rule applications. Total rules 1644 place count 269 transition count 40186
Iterating global reduction 5 with 61 rules applied. Total rules applied 1705 place count 269 transition count 40186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1707 place count 269 transition count 40184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1708 place count 268 transition count 40184
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1724 place count 252 transition count 3678
Iterating global reduction 7 with 16 rules applied. Total rules applied 1740 place count 252 transition count 3678
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1747 place count 252 transition count 3671
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 1819 place count 216 transition count 3635
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1820 place count 216 transition count 3634
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1825 place count 211 transition count 3629
Iterating global reduction 9 with 5 rules applied. Total rules applied 1830 place count 211 transition count 3629
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 1850 place count 201 transition count 3637
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1853 place count 201 transition count 3634
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 1858 place count 201 transition count 3629
Free-agglomeration rule applied 54 times.
Iterating global reduction 10 with 54 rules applied. Total rules applied 1912 place count 201 transition count 3575
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 10 with 54 rules applied. Total rules applied 1966 place count 147 transition count 3575
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1970 place count 143 transition count 3571
Iterating global reduction 11 with 4 rules applied. Total rules applied 1974 place count 143 transition count 3571
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 1978 place count 143 transition count 3567
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1979 place count 143 transition count 3567
Applied a total of 1979 rules in 10683 ms. Remains 143 /1234 variables (removed 1091) and now considering 3567/41201 (removed 37634) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10692 ms. Remains : 143/1234 places, 3567/41201 transitions.
RANDOM walk for 40000 steps (1062 resets) in 1420 ms. (28 steps per ms) remains 7/8 properties
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (122 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (123 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (121 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (124 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (126 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (126 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (114 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
// Phase 1: matrix 3567 rows 143 cols
[2025-06-08 17:27:17] [INFO ] Computed 8 invariants in 23 ms
[2025-06-08 17:27:19] [INFO ] State equation strengthened by 3213 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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 63/125 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3556/3681 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3681 variables, 2246/2379 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3681 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 29/3710 variables, 18/2397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3710 variables, 967/3364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3710 variables, 0/3364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/3710 variables, 0/3364 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3710/3710 variables, and 3364 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7404 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 143/143 constraints, ReadFeed: 3213/3213 constraints, PredecessorRefiner: 7/3 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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 63/125 variables, 8/8 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 17:27:27] [INFO ] Deduced a trap composed of 13 places in 789 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:28] [INFO ] Deduced a trap composed of 16 places in 728 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:29] [INFO ] Deduced a trap composed of 16 places in 651 ms of which 16 ms to minimize.
Problem MedleyB-PT-B10-ReachabilityCardinality-2025-00 is UNSAT
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:29] [INFO ] Deduced a trap composed of 19 places in 566 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:30] [INFO ] Deduced a trap composed of 13 places in 555 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:30] [INFO ] Deduced a trap composed of 22 places in 505 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:31] [INFO ] Deduced a trap composed of 12 places in 703 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:32] [INFO ] Deduced a trap composed of 19 places in 535 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:32] [INFO ] Deduced a trap composed of 17 places in 568 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:33] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 10 ms to minimize.
Problem MedleyB-PT-B10-ReachabilityCardinality-2025-13 is UNSAT
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:33] [INFO ] Deduced a trap composed of 19 places in 570 ms of which 11 ms to minimize.
Problem MedleyB-PT-B10-ReachabilityCardinality-2025-15 is UNSAT
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 11/19 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3556/3681 variables, 125/144 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality8486508912296528833.prop.
At refinement iteration 5 (INCLUDED_ONLY) 0/3681 variables, 2246/2390 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 2/2392 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 17:27:37] [INFO ] Deduced a trap composed of 19 places in 562 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3681 variables, 1/2393 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3681 variables, 0/2393 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 29/3710 variables, 18/2411 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3710 variables, 967/3378 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3710 variables, 1/3379 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3710 variables, 0/3379 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3710 variables, 0/3379 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3710/3710 variables, and 3379 constraints, problems are : Problem set: 3 solved, 4 unsolved in 17661 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 143/143 constraints, ReadFeed: 3213/3213 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26573ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 269 ms.
Support contains 20 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 3567/3567 transitions.
Graph (trivial) has 90 edges and 143 vertex of which 12 / 143 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 137 transition count 3528
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 36 rules applied. Total rules applied 64 place count 110 transition count 3519
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 106 transition count 3517
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 104 transition count 3517
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 104 transition count 3516
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 103 transition count 3516
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 80 place count 97 transition count 3510
Iterating global reduction 4 with 6 rules applied. Total rules applied 86 place count 97 transition count 3510
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 88 place count 95 transition count 3508
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 95 transition count 3508
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 114 place count 83 transition count 3496
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 119 place count 83 transition count 3491
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 127 place count 75 transition count 2908
Iterating global reduction 5 with 8 rules applied. Total rules applied 135 place count 75 transition count 2908
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 75 transition count 2907
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 6 with 23 rules applied. Total rules applied 159 place count 75 transition count 2884
Free-agglomeration rule applied 12 times with reduction of 518 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 171 place count 75 transition count 2354
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 239 transitions.
Iterating post reduction 6 with 251 rules applied. Total rules applied 422 place count 63 transition count 2115
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 460 place count 63 transition count 2077
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 463 place count 63 transition count 2077
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 466 place count 63 transition count 2074
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 472 place count 60 transition count 2071
Applied a total of 472 rules in 3686 ms. Remains 60 /143 variables (removed 83) and now considering 2071/3567 (removed 1496) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3686 ms. Remains : 60/143 places, 2071/3567 transitions.
RANDOM walk for 40000 steps (1051 resets) in 1084 ms. (36 steps per ms) remains 0/3 properties
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B10-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 53776 ms.

BK_STOP 1749403669091

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B10"
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-B10, 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-174931340000502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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