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

About the Execution of ITS-Tools for ShieldRVt-PT-002B

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901993900207.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 ShieldRVt-PT-002B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901993900207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 24K May 29 14:33 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 ShieldRVt-PT-002B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldRVt-PT-002B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749095661555

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 03:54:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 03:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 03:54:22] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2025-06-05 03:54:22] [INFO ] Transformed 103 places.
[2025-06-05 03:54:22] [INFO ] Transformed 103 transitions.
[2025-06-05 03:54:22] [INFO ] Found NUPN structural information;
[2025-06-05 03:54:22] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 03:54:23] [INFO ] Flatten gal took : 46 ms
RANDOM walk for 40000 steps (17 resets) in 1058 ms. (37 steps per ms) remains 6/15 properties
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 03:54:23] [INFO ] Flatten gal took : 23 ms
[2025-06-05 03:54:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2675677703007951843.gal : 17 ms
[2025-06-05 03:54:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10449798357215312723.prop : 3 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/ReachabilityCardinality2675677703007951843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10449798357215312723.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
Loading property file /tmp/ReachabilityCardinality10449798357215312723.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 14
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :14 after 73
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :73 after 1471
BEST_FIRST walk for 40001 steps (10 resets) in 748 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 158 ms. (251 steps per ms) remains 5/6 properties
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (22 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
// Phase 1: matrix 103 rows 103 cols
[2025-06-05 03:54:23] [INFO ] Computed 9 invariants in 5 ms
Excessive predecessor constraint size, skipping predecessor.
Invariant property ShieldRVt-PT-002B-ReachabilityFireability-2025-05 does not hold.
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/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldRVt-PT-002B-ReachabilityFireability-2025-02 is UNSAT
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ShieldRVt-PT-002B-ReachabilityFireability-2025-11 is UNSAT
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 31/103 variables, 9/81 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 31/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :43891 after 68729
At refinement iteration 5 (OVERLAPS) 103/206 variables, 103/215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 215 constraints, problems are : Problem set: 2 solved, 3 unsolved in 354 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 52/103 variables, 9/60 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 52/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:24] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:24] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :68729 after 68921
[2025-06-05 03:54:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:24] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:24] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/117 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 103/206 variables, 103/220 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 2/222 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:24] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :68921 after 73274
After SMT solving in domain Int declared 206/206 variables, and 223 constraints, problems are : Problem set: 2 solved, 3 unsolved in 845 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1259ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 243 ms.
Support contains 51 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 103/103 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 4 place count 103 transition count 99
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 99 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 98
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 10 place count 98 transition count 91
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 24 place count 91 transition count 91
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 30 place count 85 transition count 85
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 85 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 36 place count 85 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 84 transition count 84
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 3 with 8 rules applied. Total rules applied 46 place count 80 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 79 transition count 80
Applied a total of 48 rules in 47 ms. Remains 79 /103 variables (removed 24) and now considering 80/103 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 79/103 places, 80/103 transitions.
RANDOM walk for 40000 steps (18 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (35 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 970635 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 3
Probabilistic random walk after 970635 steps, saw 262072 distinct states, run finished after 3006 ms. (steps per millisecond=322 ) properties seen :0
// Phase 1: matrix 80 rows 79 cols
[2025-06-05 03:54:28] [INFO ] Computed 9 invariants in 2 ms
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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 28/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 80/159 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/159 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 88 constraints, problems are : Problem set: 0 solved, 3 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 28/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/159 variables, 79/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:28] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 3 ms to minimize.
Problem ShieldRVt-PT-002B-ReachabilityFireability-2025-04 is UNSAT
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 4/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 101 constraints, problems are : Problem set: 1 solved, 2 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 896ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 46 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 80/80 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 79 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 78
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 77 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 76 transition count 77
Applied a total of 6 rules in 9 ms. Remains 76 /79 variables (removed 3) and now considering 77/80 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 76/79 places, 77/80 transitions.
RANDOM walk for 40000 steps (19 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (31 resets) in 95 ms. (416 steps per ms) remains 1/2 properties
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 77 rows 76 cols
[2025-06-05 03:54:29] [INFO ] Computed 9 invariants in 2 ms
[2025-06-05 03:54:29] [INFO ] State equation strengthened by 2 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/153 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 77/153 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 03:54:29] [INFO ] Deduced a trap along path composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 9 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 77/77 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 65
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 64 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 62 transition count 63
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 28 place count 62 transition count 59
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 58 transition count 59
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 54 transition count 55
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 54 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 44 place count 54 transition count 54
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 53 transition count 54
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 76 place count 38 transition count 39
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 3 with 8 rules applied. Total rules applied 84 place count 34 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 34 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 33 transition count 41
Applied a total of 86 rules in 17 ms. Remains 33 /76 variables (removed 43) and now considering 41/77 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 33/76 places, 41/77 transitions.
RANDOM walk for 40000 steps (316 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (104 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6509 states, properties seen :0
Probabilistic random walk after 37658 steps, saw 6509 distinct states, run finished after 31 ms. (steps per millisecond=1214 ) properties seen :0
Explored full state space saw : 6509 states, properties seen :0
Exhaustive walk after 37658 steps, saw 6509 distinct states, run finished after 22 ms. (steps per millisecond=1711 ) properties seen :0
FORMULA ShieldRVt-PT-002B-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7577 ms.

BK_STOP 1749095670285

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldRVt-PT-002B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-002B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r212-tall-174901993900207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002B.tgz
mv ShieldRVt-PT-002B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;