Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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.7K 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 370K 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 ShieldRVs-PT-030B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749055447986

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 16:44:09] [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-04 16:44:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 16:44:09] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-04 16:44:09] [INFO ] Transformed 1203 places.
[2025-06-04 16:44:09] [INFO ] Transformed 1353 transitions.
[2025-06-04 16:44:09] [INFO ] Found NUPN structural information;
[2025-06-04 16:44:09] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (28 resets) in 1367 ms. (29 steps per ms) remains 4/16 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
[2025-06-04 16:44:10] [INFO ] Flatten gal took : 234 ms
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
[2025-06-04 16:44:10] [INFO ] Flatten gal took : 117 ms
// Phase 1: matrix 1353 rows 1203 cols
[2025-06-04 16:44:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16726591154750812153.gal : 49 ms
[2025-06-04 16:44:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1681885391054693699.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/ReachabilityCardinality16726591154750812153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1681885391054693699.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-06-04 16:44:10] [INFO ] Computed 121 invariants in 46 ms

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
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality1681885391054693699.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ShieldRVs-PT-030B-ReachabilityFireability-2025-07 is UNSAT
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 958/1106 variables, 107/255 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 958/1213 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1213 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 97/1203 variables, 14/1227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 97/1324 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 0/1324 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 37
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :37 after 331
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :331 after 3.39768e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.39768e+06 after 9.86168e+14
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :9.86168e+14 after 2.52744e+32
At refinement iteration 8 (OVERLAPS) 1353/2556 variables, 1203/2527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.52744e+32 after 1.23682e+65
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.23682e+65 after 1.23682e+65
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.23682e+65 after 1.23682e+65
At refinement iteration 9 (INCLUDED_ONLY) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2556 variables, 0/2527 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2556/2556 variables, and 2527 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1613 ms.
Refiners :[Domain max(s): 1203/1203 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1203/1203 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.23682e+65 after 1.23682e+65
At refinement iteration 2 (OVERLAPS) 912/1024 variables, 99/211 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1024 variables, 912/1123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:12] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:13] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:13] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:13] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.23682e+65 after 1.23682e+65
[2025-06-04 16:44:13] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:14] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:14] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:14] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:14] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:14] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:15] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:15] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:15] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.23682e+65 after 1.23682e+65
[2025-06-04 16:44:15] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:15] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:16] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:16] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:16] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:16] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:17] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 20/1143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:17] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 13 ms to minimize.
SMT process timed out in 6891ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 112 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1203 transition count 1257
Reduce places removed 96 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 103 rules applied. Total rules applied 199 place count 1107 transition count 1250
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 206 place count 1100 transition count 1250
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 206 place count 1100 transition count 1105
Deduced a syphon composed of 145 places in 4 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 496 place count 955 transition count 1105
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 687 place count 764 transition count 914
Iterating global reduction 3 with 191 rules applied. Total rules applied 878 place count 764 transition count 914
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 878 place count 764 transition count 855
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 996 place count 705 transition count 855
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 1 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 372 rules applied. Total rules applied 1368 place count 519 transition count 669
Partial Free-agglomeration rule applied 45 times.
Drop transitions (Partial Free agglomeration) removed 45 transitions
Iterating global reduction 3 with 45 rules applied. Total rules applied 1413 place count 519 transition count 669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1414 place count 518 transition count 668
Applied a total of 1414 rules in 382 ms. Remains 518 /1203 variables (removed 685) and now considering 668/1353 (removed 685) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 518/1203 places, 668/1353 transitions.
RANDOM walk for 40000 steps (75 resets) in 545 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 668 rows 518 cols
[2025-06-04 16:44:18] [INFO ] Computed 121 invariants in 4 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/282 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 157/439 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1041 variables, 439/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 131/1172 variables, 65/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1172 variables, 14/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1172 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/1180 variables, 5/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 8/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1186 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1186 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1186 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1186 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 639 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 518/518 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 225/282 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:18] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:18] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:18] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:18] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 157/439 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:18] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:19] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 65536
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :1.23682e+65 after 1.23682e+65
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 602/1041 variables, 439/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1041 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 131/1172 variables, 65/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1172 variables, 14/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:20] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1172 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap along path composed of 4 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-04 16:44:21] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1172 variables, 5/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1172 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:21] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1172 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1172 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1180 variables, 5/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1180 variables, 8/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1180 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1186 variables, 6/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1186 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1186 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 16:44:22] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 5 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/1186 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1186 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1186 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 673 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3869 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 518/518 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 4236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 57 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 668/668 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 518 transition count 663
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 513 transition count 663
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 513 transition count 652
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 502 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 501 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 501 transition count 651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 34 place count 501 transition count 650
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 500 transition count 650
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 7 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 78 place count 479 transition count 629
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 479 transition count 629
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 476 transition count 626
Applied a total of 89 rules in 189 ms. Remains 476 /518 variables (removed 42) and now considering 626/668 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 476/518 places, 626/668 transitions.
RANDOM walk for 40000 steps (86 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26006 steps (4 resets) in 150 ms. (172 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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 13488 ms.

BK_STOP 1749055462779

--------------------
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="ShieldRVs-PT-030B"
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 ShieldRVs-PT-030B, 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-174901993700127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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