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.r091-tall-171624188200681.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 DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:42 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 DES-PT-20a-CTLCardinality-2024-00
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-01
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-02
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-03
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-04
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-05
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-06
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-07
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-08
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-09
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-10
FORMULA_NAME DES-PT-20a-CTLCardinality-2024-11
FORMULA_NAME DES-PT-20a-CTLCardinality-2023-12
FORMULA_NAME DES-PT-20a-CTLCardinality-2023-13
FORMULA_NAME DES-PT-20a-CTLCardinality-2023-14
FORMULA_NAME DES-PT-20a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716317082150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:44:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 18:44:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:44:43] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-21 18:44:43] [INFO ] Transformed 195 places.
[2024-05-21 18:44:43] [INFO ] Transformed 152 transitions.
[2024-05-21 18:44:43] [INFO ] Found NUPN structural information;
[2024-05-21 18:44:43] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Applied a total of 0 rules in 15 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2024-05-21 18:44:43] [INFO ] Computed 59 invariants in 22 ms
[2024-05-21 18:44:43] [INFO ] Implicit Places using invariants in 318 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 138/138 transitions.
Applied a total of 0 rules in 6 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 194/195 places, 138/138 transitions.
Support contains 91 out of 194 places after structural reductions.
[2024-05-21 18:44:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 18:44:44] [INFO ] Flatten gal took : 45 ms
[2024-05-21 18:44:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DES-PT-20a-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:44:44] [INFO ] Flatten gal took : 17 ms
[2024-05-21 18:44:44] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 78 out of 194 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (894 resets) in 2164 ms. (18 steps per ms) remains 17/51 properties
BEST_FIRST walk for 4003 steps (19 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (18 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (20 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (17 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (18 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (16 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
// Phase 1: matrix 138 rows 194 cols
[2024-05-21 18:44:45] [INFO ] Computed 58 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 6/35 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 68/103 variables, 29/68 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 72/175 variables, 25/161 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 72/233 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 11 (OVERLAPS) 137/312 variables, 175/408 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/408 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 20/332 variables, 19/427 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/332 variables, 19/446 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-21 18:44:46] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 10 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/332 variables, 1/447 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 0/447 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/332 variables, 0/447 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 447 constraints, problems are : Problem set: 2 solved, 15 unsolved in 1807 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 2/24 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 72/99 variables, 31/60 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 72/132 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 76/175 variables, 25/157 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 76/233 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 1/234 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/234 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 137/312 variables, 175/409 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 13/422 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-21 18:44:48] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-21 18:44:48] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:44:48] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:44:48] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:44:48] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 5/427 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 0/427 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 20/332 variables, 19/446 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 19/465 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 2/467 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-21 18:44:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 1/468 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 468 constraints, problems are : Problem set: 2 solved, 15 unsolved in 5011 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 6872ms problems are : Problem set: 2 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 138/138 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 193 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 193 transition count 136
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 193 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 192 transition count 135
Applied a total of 10 rules in 62 ms. Remains 192 /194 variables (removed 2) and now considering 135/138 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 192/194 places, 135/138 transitions.
RANDOM walk for 40000 steps (673 resets) in 471 ms. (84 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40003 steps (131 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (118 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (109 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (111 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (117 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (119 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (117 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (124 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (116 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (124 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (131 resets) in 97 ms. (408 steps per ms) remains 11/12 properties
// Phase 1: matrix 135 rows 192 cols
[2024-05-21 18:44:52] [INFO ] Computed 59 invariants in 3 ms
[2024-05-21 18:44:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 12/31 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 109/140 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 21/161 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 114/276 variables, 162/216 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 33/309 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/309 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/310 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/310 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/310 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 17/327 variables, 17/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/327 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 0/327 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 253 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 12/31 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 109/140 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 21/161 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 18:44:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 114/276 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 9/228 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 18:44:54] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 18:44:54] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/276 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 33/309 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/309 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 1/310 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/310 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/310 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 17/327 variables, 17/267 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 18:44:55] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/327 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/327 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (OVERLAPS) 0/327 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 268 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2829 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints]
After SMT, in 3921ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 3 properties in 8690 ms.
Support contains 11 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 135/135 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 27 ms. Remains 192 /192 variables (removed 0) and now considering 134/135 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 192/192 places, 134/135 transitions.
RANDOM walk for 40000 steps (551 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (87 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (92 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (95 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (84 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 713508 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 8
Probabilistic random walk after 713508 steps, saw 102570 distinct states, run finished after 3004 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 18:45:08] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 18:45:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/32 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 107/139 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 21/160 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 8 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 12/32 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 107/139 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 21/160 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:45:10] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:45:10] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:45:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 12/284 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/285 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/285 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/285 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 22/307 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/307 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/307 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 19/326 variables, 19/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:45:11] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-21 18:45:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/326 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 0/326 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 267 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2287 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 3244ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 7 properties in 2093 ms.
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (545 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (97 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1906222 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :0 out of 1
Probabilistic random walk after 1906222 steps, saw 265764 distinct states, run finished after 3001 ms. (steps per millisecond=635 ) properties seen :0
[2024-05-21 18:45:17] [INFO ] Invariant cache hit.
[2024-05-21 18:45:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/129 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 95/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/129 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/154 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/161 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/284 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/307 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/326 variables, 19/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 34212 steps, including 76 resets, run visited all 1 properties in 70 ms. (steps per millisecond=488 )
Parikh walk visited 1 properties in 80 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 138 transitions.
FORMULA DES-PT-20a-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 92 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 15 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 6 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 7 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 13 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 8 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 6 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 12 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 6 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 137
Applied a total of 2 rules in 6 ms. Remains 193 /194 variables (removed 1) and now considering 137/138 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 194/194 places, 138/138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:45:17] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:45:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:45:18] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 18:45:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 138 transitions and 675 arcs took 2 ms.
Total runtime 34718 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-20a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 194
TRANSITIONS: 138
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 614
MODEL NAME: /home/mcc/execution/410/model
194 places, 138 transitions.

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 DES-PT-20a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20a-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-2023-12 CANNOT_COMPUTE
FORMULA DES-PT-20a-CTLCardinality-2023-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716318018612

--------------------
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

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="DES-PT-20a"
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 DES-PT-20a, 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 r091-tall-171624188200681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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