Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337800075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717219944040

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:32:25] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-01 05:32:25] [INFO ] Transformed 550 places.
[2024-06-01 05:32:25] [INFO ] Transformed 176 transitions.
[2024-06-01 05:32:25] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 303 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 538 transition count 176
Applied a total of 12 rules in 44 ms. Remains 538 /550 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 538 cols
[2024-06-01 05:32:25] [INFO ] Computed 363 invariants in 36 ms
[2024-06-01 05:32:26] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-01 05:32:26] [INFO ] Invariant cache hit.
[2024-06-01 05:32:27] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 05:32:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/527 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 9/536 variables, 100/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:32:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 10 ms to minimize.
[2024-06-01 05:32:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:32:35] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:32:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:32:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 176/712 variables, 536/904 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 2/714 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 0/714 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 906 constraints, problems are : Problem set: 0 solved, 164 unsolved in 23722 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/527 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 9/536 variables, 100/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
[2024-06-01 05:32:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 12 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:32:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 05:32:56] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:32:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:32:57] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 4 ms to minimize.
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 13/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 176/712 variables, 536/937 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 154/1091 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 2/714 variables, 2/1093 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 10/1103 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 1103 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 38/38 constraints]
After SMT, in 53967ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 54026ms
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55423 ms. Remains : 538/550 places, 176/176 transitions.
Support contains 303 out of 538 places after structural reductions.
[2024-06-01 05:33:21] [INFO ] Flatten gal took : 63 ms
[2024-06-01 05:33:21] [INFO ] Flatten gal took : 31 ms
[2024-06-01 05:33:21] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 301 out of 538 places (down from 303) after GAL structural reductions.
RANDOM walk for 40000 steps (2768 resets) in 1842 ms. (21 steps per ms) remains 18/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (28 resets) in 28 ms. (137 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (34 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (32 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (40 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (36 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
[2024-06-01 05:33:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 44/341 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 33/374 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 138/512 variables, 115/353 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 174/686 variables, 512/865 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 0/865 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 10 (OVERLAPS) 28/714 variables, 26/891 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 10/901 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 0/901 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/714 variables, 0/901 constraints. Problems are: Problem set: 6 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 901 constraints, problems are : Problem set: 6 solved, 12 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 110/110 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/110 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 45/339 variables, 2/112 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:33:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 10/122 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 1/123 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/123 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 32/371 variables, 125/248 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 4/252 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-06-01 05:33:25] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 9 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2024-06-01 05:33:26] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 12/264 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/264 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 140/511 variables, 116/380 constraints. Problems are: Problem set: 6 solved, 12 unsolved
[2024-06-01 05:33:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 1/381 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 0/381 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 173/684 variables, 511/892 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 5/897 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 684/714 variables, and 897 constraints, problems are : Problem set: 6 solved, 12 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 351/361 constraints, State Equation: 511/538 constraints, PredecessorRefiner: 5/18 constraints, Known Traps: 28/28 constraints]
After SMT, in 6897ms problems are : Problem set: 6 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 537 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 537 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 537 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 536 transition count 172
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 15 place count 536 transition count 163
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 24 place count 527 transition count 163
Applied a total of 24 rules in 64 ms. Remains 527 /538 variables (removed 11) and now considering 163/176 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 527/538 places, 163/176 transitions.
RANDOM walk for 40000 steps (2978 resets) in 798 ms. (50 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (85 resets) in 113 ms. (350 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (353 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (359 resets) in 271 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (352 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (350 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (357 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (353 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (350 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (351 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (354 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
// Phase 1: matrix 163 rows 527 cols
[2024-06-01 05:33:29] [INFO ] Computed 364 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 46/328 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 26/354 variables, 124/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 125/479 variables, 107/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 161/640 variables, 479/822 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 49/689 variables, 47/869 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 21/890 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/690 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/690 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/690 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 891 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 362/362 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 46/328 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:33:32] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 26/354 variables, 124/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 125/479 variables, 107/355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:33:33] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
[2024-06-01 05:33:34] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
[2024-06-01 05:33:35] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-06-01 05:33:35] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-06-01 05:33:35] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-06-01 05:33:35] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:33:35] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 161/640 variables, 479/852 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 5/857 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 49/689 variables, 47/904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/689 variables, 21/925 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/689 variables, 4/929 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/689 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 1/690 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/690 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/690 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 930 constraints, problems are : Problem set: 0 solved, 9 unsolved in 15220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 362/362 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 30/30 constraints]
After SMT, in 17260ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 222 ms.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 538 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 538 transition count 176
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 525 transition count 176
Applied a total of 13 rules in 21 ms. Remains 525 /538 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2024-06-01 05:33:47] [INFO ] Computed 351 invariants in 12 ms
[2024-06-01 05:33:48] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 05:33:48] [INFO ] Invariant cache hit.
[2024-06-01 05:33:48] [INFO ] Implicit Places using invariants and state equation in 818 ms returned [304, 305, 312, 313, 314, 315, 316, 317, 318, 319, 356]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1248 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/538 places, 176/176 transitions.
Applied a total of 0 rules in 22 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1291 ms. Remains : 514/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-00 finished in 1665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(p2)))'
Support contains 265 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 536 transition count 176
Applied a total of 2 rules in 8 ms. Remains 536 /538 variables (removed 2) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2024-06-01 05:33:49] [INFO ] Computed 362 invariants in 7 ms
[2024-06-01 05:33:49] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-06-01 05:33:49] [INFO ] Invariant cache hit.
[2024-06-01 05:33:50] [INFO ] Implicit Places using invariants and state equation in 724 ms returned [315, 316, 323, 324, 325, 326, 327, 328, 329, 330, 367]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1459 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1472 ms. Remains : 525/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-01 finished in 1680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 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 510 transition count 171
Applied a total of 5 rules in 71 ms. Remains 510 /538 variables (removed 28) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 510 cols
[2024-06-01 05:33:50] [INFO ] Computed 341 invariants in 9 ms
[2024-06-01 05:33:51] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 05:33:51] [INFO ] Invariant cache hit.
[2024-06-01 05:33:52] [INFO ] Implicit Places using invariants and state equation in 850 ms returned [301, 302, 309, 310, 311, 312, 313, 314, 315, 316, 353, 429, 430, 431, 432, 433, 434, 486, 489, 490, 491, 492]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1287 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/538 places, 171/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1374 ms. Remains : 488/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 6776 reset in 283 ms.
Product exploration explored 100000 steps with 6779 reset in 238 ms.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
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)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 7 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 171 rows 488 cols
[2024-06-01 05:33:53] [INFO ] Computed 320 invariants in 10 ms
[2024-06-01 05:33:53] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 152 ms returned sat
[2024-06-01 05:33:54] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-06-01 05:33:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:33:54] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 160 ms returned sat
[2024-06-01 05:33:55] [INFO ] [Nat]Absence check using state equation in 1174 ms returned sat
[2024-06-01 05:33:55] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 12 ms.
[2024-06-01 05:33:55] [INFO ] Added : 12 causal constraints over 3 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 19 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-06-01 05:33:55] [INFO ] Invariant cache hit.
[2024-06-01 05:33:56] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-06-01 05:33:56] [INFO ] Invariant cache hit.
[2024-06-01 05:33:56] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-06-01 05:33:57] [INFO ] Redundant transitions in 27 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-01 05:33:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 12/659 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 808 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9792 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 27/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 12/659 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 121/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 956 constraints, problems are : Problem set: 0 solved, 148 unsolved in 20037 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 29941ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 29944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31049 ms. Remains : 488/488 places, 171/171 transitions.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
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)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-06-01 05:34:27] [INFO ] Invariant cache hit.
[2024-06-01 05:34:27] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 148 ms returned sat
[2024-06-01 05:34:28] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2024-06-01 05:34:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:34:28] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 143 ms returned sat
[2024-06-01 05:34:29] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2024-06-01 05:34:29] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 12 ms.
[2024-06-01 05:34:29] [INFO ] Added : 1 causal constraints over 1 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6763 reset in 179 ms.
Product exploration explored 100000 steps with 6775 reset in 243 ms.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 13 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-06-01 05:34:30] [INFO ] Invariant cache hit.
[2024-06-01 05:34:30] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-06-01 05:34:30] [INFO ] Invariant cache hit.
[2024-06-01 05:34:31] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-06-01 05:34:31] [INFO ] Redundant transitions in 25 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-01 05:34:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 12/659 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 808 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10081 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 27/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 12/659 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 121/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 956 constraints, problems are : Problem set: 0 solved, 148 unsolved in 20092 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 30280ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 30284ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31382 ms. Remains : 488/488 places, 171/171 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-02 finished in 70809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 370 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.3 ms
Discarding 168 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 370 transition count 131
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 370 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 130
Applied a total of 27 rules in 31 ms. Remains 369 /538 variables (removed 169) and now considering 130/176 (removed 46) transitions.
// Phase 1: matrix 130 rows 369 cols
[2024-06-01 05:35:01] [INFO ] Computed 240 invariants in 2 ms
[2024-06-01 05:35:01] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 05:35:01] [INFO ] Invariant cache hit.
[2024-06-01 05:35:02] [INFO ] Implicit Places using invariants and state equation in 415 ms returned [159, 160, 167, 168, 169, 170, 171, 172, 173, 174, 210]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 661 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/538 places, 130/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 358 /358 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 703 ms. Remains : 358/538 places, 130/176 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-03
Stuttering criterion allowed to conclude after 42 steps with 5 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-03 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 369 are kept as prefixes of interest. Removing 169 places using SCC suffix rule.2 ms
Discarding 169 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 368 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 367 transition count 129
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 26 place count 367 transition count 129
Applied a total of 26 rules in 44 ms. Remains 367 /538 variables (removed 171) and now considering 129/176 (removed 47) transitions.
// Phase 1: matrix 129 rows 367 cols
[2024-06-01 05:35:02] [INFO ] Computed 240 invariants in 1 ms
[2024-06-01 05:35:02] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 05:35:02] [INFO ] Invariant cache hit.
[2024-06-01 05:35:03] [INFO ] Implicit Places using invariants and state equation in 371 ms returned [277, 278, 279, 280, 281, 282, 332, 335, 336, 337, 338]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 624 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/538 places, 129/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 677 ms. Remains : 356/538 places, 129/176 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-04
Product exploration explored 100000 steps with 6644 reset in 241 ms.
Product exploration explored 100000 steps with 6648 reset in 243 ms.
Computed a total of 356 stabilizing places and 129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 356 transition count 129
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)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-04 finished in 1344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 132 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 523 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 520 transition count 171
Applied a total of 5 rules in 27 ms. Remains 520 /538 variables (removed 18) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2024-06-01 05:35:03] [INFO ] Computed 351 invariants in 8 ms
[2024-06-01 05:35:04] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 05:35:04] [INFO ] Invariant cache hit.
[2024-06-01 05:35:04] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [311, 312, 319, 320, 321, 322, 323, 324, 325, 326, 363, 439, 440, 441, 442, 443, 444, 496, 499, 500, 501, 502]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 970 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/538 places, 171/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1008 ms. Remains : 498/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-05
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-05 finished in 1054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 6 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-06-01 05:35:04] [INFO ] Computed 350 invariants in 3 ms
[2024-06-01 05:35:05] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 05:35:05] [INFO ] Invariant cache hit.
[2024-06-01 05:35:06] [INFO ] Implicit Places using invariants and state equation in 808 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1200 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1213 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-08 finished in 1313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 6 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
[2024-06-01 05:35:06] [INFO ] Invariant cache hit.
[2024-06-01 05:35:06] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-06-01 05:35:06] [INFO ] Invariant cache hit.
[2024-06-01 05:35:07] [INFO ] Implicit Places using invariants and state equation in 765 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1172 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1185 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-12 finished in 1296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((G(p1) U p2)&&p0))))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 526 transition count 176
Applied a total of 12 rules in 10 ms. Remains 526 /538 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 526 cols
[2024-06-01 05:35:07] [INFO ] Computed 351 invariants in 13 ms
[2024-06-01 05:35:07] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 05:35:07] [INFO ] Invariant cache hit.
[2024-06-01 05:35:08] [INFO ] Implicit Places using invariants and state equation in 819 ms returned [305, 306, 313, 314, 315, 316, 317, 318, 319, 320, 357]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1206 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/538 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 515 /515 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1226 ms. Remains : 515/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 18 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-13 finished in 1516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 05:35:09] [INFO ] Flatten gal took : 25 ms
[2024-06-01 05:35:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:35:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 538 places, 176 transitions and 1275 arcs took 4 ms.
Total runtime 164076 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : QuasiCertifProtocol-PT-10-LTLCardinality-02

BK_STOP 1717220136433

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name QuasiCertifProtocol-PT-10-LTLCardinality-02
ltl formula formula --ltl=/tmp/1177/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 538 places, 176 transitions and 1275 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1177/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1177/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1177/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1177/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 525 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 539, there are 180 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~16 levels ~10000 states ~40452 transitions
pnml2lts-mc( 2/ 4): ~16 levels ~20000 states ~87208 transitions
pnml2lts-mc( 2/ 4): ~17 levels ~40000 states ~183656 transitions
pnml2lts-mc( 1/ 4): ~19 levels ~80000 states ~414160 transitions
pnml2lts-mc( 1/ 4): ~19 levels ~160000 states ~896308 transitions
pnml2lts-mc( 0/ 4): ~17 levels ~320000 states ~1845952 transitions
pnml2lts-mc( 3/ 4): ~17 levels ~640000 states ~3879404 transitions
pnml2lts-mc( 0/ 4): ~18 levels ~1280000 states ~8541120 transitions
pnml2lts-mc( 0/ 4): ~19 levels ~2560000 states ~18451604 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4025737
pnml2lts-mc( 0/ 4): unique states count: 4025782
pnml2lts-mc( 0/ 4): unique transitions count: 31496972
pnml2lts-mc( 0/ 4): - self-loop count: 23363
pnml2lts-mc( 0/ 4): - claim dead count: 27447384
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4025788
pnml2lts-mc( 0/ 4): - cum. max stack depth: 87
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4025788 states 31497034 transitions, fanout: 7.824
pnml2lts-mc( 0/ 4): Total exploration time 26.120 sec (26.090 sec minimum, 26.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 154127, Transitions per second: 1205859
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 94.7MB, 24.7 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 176 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 94.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337800075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;