About the Execution of ITS-Tools for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 681.504 | 49496.00 | 80857.00 | 248.80 | FFFFTFFFTFFFTTFT | normal |
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.r312-tall-171662337700067.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 itstools
Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 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 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 78K 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-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716664132235
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 19:08:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:08:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:08:53] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-25 19:08:53] [INFO ] Transformed 270 places.
[2024-05-25 19:08:53] [INFO ] Transformed 116 transitions.
[2024-05-25 19:08:53] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 195 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 258 transition count 116
Applied a total of 12 rules in 18 ms. Remains 258 /270 variables (removed 12) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 258 cols
[2024-05-25 19:08:53] [INFO ] Computed 143 invariants in 16 ms
[2024-05-25 19:08:54] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-25 19:08:54] [INFO ] Invariant cache hit.
[2024-05-25 19:08:54] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 19:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 5/256 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 116/374 variables, 258/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 401 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 5/256 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 116/374 variables, 258/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 108/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 509 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10849ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10867ms
Starting structural reductions in LTL mode, iteration 1 : 258/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11413 ms. Remains : 258/270 places, 116/116 transitions.
Support contains 195 out of 258 places after structural reductions.
[2024-05-25 19:09:05] [INFO ] Flatten gal took : 44 ms
[2024-05-25 19:09:05] [INFO ] Flatten gal took : 19 ms
[2024-05-25 19:09:05] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3931 resets) in 2010 ms. (19 steps per ms) remains 24/31 properties
BEST_FIRST walk for 4004 steps (71 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (68 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (66 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (68 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (73 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (69 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (69 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (71 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (88 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (69 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (69 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (65 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (69 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (74 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (64 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (64 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (68 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (76 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (66 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (67 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (70 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
[2024-05-25 19:09:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/168 variables, 2/51 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 36/204 variables, 50/101 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 40/244 variables, 36/137 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 21 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 8 (OVERLAPS) 116/360 variables, 244/381 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/381 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 14/374 variables, 14/395 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 6/401 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 7 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 401 constraints, problems are : Problem set: 7 solved, 17 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 49/49 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 4/168 variables, 2/51 constraints. Problems are: Problem set: 7 solved, 17 unsolved
[2024-05-25 19:09:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 7 ms to minimize.
[2024-05-25 19:09:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-25 19:09:07] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 4/55 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 36/204 variables, 50/105 constraints. Problems are: Problem set: 7 solved, 17 unsolved
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-25 19:09:08] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 11/116 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/116 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 40/244 variables, 36/152 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/152 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 116/360 variables, 244/396 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 15/411 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/411 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 14/374 variables, 14/425 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 6/431 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/374 variables, 2/433 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/433 constraints. Problems are: Problem set: 7 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 433 constraints, problems are : Problem set: 7 solved, 17 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 17/24 constraints, Known Traps: 15/15 constraints]
After SMT, in 6397ms problems are : Problem set: 7 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 164 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 257 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 251 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 34 place count 251 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 56 place count 235 transition count 83
Applied a total of 56 rules in 28 ms. Remains 235 /258 variables (removed 23) and now considering 83/116 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 235/258 places, 83/116 transitions.
RANDOM walk for 40000 steps (6275 resets) in 905 ms. (44 steps per ms) remains 10/17 properties
BEST_FIRST walk for 40004 steps (503 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (2222 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2214 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2155 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2214 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2304 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2514 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2353 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (2271 resets) in 72 ms. (547 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (5712 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
// Phase 1: matrix 83 rows 235 cols
[2024-05-25 19:09:13] [INFO ] Computed 152 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5/130 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 45/175 variables, 78/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 38/213 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 76/289 variables, 213/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 29/318 variables, 22/381 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 387 constraints, problems are : Problem set: 0 solved, 10 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 151/151 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 5/130 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 45/175 variables, 78/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 38/213 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 76/289 variables, 213/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 7/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 29/318 variables, 22/388 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/318 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 397 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 151/151 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 1967ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 6 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 10 properties in 4 ms. (steps per millisecond=10 )
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 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 25 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 258 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 258 transition count 116
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' '!((F(p0) U (p1&&G(F(p2)))))'
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 115
Applied a total of 2 rules in 31 ms. Remains 252 /258 variables (removed 6) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 252 cols
[2024-05-25 19:09:15] [INFO ] Computed 138 invariants in 7 ms
[2024-05-25 19:09:16] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-25 19:09:16] [INFO ] Invariant cache hit.
[2024-05-25 19:09:16] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [148, 149, 150, 151, 155, 160, 161, 198, 199, 223, 224, 225, 226, 227]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 366 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/258 places, 115/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 238/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 10250 reset in 285 ms.
Product exploration explored 100000 steps with 10246 reset in 228 ms.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
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) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 574 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4095 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (494 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 197 ms. (steps per millisecond=872 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 200 ms. (steps per millisecond=859 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 14 factoid took 647 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Support contains 50 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
Applied a total of 0 rules in 12 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 238 cols
[2024-05-25 19:09:19] [INFO ] Computed 126 invariants in 6 ms
[2024-05-25 19:09:19] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-25 19:09:19] [INFO ] Invariant cache hit.
[2024-05-25 19:09:19] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-25 19:09:19] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 19:09:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 8/353 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 364 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3580 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 91/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 8/353 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 464 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6396 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 10031ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 10032ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10427 ms. Remains : 238/238 places, 115/115 transitions.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4098 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (508 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 185 ms. (steps per millisecond=928 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 186 ms. (steps per millisecond=923 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10259 reset in 190 ms.
Product exploration explored 100000 steps with 10248 reset in 222 ms.
Built C files in :
/tmp/ltsmin16203262254408489293
[2024-05-25 19:09:30] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-25 19:09:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:09:30] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-25 19:09:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:09:30] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-25 19:09:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 19:09:30] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16203262254408489293
Running compilation step : cd /tmp/ltsmin16203262254408489293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 441 ms.
Running link step : cd /tmp/ltsmin16203262254408489293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16203262254408489293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1618488598154740748.hoa' '--buchi-type=spotba'
LTSmin run took 1479 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-00 finished in 16900 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(p0))'
Support contains 49 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 244 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 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 241 transition count 111
Applied a total of 5 rules in 19 ms. Remains 241 /258 variables (removed 17) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 19:09:32] [INFO ] Computed 132 invariants in 4 ms
[2024-05-25 19:09:32] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 19:09:32] [INFO ] Invariant cache hit.
[2024-05-25 19:09:33] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [144, 145, 146, 147, 151, 156, 157, 194, 195, 219, 220, 221, 222, 223]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 353 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/258 places, 111/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 227/258 places, 111/116 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-01 finished in 428 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)&&F((p1 U (G(p1)||(p1&&G(p0))))))))'
Support contains 15 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.2 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
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 16 place count 172 transition count 84
Applied a total of 16 rules in 22 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-25 19:09:33] [INFO ] Computed 90 invariants in 1 ms
[2024-05-25 19:09:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-25 19:09:33] [INFO ] Invariant cache hit.
[2024-05-25 19:09:33] [INFO ] Implicit Places using invariants and state equation in 148 ms returned [127, 128, 150, 151, 152, 153, 154]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 253 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-02 finished in 430 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((!p0&&X(G((!p0||G(p1)))))) U (p2||X(X(p3)))))'
Support contains 66 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 10 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 19:09:33] [INFO ] Computed 139 invariants in 3 ms
[2024-05-25 19:09:33] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 19:09:33] [INFO ] Invariant cache hit.
[2024-05-25 19:09:33] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 332 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (AND (NOT p1) p0 (NOT p3)), true, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 162 ms.
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
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 (NOT p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 13 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-04 finished in 1105 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)&&X(G(p1)))))'
Support contains 64 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 173 transition count 85
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 17 place count 172 transition count 84
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 18 place count 172 transition count 84
Applied a total of 18 rules in 10 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-25 19:09:34] [INFO ] Computed 90 invariants in 0 ms
[2024-05-25 19:09:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-25 19:09:34] [INFO ] Invariant cache hit.
[2024-05-25 19:09:34] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [81, 82, 83, 84, 87, 92, 93]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 194 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-05
Stuttering criterion allowed to conclude after 390 steps with 36 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-05 finished in 335 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((G(F(p0))||(F(p0)&&G(p1))))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 254 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 253 transition count 115
Applied a total of 2 rules in 15 ms. Remains 253 /258 variables (removed 5) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 253 cols
[2024-05-25 19:09:35] [INFO ] Computed 139 invariants in 4 ms
[2024-05-25 19:09:35] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-25 19:09:35] [INFO ] Invariant cache hit.
[2024-05-25 19:09:35] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [149, 150, 151, 152, 156, 161, 162, 199, 200, 224, 225, 226, 227, 228]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 457 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/258 places, 115/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 239/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-07
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-07 finished in 563 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(p0))'
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 2 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 19:09:35] [INFO ] Computed 139 invariants in 1 ms
[2024-05-25 19:09:35] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-25 19:09:35] [INFO ] Invariant cache hit.
[2024-05-25 19:09:36] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 416 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
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 : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-12 finished in 896 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(X(G((X(p0)||F(p1))))))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 2 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 19:09:36] [INFO ] Computed 138 invariants in 1 ms
[2024-05-25 19:09:36] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-25 19:09:36] [INFO ] Invariant cache hit.
[2024-05-25 19:09:36] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 380 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-15
Product exploration explored 100000 steps with 9823 reset in 181 ms.
Product exploration explored 100000 steps with 9828 reset in 150 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
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)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (3931 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (704 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (699 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (713 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1438215 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :2 out of 3
Probabilistic random walk after 1438215 steps, saw 230124 distinct states, run finished after 3005 ms. (steps per millisecond=478 ) properties seen :2
// Phase 1: matrix 116 rows 246 cols
[2024-05-25 19:09:41] [INFO ] Computed 132 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/82 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/93 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/113 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 102/215 variables, 75/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 147/362 variables, 147/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 114/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 2/362 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Generalized P Invariants (flows): 0/132 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-15 finished in 4805 ms.
All properties solved by simple procedures.
Total runtime 47965 ms.
BK_STOP 1716664181731
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-06, 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 r312-tall-171662337700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 '
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 ;