Execution Chart

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

Trace from the execution

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

--------------------
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-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749145226138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-05 17:40:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 17:40:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:40:27] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-05 17:40:27] [INFO ] Transformed 1398 places.
[2025-06-05 17:40:27] [INFO ] Transformed 296 transitions.
[2025-06-05 17:40:27] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 581 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 108 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2025-06-05 17:40:27] [INFO ] Computed 1062 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:40:29] [INFO ] Implicit Places using invariants in 1350 ms returned []
[2025-06-05 17:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:40:31] [INFO ] Implicit Places using invariants and state equation in 2154 ms returned [813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 926, 927, 928, 929, 930, 931, 932, 934]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 3542 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1398 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3695 ms. Remains : 1338/1398 places, 296/296 transitions.
Support contains 581 out of 1338 places after structural reductions.
[2025-06-05 17:40:31] [INFO ] Flatten gal took : 133 ms
[2025-06-05 17:40:31] [INFO ] Flatten gal took : 74 ms
[2025-06-05 17:40:32] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (1768 resets) in 1733 ms. (23 steps per ms) remains 21/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 238 ms. (16 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 172 ms. (23 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
// Phase 1: matrix 296 rows 1338 cols
[2025-06-05 17:40:33] [INFO ] Computed 1044 invariants in 29 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/524 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/524 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 399/923 variables, 396/720 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/923 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 322/1245 variables, 306/1026 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 277/1522 variables, 1245/2271 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1522 variables, 0/2271 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 8 (OVERLAPS) 112/1634 variables, 93/2364 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1634 variables, 18/2382 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 1 solved, 20 unsolved in 5045 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 21/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 324/324 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 399/922 variables, 396/720 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/720 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 322/1244 variables, 306/1026 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 0/1026 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 276/1520 variables, 1244/2270 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 11/2281 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/1634 variables, and 2281 constraints, problems are : Problem set: 1 solved, 20 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 1026/1044 constraints, State Equation: 1244/1338 constraints, PredecessorRefiner: 17/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10224ms problems are : Problem set: 1 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 523 out of 1338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1338 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 1337 transition count 294
Applied a total of 2 rules in 150 ms. Remains 1337 /1338 variables (removed 1) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 1337/1338 places, 294/296 transitions.
RANDOM walk for 40000 steps (1760 resets) in 968 ms. (41 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 468937 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 20
Probabilistic random walk after 468937 steps, saw 73889 distinct states, run finished after 3007 ms. (steps per millisecond=155 ) properties seen :0
// Phase 1: matrix 294 rows 1337 cols
[2025-06-05 17:40:46] [INFO ] Computed 1045 invariants in 18 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 399/922 variables, 396/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 322/1244 variables, 306/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 276/1520 variables, 1244/2270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 93/1613 variables, 75/2345 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1613 variables, 0/2345 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 18/1631 variables, 19/2364 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1631 variables, 18/2382 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1631 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/1631 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1631/1631 variables, and 2382 constraints, problems are : Problem set: 0 solved, 20 unsolved in 10040 ms.
Refiners :[Generalized P Invariants (flows): 1045/1045 constraints, State Equation: 1337/1337 constraints, PredecessorRefiner: 20/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 399/922 variables, 396/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 322/1244 variables, 306/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 276/1520 variables, 1244/2270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 11/2281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 93/1613 variables, 75/2356 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1613 variables, 3/2359 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1613/1631 variables, and 2359 constraints, problems are : Problem set: 0 solved, 20 unsolved in 45033 ms.
Refiners :[Generalized P Invariants (flows): 1026/1045 constraints, State Equation: 1319/1337 constraints, PredecessorRefiner: 20/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55144ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 523 out of 1337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1337/1337 places, 294/294 transitions.
Applied a total of 0 rules in 25 ms. Remains 1337 /1337 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1337/1337 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1337/1337 places, 294/294 transitions.
Applied a total of 0 rules in 22 ms. Remains 1337 /1337 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-05 17:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:41:43] [INFO ] Implicit Places using invariants in 1279 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1292 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1336/1337 places, 294/294 transitions.
Applied a total of 0 rules in 54 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1369 ms. Remains : 1336/1337 places, 294/294 transitions.
RANDOM walk for 40000 steps (1757 resets) in 1184 ms. (33 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 438051 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 20
Probabilistic random walk after 438051 steps, saw 68782 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
// Phase 1: matrix 294 rows 1336 cols
[2025-06-05 17:41:46] [INFO ] Computed 1044 invariants in 11 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 399/922 variables, 396/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 322/1244 variables, 306/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 276/1520 variables, 1244/2270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 92/1612 variables, 74/2344 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1612 variables, 0/2344 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 18/1630 variables, 18/2362 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1630 variables, 18/2380 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1630 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/1630 variables, 0/2380 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1630/1630 variables, and 2380 constraints, problems are : Problem set: 0 solved, 20 unsolved in 9639 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1336/1336 constraints, PredecessorRefiner: 20/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 324/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 399/922 variables, 396/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/922 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 322/1244 variables, 306/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1244 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 276/1520 variables, 1244/2270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 11/2281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 92/1612 variables, 74/2355 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 3/2358 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1612/1630 variables, and 2358 constraints, problems are : Problem set: 0 solved, 20 unsolved in 75026 ms.
Refiners :[Generalized P Invariants (flows): 1026/1044 constraints, State Equation: 1318/1336 constraints, PredecessorRefiner: 20/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84734ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 523 out of 1336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 32 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1336/1336 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 19 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2025-06-05 17:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:12] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2025-06-05 17:43:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:14] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned [1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1296, 1297, 1298, 1299, 1302]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2830 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1317/1336 places, 294/294 transitions.
Applied a total of 0 rules in 22 ms. Remains 1317 /1317 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2873 ms. Remains : 1317/1336 places, 294/294 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 1318 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.18 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1315 transition count 291
Applied a total of 5 rules in 209 ms. Remains 1315 /1338 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1315 cols
[2025-06-05 17:43:14] [INFO ] Computed 1026 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:16] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2025-06-05 17:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:19] [INFO ] Implicit Places using invariants and state equation in 2867 ms returned [913, 1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1275, 1276, 1277, 1278, 1281]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 4182 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1338 places, 291/296 transitions.
Applied a total of 0 rules in 119 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4517 ms. Remains : 1295/1338 places, 291/296 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-00
Product exploration explored 100000 steps with 5459 reset in 421 ms.
Product exploration explored 100000 steps with 5493 reset in 344 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-00 finished in 5792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U p1)||X(G(p0)))))))'
Support contains 418 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2025-06-05 17:43:20] [INFO ] Computed 1044 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:21] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2025-06-05 17:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:26] [INFO ] Implicit Places using invariants and state equation in 4619 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5801 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 13 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5838 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-01 finished in 6088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&F(!p1)&&(F(p0) U p2)))'
Support contains 78 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:27] [INFO ] Implicit Places using invariants in 1291 ms returned []
[2025-06-05 17:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:31] [INFO ] Implicit Places using invariants and state equation in 3453 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4746 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 28 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4809 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), p1, (NOT p0), (NOT p2), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-02
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-02 finished in 5104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1||X(p0)))) U (F(!p0) U p2)))'
Support contains 1 out of 1338 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 950 are kept as prefixes of interest. Removing 388 places using SCC suffix rule.4 ms
Discarding 388 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 950 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 920 transition count 221
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 920 transition count 221
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 920 transition count 221
Applied a total of 68 rules in 167 ms. Remains 920 /1338 variables (removed 418) and now considering 221/296 (removed 75) transitions.
// Phase 1: matrix 221 rows 920 cols
[2025-06-05 17:43:31] [INFO ] Computed 702 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:32] [INFO ] Implicit Places using invariants in 845 ms returned []
[2025-06-05 17:43:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:34] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned [517]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2513 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 919/1338 places, 221/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 919 /919 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2722 ms. Remains : 919/1338 places, 221/296 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-04
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-04 finished in 2785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U p1)||F(G(p2))))))'
Support contains 401 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 21 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2025-06-05 17:43:34] [INFO ] Computed 1044 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:35] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2025-06-05 17:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:38] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3532 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 20 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3575 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-05
Product exploration explored 100000 steps with 4425 reset in 431 ms.
Product exploration explored 100000 steps with 4415 reset in 524 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 12 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-05 finished in 5202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(G(p1))))'
Support contains 21 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:41] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2025-06-05 17:43:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:44] [INFO ] Implicit Places using invariants and state equation in 3376 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4781 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 43 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4865 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-06
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-06 finished in 4989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 3 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 1318 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.7 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1316 transition count 292
Applied a total of 5 rules in 90 ms. Remains 1316 /1338 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1316 cols
[2025-06-05 17:43:44] [INFO ] Computed 1026 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:46] [INFO ] Implicit Places using invariants in 1337 ms returned []
[2025-06-05 17:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:48] [INFO ] Implicit Places using invariants and state equation in 2554 ms returned [913]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3896 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1338 places, 292/296 transitions.
Applied a total of 0 rules in 54 ms. Remains 1315 /1315 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4040 ms. Remains : 1315/1338 places, 292/296 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-08
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-08 finished in 4142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 40 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2025-06-05 17:43:48] [INFO ] Computed 1044 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:50] [INFO ] Implicit Places using invariants in 1452 ms returned []
[2025-06-05 17:43:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:53] [INFO ] Implicit Places using invariants and state equation in 2829 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4360 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-09 finished in 5412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&F(G(p1))))))'
Support contains 21 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:43:55] [INFO ] Implicit Places using invariants in 1423 ms returned []
[2025-06-05 17:43:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:44:01] [INFO ] Implicit Places using invariants and state equation in 6236 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7661 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7735 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-10 finished in 7875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((X(X(F(p0))) U G((F(!p1) U p2))) U G(p3))))'
Support contains 23 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:44:03] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2025-06-05 17:44:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:44:09] [INFO ] Implicit Places using invariants and state equation in 5505 ms returned []
Implicit Place search using SMT with State Equation took 6904 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 17:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1337 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1337 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1633 variables, 1337/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1633/1634 variables, and 2381 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1338 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1337 variables, 1044/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1337 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1633 variables, 1337/2381 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1633 variables, 276/2657 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1633/1634 variables, and 2657 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1337/1338 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Finished structural reductions in LTL mode , in 1 iterations and 67133 ms. Remains : 1338/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 1082 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND p1 (NOT p0)), (AND p1 (NOT p2)), (AND (NOT p3) (NOT p0) p2 p1), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) p2), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2)), false, false]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-11 finished in 68275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((!p0&&X(X(!p0)))))||(!p1&&F((!p0&&X(X(!p0))))))))'
Support contains 3 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:11] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2025-06-05 17:45:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:17] [INFO ] Implicit Places using invariants and state equation in 5535 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6969 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7042 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 225 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-12 finished in 8104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(X(X(F(p2))))&&(!p0 U (p1||G(!p0)))))))))'
Support contains 23 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:19] [INFO ] Implicit Places using invariants in 1332 ms returned []
[2025-06-05 17:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:22] [INFO ] Implicit Places using invariants and state equation in 3129 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4468 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4548 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-13
Product exploration explored 100000 steps with 18504 reset in 350 ms.
Product exploration explored 100000 steps with 18359 reset in 321 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-13 finished in 5735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U X(X(!p2))))'
Support contains 23 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-05 17:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:25] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2025-06-05 17:45:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:28] [INFO ] Implicit Places using invariants and state equation in 3234 ms returned [916]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4657 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1338 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4738 ms. Remains : 1337/1338 places, 296/296 transitions.
Stuttering acceptance computed with spot in 476 ms :[p2, p2, (AND p0 p2), p2, true, (AND p2 p0), p2, (AND p0 p2), (AND p0 p2), (AND p0 p2), p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 285 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 48 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-14 finished in 6094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)||(F(!p2) U p3)))'
Support contains 23 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 957 are kept as prefixes of interest. Removing 381 places using SCC suffix rule.2 ms
Discarding 381 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 919 transition count 219
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 919 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 919 transition count 219
Applied a total of 76 rules in 69 ms. Remains 919 /1338 variables (removed 419) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2025-06-05 17:45:30] [INFO ] Computed 702 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:31] [INFO ] Implicit Places using invariants in 922 ms returned []
[2025-06-05 17:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:45:35] [INFO ] Implicit Places using invariants and state equation in 3775 ms returned [517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 4713 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 899/1338 places, 219/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 899 /899 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4809 ms. Remains : 899/1338 places, 219/296 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLFireability-15 finished in 4969 ms.
All properties solved by simple procedures.
Total runtime 307930 ms.

BK_STOP 1749145535672

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
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 LTLFireability"
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-174881254700804"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;