Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 226K 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 76K 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 24K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 556K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 219K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 360K 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-18-ReachabilityCardinality-2025-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749145614055

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-05 17:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 17:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:46:55] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2025-06-05 17:46:55] [INFO ] Transformed 1398 places.
[2025-06-05 17:46:55] [INFO ] Transformed 296 transitions.
[2025-06-05 17:46:55] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 17:46:56] [INFO ] Flatten gal took : 279 ms
[2025-06-05 17:46:56] [INFO ] Flatten gal took : 103 ms
[2025-06-05 17:46:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17789820468698849296.gal : 93 ms
[2025-06-05 17:46:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8043614747334266209.prop : 20 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/ReachabilityCardinality17789820468698849296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8043614747334266209.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (1766 resets) in 3204 ms. (12 steps per ms) remains 15/16 properties
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 15/15 properties

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
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 183 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 276 ms. (14 steps per ms) remains 15/15 properties
Loading property file /tmp/ReachabilityCardinality8043614747334266209.prop.
BEST_FIRST walk for 4004 steps (13 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 339 ms. (11 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :32 after 1024
Interrupted probabilistic random walk after 463431 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 15
Probabilistic random walk after 463431 steps, saw 69347 distinct states, run finished after 3005 ms. (steps per millisecond=154 ) properties seen :0
// Phase 1: matrix 296 rows 1398 cols
[2025-06-05 17:47:00] [INFO ] Computed 1103 invariants in 65 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1397 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/1397 variables, 1100/1102 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1397 variables, 0/1102 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1/1398 variables, 1/1103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1398 variables, 0/1103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-10 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 296/1694 variables, 1398/2501 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 2501 constraints, problems are : Problem set: 5 solved, 10 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 14/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1310 variables, 1064/1065 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1310 variables, 0/1065 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 55/1365 variables, 2/1067 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:07] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:07] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:07] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:08] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:08] [INFO ] Deduced a trap composed of 9 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 17:47:08] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:08] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:09] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:09] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:09] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:09] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:47:10] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1365/1694 variables, and 1079 constraints, problems are : Problem set: 6 solved, 9 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1064/1100 constraints, State Equation: 0/1398 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10247ms problems are : Problem set: 6 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 887 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Discarding 35 places :
Implicit places reduction removed 35 places
Iterating post reduction 0 with 141 rules applied. Total rules applied 142 place count 1361 transition count 190
Applied a total of 142 rules in 100 ms. Remains 1361 /1398 variables (removed 37) and now considering 190/296 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1361/1398 places, 190/296 transitions.
RANDOM walk for 40000 steps (1736 resets) in 984 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (160 resets) in 703 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (170 resets) in 411 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (170 resets) in 363 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (176 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (169 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (169 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (167 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (167 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (169 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 638429 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 9
Probabilistic random walk after 638429 steps, saw 74866 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 190 rows 1361 cols
[2025-06-05 17:47:14] [INFO ] Computed 1171 invariants in 9 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/887 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/887 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 12/899 variables, 19/49 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/899 variables, 263/312 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/312 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 461/1360 variables, 859/1171 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :709044 after 717054
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 0/1171 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 190/1550 variables, 1360/2531 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1550 variables, 0/2531 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/1551 variables, 1/2532 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1551 variables, 0/2532 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1551 variables, 0/2532 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1551/1551 variables, and 2532 constraints, problems are : Problem set: 3 solved, 6 unsolved in 4291 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1152/1152 constraints, State Equation: 1361/1361 constraints, PredecessorRefiner: 9/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/778 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 31/809 variables, 19/21 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/809 variables, 263/284 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 452/1261 variables, 823/1107 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1261 variables, 0/1107 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 98/1359 variables, 64/1171 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 0/1171 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 189/1548 variables, 1359/2530 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1548 variables, 4/2534 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :717054 after 770952
At refinement iteration 11 (INCLUDED_ONLY) 0/1548 variables, 0/2534 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/1551 variables, 2/2536 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1551 variables, 0/2536 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1551 variables, 0/2536 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1551/1551 variables, and 2536 constraints, problems are : Problem set: 3 solved, 6 unsolved in 12916 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1152/1152 constraints, State Equation: 1361/1361 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17250ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 102 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=8 )
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2025-05 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 15 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 36425 ms.

BK_STOP 1749145651686

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254700806"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;