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.r311-tall-171662335800075.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 greatspnxred
Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800075
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716655422106

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:43:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 16:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:43:43] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-25 16:43:43] [INFO ] Transformed 550 places.
[2024-05-25 16:43:43] [INFO ] Transformed 176 transitions.
[2024-05-25 16:43:43] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 303 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 538 transition count 176
Applied a total of 12 rules in 41 ms. Remains 538 /550 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 538 cols
[2024-05-25 16:43:43] [INFO ] Computed 363 invariants in 36 ms
[2024-05-25 16:43:44] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-25 16:43:44] [INFO ] Invariant cache hit.
[2024-05-25 16:43:45] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 16:43:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/527 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 9/536 variables, 100/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 16:43:52] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 10 ms to minimize.
[2024-05-25 16:43:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:43:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 16:43:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 16:43:56] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 176/712 variables, 536/904 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 2/714 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 0/714 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 906 constraints, problems are : Problem set: 0 solved, 164 unsolved in 24358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/527 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/527 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 9/536 variables, 100/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 16:44:12] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
[2024-05-25 16:44:12] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 4 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-05-25 16:44:13] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:44:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:44:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:44:14] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:44:15] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-25 16:44:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 16:44:15] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-25 16:44:15] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 3 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 4 ms to minimize.
[2024-05-25 16:44:16] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-25 16:44:17] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-05-25 16:44:17] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 13/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 176/712 variables, 536/937 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 154/1091 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 2/714 variables, 2/1093 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 10/1103 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 714/714 variables, and 1103 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 38/38 constraints]
After SMT, in 54589ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 54602ms
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55982 ms. Remains : 538/550 places, 176/176 transitions.
Support contains 303 out of 538 places after structural reductions.
[2024-05-25 16:44:39] [INFO ] Flatten gal took : 64 ms
[2024-05-25 16:44:39] [INFO ] Flatten gal took : 32 ms
[2024-05-25 16:44:39] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 301 out of 538 places (down from 303) after GAL structural reductions.
RANDOM walk for 40000 steps (2771 resets) in 2583 ms. (15 steps per ms) remains 18/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2024-05-25 16:44:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 54/340 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 32/372 variables, 125/237 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 140/512 variables, 116/353 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 174/686 variables, 512/865 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/686 variables, 0/865 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 10 (OVERLAPS) 28/714 variables, 26/891 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/714 variables, 10/901 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 0/901 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/714 variables, 0/901 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 901 constraints, problems are : Problem set: 6 solved, 9 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 110/110 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/110 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 55/337 variables, 2/112 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-05-25 16:44:42] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:44:42] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:44:43] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 9/121 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/121 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 29/366 variables, 124/245 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-05-25 16:44:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 10/255 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:44:45] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 8/263 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-05-25 16:44:46] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/264 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/264 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 122/488 variables, 107/371 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/371 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 170/658 variables, 488/859 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/658 variables, 5/864 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/714 variables, and 864 constraints, problems are : Problem set: 6 solved, 9 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 341/361 constraints, State Equation: 488/538 constraints, PredecessorRefiner: 5/15 constraints, Known Traps: 28/28 constraints]
After SMT, in 6727ms problems are : Problem set: 6 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 282 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 537 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 537 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 536 transition count 171
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 16 place count 536 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 25 place count 527 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 526 transition count 161
Applied a total of 26 rules in 86 ms. Remains 526 /538 variables (removed 12) and now considering 161/176 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 526/538 places, 161/176 transitions.
RANDOM walk for 40000 steps (2902 resets) in 726 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (228 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (229 resets) in 214 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (226 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (227 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (229 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (225 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (228 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (228 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (225 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 1609 steps, run visited all 9 properties in 37 ms. (steps per millisecond=43 )
Probabilistic random walk after 1609 steps, saw 1523 distinct states, run finished after 41 ms. (steps per millisecond=39 ) properties seen :9
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 538 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 538 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 525 transition count 176
Applied a total of 13 rules in 19 ms. Remains 525 /538 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2024-05-25 16:44:48] [INFO ] Computed 351 invariants in 23 ms
[2024-05-25 16:44:49] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-25 16:44:49] [INFO ] Invariant cache hit.
[2024-05-25 16:44:49] [INFO ] Implicit Places using invariants and state equation in 815 ms returned [304, 305, 312, 313, 314, 315, 316, 317, 318, 319, 356]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1207 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/538 places, 176/176 transitions.
Applied a total of 0 rules in 21 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1249 ms. Remains : 514/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-00 finished in 1623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(p2)))'
Support contains 265 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 536 transition count 176
Applied a total of 2 rules in 7 ms. Remains 536 /538 variables (removed 2) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2024-05-25 16:44:50] [INFO ] Computed 362 invariants in 12 ms
[2024-05-25 16:44:50] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-25 16:44:50] [INFO ] Invariant cache hit.
[2024-05-25 16:44:51] [INFO ] Implicit Places using invariants and state equation in 713 ms returned [315, 316, 323, 324, 325, 326, 327, 328, 329, 330, 367]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1079 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/538 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1090 ms. Remains : 525/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-01 finished in 1307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 510 transition count 171
Applied a total of 5 rules in 32 ms. Remains 510 /538 variables (removed 28) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 510 cols
[2024-05-25 16:44:51] [INFO ] Computed 341 invariants in 5 ms
[2024-05-25 16:44:52] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-25 16:44:52] [INFO ] Invariant cache hit.
[2024-05-25 16:44:52] [INFO ] Implicit Places using invariants and state equation in 847 ms returned [301, 302, 309, 310, 311, 312, 313, 314, 315, 316, 353, 429, 430, 431, 432, 433, 434, 486, 489, 490, 491, 492]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1213 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/538 places, 171/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1263 ms. Remains : 488/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 6776 reset in 288 ms.
Product exploration explored 100000 steps with 6791 reset in 234 ms.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
// Phase 1: matrix 171 rows 488 cols
[2024-05-25 16:44:54] [INFO ] Computed 320 invariants in 5 ms
[2024-05-25 16:44:54] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 151 ms returned sat
[2024-05-25 16:44:54] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2024-05-25 16:44:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:44:55] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 149 ms returned sat
[2024-05-25 16:44:56] [INFO ] [Nat]Absence check using state equation in 1170 ms returned sat
[2024-05-25 16:44:56] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 27 ms.
[2024-05-25 16:44:56] [INFO ] Added : 12 causal constraints over 3 iterations in 170 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 24 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-25 16:44:56] [INFO ] Invariant cache hit.
[2024-05-25 16:44:57] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-25 16:44:57] [INFO ] Invariant cache hit.
[2024-05-25 16:44:57] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2024-05-25 16:44:57] [INFO ] Redundant transitions in 28 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-25 16:44:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 12/659 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 808 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10695 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 27/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 12/659 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 121/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 956 constraints, problems are : Problem set: 0 solved, 148 unsolved in 21936 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 32763ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 32771ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33885 ms. Remains : 488/488 places, 171/171 transitions.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-25 16:45:31] [INFO ] Invariant cache hit.
[2024-05-25 16:45:31] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 143 ms returned sat
[2024-05-25 16:45:32] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-25 16:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:32] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 156 ms returned sat
[2024-05-25 16:45:33] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2024-05-25 16:45:33] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 13 ms.
[2024-05-25 16:45:33] [INFO ] Added : 1 causal constraints over 1 iterations in 83 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6781 reset in 183 ms.
Product exploration explored 100000 steps with 6786 reset in 235 ms.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 12 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-25 16:45:33] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-25 16:45:34] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2024-05-25 16:45:34] [INFO ] Redundant transitions in 21 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-25 16:45:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 12/659 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 808 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10441 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 27/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 12/659 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 121/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 956 constraints, problems are : Problem set: 0 solved, 148 unsolved in 21699 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 32241ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 32247ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33352 ms. Remains : 488/488 places, 171/171 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-02 finished in 75632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 370 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.2 ms
Discarding 168 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 370 transition count 131
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 370 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 130
Applied a total of 27 rules in 57 ms. Remains 369 /538 variables (removed 169) and now considering 130/176 (removed 46) transitions.
// Phase 1: matrix 130 rows 369 cols
[2024-05-25 16:46:07] [INFO ] Computed 240 invariants in 2 ms
[2024-05-25 16:46:07] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46:08] [INFO ] Implicit Places using invariants and state equation in 422 ms returned [159, 160, 167, 168, 169, 170, 171, 172, 173, 174, 210]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 712 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 358/538 places, 130/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 358 /358 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 783 ms. Remains : 358/538 places, 130/176 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-03
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-03 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 369 are kept as prefixes of interest. Removing 169 places using SCC suffix rule.2 ms
Discarding 169 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 368 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 367 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 367 transition count 129
Applied a total of 26 rules in 31 ms. Remains 367 /538 variables (removed 171) and now considering 129/176 (removed 47) transitions.
// Phase 1: matrix 129 rows 367 cols
[2024-05-25 16:46:08] [INFO ] Computed 240 invariants in 2 ms
[2024-05-25 16:46:08] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-25 16:46:08] [INFO ] Invariant cache hit.
[2024-05-25 16:46:08] [INFO ] Implicit Places using invariants and state equation in 394 ms returned [277, 278, 279, 280, 281, 282, 332, 335, 336, 337, 338]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 636 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/538 places, 129/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 676 ms. Remains : 356/538 places, 129/176 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-04
Product exploration explored 100000 steps with 6655 reset in 218 ms.
Product exploration explored 100000 steps with 6642 reset in 238 ms.
Computed a total of 356 stabilizing places and 129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 356 transition count 129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-04 finished in 1396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 132 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 523 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 520 transition count 171
Applied a total of 5 rules in 26 ms. Remains 520 /538 variables (removed 18) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2024-05-25 16:46:09] [INFO ] Computed 351 invariants in 6 ms
[2024-05-25 16:46:09] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-25 16:46:09] [INFO ] Invariant cache hit.
[2024-05-25 16:46:10] [INFO ] Implicit Places using invariants and state equation in 606 ms returned [311, 312, 319, 320, 321, 322, 323, 324, 325, 326, 363, 439, 440, 441, 442, 443, 444, 496, 499, 500, 501, 502]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 976 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/538 places, 171/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1014 ms. Remains : 498/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-05
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-05 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 12 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-25 16:46:10] [INFO ] Computed 350 invariants in 17 ms
[2024-05-25 16:46:11] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-25 16:46:11] [INFO ] Invariant cache hit.
[2024-05-25 16:46:11] [INFO ] Implicit Places using invariants and state equation in 777 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1189 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1213 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-08 finished in 1328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 10 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
[2024-05-25 16:46:11] [INFO ] Invariant cache hit.
[2024-05-25 16:46:12] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-25 16:46:12] [INFO ] Invariant cache hit.
[2024-05-25 16:46:13] [INFO ] Implicit Places using invariants and state equation in 817 ms returned [303, 304, 311, 312, 313, 314, 315, 316, 317, 318, 355]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1207 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1227 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-12 finished in 1348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((G(p1) U p2)&&p0))))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 526 transition count 176
Applied a total of 12 rules in 10 ms. Remains 526 /538 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 526 cols
[2024-05-25 16:46:13] [INFO ] Computed 351 invariants in 11 ms
[2024-05-25 16:46:13] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-25 16:46:13] [INFO ] Invariant cache hit.
[2024-05-25 16:46:14] [INFO ] Implicit Places using invariants and state equation in 806 ms returned [305, 306, 313, 314, 315, 316, 317, 318, 319, 320, 357]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1188 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/538 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 515 /515 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1205 ms. Remains : 515/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-13 finished in 1556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-25 16:46:15] [INFO ] Flatten gal took : 28 ms
[2024-05-25 16:46:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-25 16:46:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 538 places, 176 transitions and 1275 arcs took 5 ms.
Total runtime 151810 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 538
TRANSITIONS: 176
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1118
MODEL NAME: /home/mcc/execution/411/model
538 places, 176 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-02 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716656357520

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

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

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