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

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-10

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 216K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 298K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 149K May 29 14:32 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 QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-00
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-01
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-02
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-03
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-04
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-05
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-06
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-07
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-08
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-09
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-10
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-11
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-12
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-13
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-14
FORMULA_NAME QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749142746792

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 16:59:08] [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 16:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 16:59:08] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-06-05 16:59:08] [INFO ] Transformed 550 places.
[2025-06-05 16:59:08] [INFO ] Transformed 176 transitions.
[2025-06-05 16:59:08] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 16:59:10] [INFO ] Flatten gal took : 79 ms
[2025-06-05 16:59:10] [INFO ] Flatten gal took : 48 ms
RANDOM walk for 40000 steps (2769 resets) in 3856 ms. (10 steps per ms) remains 14/16 properties
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 16:59:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1189086911581364724.gal : 43 ms
[2025-06-05 16:59:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7643410333723096258.prop : 23 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/ReachabilityCardinality1189086911581364724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7643410333723096258.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
Loading property file /tmp/ReachabilityCardinality7643410333723096258.prop.
BEST_FIRST walk for 40004 steps (188 resets) in 1294 ms. (30 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :16 after 848
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :2972 after 3098
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :3098 after 3548
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :3548 after 4890
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :4890 after 8266
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :8266 after 31478
BEST_FIRST walk for 40004 steps (237 resets) in 880 ms. (45 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :31478 after 154670
BEST_FIRST walk for 40004 steps (236 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
Invariant property QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-11 does not hold.
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-08 is true.
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-03 is true.
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
BEST_FIRST walk for 40002 steps (330 resets) in 340 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (324 resets) in 1676 ms. (23 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (239 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (316 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (183 resets) in 264 ms. (150 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (337 resets) in 286 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (310 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (332 resets) in 447 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (329 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (243 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (317 resets) in 175 ms. (227 steps per ms) remains 14/14 properties
// Phase 1: matrix 176 rows 550 cols
[2025-06-05 16:59:12] [INFO ] Computed 375 invariants in 41 ms
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/524 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 15/539 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-12 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 11/550 variables, 122/375 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-00 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 5 solved, 6 unsolved in 4702 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 11/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 104/104 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 50/263 variables, 3/107 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 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 16:59:17] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:17] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 16/123 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/123 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 255/518 variables, 252/375 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:18] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 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-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 12/387 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:19] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/388 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 1/389 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/389 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 32/550 variables, 16/405 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:59:20] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/550 variables, 6/411 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/411 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 176/726 variables, 550/961 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/726 variables, 2/963 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 963 constraints, problems are : Problem set: 5 solved, 6 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9936ms problems are : Problem set: 5 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 213 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 512 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 512 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 512 transition count 170
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 511 transition count 170
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 511 transition count 167
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 508 transition count 167
Applied a total of 12 rules in 87 ms. Remains 508 /550 variables (removed 42) and now considering 167/176 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 508/550 places, 167/176 transitions.
RANDOM walk for 40000 steps (2972 resets) in 527 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (343 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (260 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (360 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (353 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (268 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (365 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 1048 steps, run visited all 6 properties in 23 ms. (steps per millisecond=45 )
Probabilistic random walk after 1048 steps, saw 995 distinct states, run finished after 29 ms. (steps per millisecond=36 ) properties seen :6
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-PT-10-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 13812 ms.

BK_STOP 1749142762607

--------------------
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="QuasiCertifProtocol-PT-10"
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 QuasiCertifProtocol-PT-10, 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 r156-tall-174881254700799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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