fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r311-tall-171662335800089
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-22

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13021.596 3600000.00 7349046.00 6373.60 ??TT????T????FTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800089.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-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 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 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 503K 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-22-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-22-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716656976154

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 17:09:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 17:09:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:09:37] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-25 17:09:37] [INFO ] Transformed 1966 places.
[2024-05-25 17:09:37] [INFO ] Transformed 356 transitions.
[2024-05-25 17:09:37] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Support contains 1944 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 26 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1966 cols
[2024-05-25 17:09:37] [INFO ] Computed 1611 invariants in 97 ms
[2024-05-25 17:09:38] [INFO ] Implicit Places using invariants in 816 ms returned []
[2024-05-25 17:09:38] [INFO ] Invariant cache hit.
[2024-05-25 17:09:40] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 17:09:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-25 17:10:01] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 10 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 17:10:02] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 3 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-25 17:10:03] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 20/1101 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1943/2322 variables, and 1101 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1078/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 20/1101 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-25 17:10:22] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-25 17:10:22] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1943 variables, 2/1103 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1943/2322 variables, and 1103 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1078/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/332 constraints, Known Traps: 22/22 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60650ms
Finished structural reductions in LTL mode , in 1 iterations and 63052 ms. Remains : 1966/1966 places, 356/356 transitions.
Support contains 1944 out of 1966 places after structural reductions.
[2024-05-25 17:10:41] [INFO ] Flatten gal took : 170 ms
[2024-05-25 17:10:41] [INFO ] Flatten gal took : 82 ms
[2024-05-25 17:10:41] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (1486 resets) in 7157 ms. (5 steps per ms) remains 100/105 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
Probabilistic random walk after 100001 steps, saw 16156 distinct states, run finished after 1270 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-25 17:10:45] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1943 variables, 2/2 constraints. Problems are: Problem set: 13 solved, 87 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1943 variables, 1586/1588 constraints. Problems are: Problem set: 19 solved, 81 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1943/2322 variables, and 1588 constraints, problems are : Problem set: 19 solved, 81 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 1586/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1942 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1942 variables, 1586/1587 constraints. Problems are: Problem set: 19 solved, 81 unsolved
[2024-05-25 17:10:51] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 9 ms to minimize.
[2024-05-25 17:10:52] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 4 ms to minimize.
[2024-05-25 17:10:52] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 4 ms to minimize.
[2024-05-25 17:10:52] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 5 ms to minimize.
[2024-05-25 17:10:53] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 5 ms to minimize.
[2024-05-25 17:10:53] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 5 ms to minimize.
[2024-05-25 17:10:53] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 5 ms to minimize.
[2024-05-25 17:10:53] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 4 ms to minimize.
[2024-05-25 17:10:54] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 5 ms to minimize.
[2024-05-25 17:10:54] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 5 ms to minimize.
[2024-05-25 17:10:54] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 4 ms to minimize.
[2024-05-25 17:10:54] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 4 ms to minimize.
[2024-05-25 17:10:54] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 7 ms to minimize.
[2024-05-25 17:10:55] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 4 ms to minimize.
[2024-05-25 17:10:55] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 3 ms to minimize.
SMT process timed out in 10312ms, After SMT, problems are : Problem set: 19 solved, 81 unsolved
Fused 81 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1942 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 34 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1966/1966 places, 356/356 transitions.
RANDOM walk for 40000 steps (1481 resets) in 5164 ms. (7 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (10 resets) in 45 ms. (87 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (9 resets) in 51 ms. (76 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 86 ms. (46 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (9 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 100 ms. (39 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (10 resets) in 90 ms. (44 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (10 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 59 ms. (66 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 40 ms. (97 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 67 ms. (58 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (12 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (10 resets) in 47 ms. (83 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 78 ms. (50 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (10 resets) in 43 ms. (90 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (10 resets) in 52 ms. (75 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (11 resets) in 92 ms. (43 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (10 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 59 ms. (66 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (11 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 81/81 properties
Interrupted probabilistic random walk after 473986 steps, run timeout after 6001 ms. (steps per millisecond=78 ) properties seen :0 out of 81
Probabilistic random walk after 473986 steps, saw 66497 distinct states, run finished after 6008 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-25 17:11:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1942 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1942 variables, 1586/1587 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1942 variables, 0/1587 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/1944 variables, 2/1589 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1944 variables, 0/1589 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 22/1966 variables, 22/1611 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1966 variables, 0/1611 constraints. Problems are: Problem set: 9 solved, 72 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp104 is UNSAT
At refinement iteration 7 (OVERLAPS) 356/2322 variables, 1966/3577 constraints. Problems are: Problem set: 43 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2322 variables, 0/3577 constraints. Problems are: Problem set: 43 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/2322 variables, 0/3577 constraints. Problems are: Problem set: 43 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2322/2322 variables, and 3577 constraints, problems are : Problem set: 43 solved, 38 unsolved in 37735 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 1/1 constraints. Problems are: Problem set: 43 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1916 variables, 1564/1565 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:11:42] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2024-05-25 17:11:42] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-25 17:11:42] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
[2024-05-25 17:11:42] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-25 17:11:42] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-25 17:11:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-25 17:11:43] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-25 17:11:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-25 17:11:43] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-25 17:11:43] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-25 17:11:43] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-25 17:11:44] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 6 ms to minimize.
[2024-05-25 17:11:44] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 6 ms to minimize.
[2024-05-25 17:11:44] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 6 ms to minimize.
[2024-05-25 17:11:45] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 6 ms to minimize.
[2024-05-25 17:11:45] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 6 ms to minimize.
[2024-05-25 17:11:45] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 6 ms to minimize.
[2024-05-25 17:11:46] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 5 ms to minimize.
[2024-05-25 17:11:46] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 5 ms to minimize.
[2024-05-25 17:11:46] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1916 variables, 20/1585 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:11:48] [INFO ] Deduced a trap composed of 6 places in 691 ms of which 9 ms to minimize.
[2024-05-25 17:11:49] [INFO ] Deduced a trap composed of 6 places in 667 ms of which 8 ms to minimize.
[2024-05-25 17:11:49] [INFO ] Deduced a trap composed of 6 places in 608 ms of which 8 ms to minimize.
[2024-05-25 17:11:50] [INFO ] Deduced a trap composed of 6 places in 619 ms of which 8 ms to minimize.
[2024-05-25 17:11:50] [INFO ] Deduced a trap composed of 10 places in 586 ms of which 8 ms to minimize.
[2024-05-25 17:11:51] [INFO ] Deduced a trap composed of 5 places in 583 ms of which 8 ms to minimize.
[2024-05-25 17:11:52] [INFO ] Deduced a trap composed of 9 places in 577 ms of which 7 ms to minimize.
[2024-05-25 17:11:52] [INFO ] Deduced a trap composed of 6 places in 559 ms of which 9 ms to minimize.
[2024-05-25 17:11:53] [INFO ] Deduced a trap composed of 9 places in 515 ms of which 6 ms to minimize.
[2024-05-25 17:11:53] [INFO ] Deduced a trap composed of 10 places in 520 ms of which 7 ms to minimize.
[2024-05-25 17:11:54] [INFO ] Deduced a trap composed of 6 places in 483 ms of which 7 ms to minimize.
[2024-05-25 17:11:54] [INFO ] Deduced a trap composed of 6 places in 463 ms of which 6 ms to minimize.
[2024-05-25 17:11:55] [INFO ] Deduced a trap composed of 9 places in 427 ms of which 6 ms to minimize.
[2024-05-25 17:11:55] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 6 ms to minimize.
[2024-05-25 17:11:55] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 3 ms to minimize.
[2024-05-25 17:11:56] [INFO ] Deduced a trap composed of 5 places in 444 ms of which 6 ms to minimize.
[2024-05-25 17:11:56] [INFO ] Deduced a trap composed of 10 places in 409 ms of which 6 ms to minimize.
[2024-05-25 17:11:57] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1916 variables, 18/1603 constraints. Problems are: Problem set: 43 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1916 variables, 0/1603 constraints. Problems are: Problem set: 43 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 5/1921 variables, 2/1605 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:12:00] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 4 ms to minimize.
[2024-05-25 17:12:01] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-05-25 17:12:01] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-25 17:12:01] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-05-25 17:12:01] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 4 ms to minimize.
[2024-05-25 17:12:01] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 4 ms to minimize.
[2024-05-25 17:12:02] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-25 17:12:02] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 4 ms to minimize.
[2024-05-25 17:12:02] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-25 17:12:02] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-25 17:12:03] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-25 17:12:03] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 3 ms to minimize.
[2024-05-25 17:12:03] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-25 17:12:03] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 4 ms to minimize.
[2024-05-25 17:12:03] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 4 ms to minimize.
[2024-05-25 17:12:04] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-25 17:12:04] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-25 17:12:04] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-05-25 17:12:04] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-05-25 17:12:04] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1921 variables, 20/1625 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:12:05] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 7 ms to minimize.
[2024-05-25 17:12:05] [INFO ] Deduced a trap composed of 6 places in 459 ms of which 6 ms to minimize.
[2024-05-25 17:12:06] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 6 ms to minimize.
[2024-05-25 17:12:06] [INFO ] Deduced a trap composed of 6 places in 400 ms of which 6 ms to minimize.
[2024-05-25 17:12:07] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 3 ms to minimize.
[2024-05-25 17:12:07] [INFO ] Deduced a trap composed of 11 places in 524 ms of which 7 ms to minimize.
[2024-05-25 17:12:08] [INFO ] Deduced a trap composed of 9 places in 508 ms of which 7 ms to minimize.
[2024-05-25 17:12:08] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 7 ms to minimize.
[2024-05-25 17:12:09] [INFO ] Deduced a trap composed of 13 places in 506 ms of which 7 ms to minimize.
[2024-05-25 17:12:09] [INFO ] Deduced a trap composed of 6 places in 532 ms of which 8 ms to minimize.
[2024-05-25 17:12:10] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 4 ms to minimize.
[2024-05-25 17:12:10] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 4 ms to minimize.
[2024-05-25 17:12:10] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2024-05-25 17:12:10] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 4 ms to minimize.
[2024-05-25 17:12:10] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 4 ms to minimize.
[2024-05-25 17:12:11] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 4 ms to minimize.
[2024-05-25 17:12:11] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-05-25 17:12:11] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-25 17:12:12] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 4 ms to minimize.
[2024-05-25 17:12:12] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1921 variables, 20/1645 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:12:13] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-25 17:12:13] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 4 ms to minimize.
[2024-05-25 17:12:13] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-25 17:12:13] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2024-05-25 17:12:13] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-25 17:12:14] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 4 ms to minimize.
[2024-05-25 17:12:14] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-25 17:12:14] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 4 ms to minimize.
[2024-05-25 17:12:14] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-05-25 17:12:14] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-25 17:12:15] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-25 17:12:16] [INFO ] Deduced a trap composed of 9 places in 606 ms of which 8 ms to minimize.
[2024-05-25 17:12:16] [INFO ] Deduced a trap composed of 6 places in 628 ms of which 8 ms to minimize.
[2024-05-25 17:12:17] [INFO ] Deduced a trap composed of 6 places in 592 ms of which 7 ms to minimize.
[2024-05-25 17:12:17] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1921 variables, 15/1660 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:12:19] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 3 ms to minimize.
[2024-05-25 17:12:19] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-25 17:12:20] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 4 ms to minimize.
[2024-05-25 17:12:20] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-25 17:12:20] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-25 17:12:20] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 4 ms to minimize.
[2024-05-25 17:12:21] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-05-25 17:12:21] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-05-25 17:12:21] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-25 17:12:21] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-25 17:12:21] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-25 17:12:22] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-25 17:12:22] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 4 ms to minimize.
[2024-05-25 17:12:22] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-25 17:12:22] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-25 17:12:22] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-25 17:12:23] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-05-25 17:12:23] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-05-25 17:12:23] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-25 17:12:23] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1921 variables, 20/1680 constraints. Problems are: Problem set: 43 solved, 38 unsolved
[2024-05-25 17:12:25] [INFO ] Deduced a trap composed of 6 places in 557 ms of which 7 ms to minimize.
[2024-05-25 17:12:25] [INFO ] Deduced a trap composed of 6 places in 557 ms of which 8 ms to minimize.
[2024-05-25 17:12:26] [INFO ] Deduced a trap composed of 10 places in 551 ms of which 8 ms to minimize.
[2024-05-25 17:12:27] [INFO ] Deduced a trap composed of 10 places in 510 ms of which 7 ms to minimize.
SMT process timed out in 83292ms, After SMT, problems are : Problem set: 43 solved, 38 unsolved
Fused 38 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1916 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1965 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1965 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1964 transition count 353
Applied a total of 4 rules in 75 ms. Remains 1964 /1966 variables (removed 2) and now considering 353/356 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1964/1966 places, 353/356 transitions.
Successfully simplified 62 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 17:12:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-25 17:12:27] [INFO ] Flatten gal took : 60 ms
[2024-05-25 17:12:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 17:12:27] [INFO ] Flatten gal took : 58 ms
[2024-05-25 17:12:27] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 1870 out of 1966 places (down from 1918) after GAL structural reductions.
Computed a total of 1966 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1966 transition count 356
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 : 1966/1966 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1918 transition count 356
Applied a total of 48 rules in 238 ms. Remains 1918 /1966 variables (removed 48) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 1918/1966 places, 356/356 transitions.
[2024-05-25 17:12:27] [INFO ] Flatten gal took : 48 ms
[2024-05-25 17:12:27] [INFO ] Flatten gal took : 46 ms
[2024-05-25 17:12:27] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 44 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 1916/1966 places, 356/356 transitions.
[2024-05-25 17:12:27] [INFO ] Flatten gal took : 45 ms
[2024-05-25 17:12:27] [INFO ] Flatten gal took : 46 ms
[2024-05-25 17:12:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1940 transition count 356
Applied a total of 26 rules in 100 ms. Remains 1940 /1966 variables (removed 26) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 1940/1966 places, 356/356 transitions.
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:12:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 68 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 1916/1966 places, 356/356 transitions.
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 37 ms
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:12:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 41 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 1917/1966 places, 356/356 transitions.
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:12:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1939 transition count 356
Applied a total of 27 rules in 34 ms. Remains 1939 /1966 variables (removed 27) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 1939/1966 places, 356/356 transitions.
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 42 ms
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 39 ms
[2024-05-25 17:12:28] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 63 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 1916/1966 places, 356/356 transitions.
[2024-05-25 17:12:28] [INFO ] Flatten gal took : 36 ms
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 37 ms
[2024-05-25 17:12:29] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1363 are kept as prefixes of interest. Removing 603 places using SCC suffix rule.18 ms
Discarding 603 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Applied a total of 91 rules in 211 ms. Remains 1317 /1966 variables (removed 649) and now considering 263/356 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 211 ms. Remains : 1317/1966 places, 263/356 transitions.
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 24 ms
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 25 ms
[2024-05-25 17:12:29] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 127 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 1916/1966 places, 356/356 transitions.
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 34 ms
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 36 ms
[2024-05-25 17:12:29] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1918 transition count 356
Applied a total of 48 rules in 84 ms. Remains 1918 /1966 variables (removed 48) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 1918/1966 places, 356/356 transitions.
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 35 ms
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 36 ms
[2024-05-25 17:12:29] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 65 ms
[2024-05-25 17:12:29] [INFO ] Flatten gal took : 51 ms
[2024-05-25 17:12:30] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-25 17:12:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1966 places, 356 transitions and 4323 arcs took 8 ms.
Total runtime 172757 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-22

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1966
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.027s, Sys 0.003s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 1039
MODEL NAME: /home/mcc/execution/409/model
1966 places, 356 transitions.

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..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-22"
export BK_EXAMINATION="CTLCardinality"
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-22, 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 r311-tall-171662335800089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 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 ;