Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337800073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800073
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717219869087

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:31:10] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-01 05:31:10] [INFO ] Transformed 550 places.
[2024-06-01 05:31:10] [INFO ] Transformed 176 transitions.
[2024-06-01 05:31:10] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 529 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 550 cols
[2024-06-01 05:31:10] [INFO ] Computed 375 invariants in 29 ms
[2024-06-01 05:31:10] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 05:31:10] [INFO ] Invariant cache hit.
[2024-06-01 05:31:11] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 05:31:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 16/539 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 10 ms to minimize.
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:31:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:31:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:31:15] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:31:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 11/550 variables, 122/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:31:19] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:31:19] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 05:31:19] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 05:31:19] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:31:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:31:20] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:31:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:31:23] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:31:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 176/726 variables, 550/944 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/726 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 944 constraints, problems are : Problem set: 0 solved, 164 unsolved in 20531 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 16/539 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 11/550 variables, 122/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 9/394 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 05:31:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 176/726 variables, 550/945 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 164/1109 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/726 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 1109 constraints, problems are : Problem set: 0 solved, 164 unsolved in 22550 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 20/20 constraints]
After SMT, in 43311ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 43332ms
Finished structural reductions in LTL mode , in 1 iterations and 44101 ms. Remains : 550/550 places, 176/176 transitions.
Support contains 529 out of 550 places after structural reductions.
[2024-06-01 05:31:54] [INFO ] Flatten gal took : 70 ms
[2024-06-01 05:31:54] [INFO ] Flatten gal took : 28 ms
[2024-06-01 05:31:55] [INFO ] Input system was already deterministic with 176 transitions.
RANDOM walk for 40000 steps (2766 resets) in 3295 ms. (12 steps per ms) remains 79/87 properties
BEST_FIRST walk for 4004 steps (31 resets) in 46 ms. (85 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4004 steps (31 resets) in 47 ms. (83 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (18 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (28 resets) in 66 ms. (59 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (29 resets) in 60 ms. (65 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (32 resets) in 60 ms. (65 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (29 resets) in 33 ms. (117 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (40 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (25 resets) in 27 ms. (143 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (27 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (30 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (31 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (40 resets) in 53 ms. (74 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (34 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (26 resets) in 27 ms. (143 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (35 resets) in 22 ms. (173 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (34 resets) in 29 ms. (133 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (30 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (40 resets) in 25 ms. (153 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (40 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (29 resets) in 25 ms. (153 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (32 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (29 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (30 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (30 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (32 resets) in 63 ms. (62 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (33 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (32 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (30 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
[2024-06-01 05:31:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 371/371 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/540 variables, 3/374 constraints. Problems are: Problem set: 18 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 0/374 constraints. Problems are: Problem set: 18 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 10/550 variables, 1/375 constraints. Problems are: Problem set: 18 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 18 solved, 60 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 6 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 45 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 45 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 45 solved, 33 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 371/371 constraints. Problems are: Problem set: 45 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/371 constraints. Problems are: Problem set: 45 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 42/540 variables, 3/374 constraints. Problems are: Problem set: 45 solved, 33 unsolved
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 05:32:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 3 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 20/394 constraints. Problems are: Problem set: 45 solved, 33 unsolved
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:32:03] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 3 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:32:04] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/414 constraints. Problems are: Problem set: 45 solved, 33 unsolved
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:32:06] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
SMT process timed out in 10089ms, After SMT, problems are : Problem set: 45 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 498 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 547 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 536 transition count 139
Applied a total of 49 rules in 39 ms. Remains 536 /550 variables (removed 14) and now considering 139/176 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 536/550 places, 139/176 transitions.
RANDOM walk for 40000 steps (2974 resets) in 1124 ms. (35 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (36 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (35 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (35 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (31 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 937289 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :31 out of 33
Probabilistic random walk after 937289 steps, saw 125450 distinct states, run finished after 3004 ms. (steps per millisecond=312 ) properties seen :31
// Phase 1: matrix 139 rows 536 cols
[2024-06-01 05:32:10] [INFO ] Computed 397 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/216 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/241 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 270/511 variables, 253/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 137/648 variables, 511/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 25/673 variables, 23/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 10/930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/674 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/675 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/675 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/675 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 933 constraints, problems are : Problem set: 0 solved, 2 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 386/386 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 72/216 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/241 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 270/511 variables, 253/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:32:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 137/648 variables, 511/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/648 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/648 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 11 (OVERLAPS) 25/673 variables, 23/922 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 10/932 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/673 variables, 0/932 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/674 variables, 1/933 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/674 variables, 1/934 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/674 variables, 0/934 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/675 variables, 1/935 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/675 variables, 0/935 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/675 variables, 0/935 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 935 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 386/386 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2015ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 46 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:32:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 29 ms
[2024-06-01 05:32:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 24 ms
[2024-06-01 05:32:12] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 377 out of 550 places (down from 388) after GAL structural reductions.
Computed a total of 550 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 550 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 50 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 524/550 places, 176/176 transitions.
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:32:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 536 transition count 176
Applied a total of 14 rules in 12 ms. Remains 536 /550 variables (removed 14) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 536/550 places, 176/176 transitions.
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 18 ms
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:32:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 389 are kept as prefixes of interest. Removing 161 places using SCC suffix rule.4 ms
Discarding 161 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 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 389 transition count 147
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 383 transition count 135
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 383 transition count 135
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 383 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 382 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 382 transition count 134
Applied a total of 31 rules in 52 ms. Remains 382 /550 variables (removed 168) and now considering 134/176 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 382/550 places, 134/176 transitions.
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:32:12] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 536 transition count 176
Applied a total of 14 rules in 19 ms. Remains 536 /550 variables (removed 14) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 536/550 places, 176/176 transitions.
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 525 transition count 176
Applied a total of 25 rules in 22 ms. Remains 525 /550 variables (removed 25) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 525/550 places, 176/176 transitions.
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:12] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 20 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 524/550 places, 176/176 transitions.
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:13] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 20 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 524/550 places, 176/176 transitions.
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:32:13] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 512 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Discarding 38 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 511 transition count 173
Applied a total of 2 rules in 36 ms. Remains 511 /550 variables (removed 39) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 511/550 places, 173/176 transitions.
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Input system was already deterministic with 173 transitions.
RANDOM walk for 40000 steps (2708 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (207 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9391 steps, run visited all 1 properties in 15 ms. (steps per millisecond=626 )
Probabilistic random walk after 9391 steps, saw 2326 distinct states, run finished after 18 ms. (steps per millisecond=521 ) properties seen :1
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 7 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 524/550 places, 176/176 transitions.
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 476 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.3 ms
Discarding 74 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 475 transition count 168
Applied a total of 3 rules in 21 ms. Remains 475 /550 variables (removed 75) and now considering 168/176 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 475/550 places, 168/176 transitions.
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:32:13] [INFO ] Input system was already deterministic with 168 transitions.
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:32:13] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:32:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 550 places, 176 transitions and 1287 arcs took 4 ms.
Total runtime 63329 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-00
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-05
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-06
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-10
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-14
Could not compute solution for formula : QuasiCertifProtocol-PT-10-CTLCardinality-2024-15

BK_STOP 1717219933885

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/781/ctl_0_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/781/ctl_1_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/781/ctl_2_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/781/ctl_3_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/781/ctl_4_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/781/ctl_5_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/781/ctl_6_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/781/ctl_7_
ctl formula name QuasiCertifProtocol-PT-10-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/781/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337800073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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