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.r480-tall-171624189800681.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800681
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:10:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:10:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:10:10] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-31 22:10:10] [INFO ] Transformed 195 places.
[2024-05-31 22:10:10] [INFO ] Transformed 152 transitions.
[2024-05-31 22:10:10] [INFO ] Found NUPN structural information;
[2024-05-31 22:10:10] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 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 16 ms. Remains 195 /195 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 195 cols
[2024-05-31 22:10:10] [INFO ] Computed 59 invariants in 22 ms
[2024-05-31 22:10:10] [INFO ] Implicit Places using invariants in 423 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 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 495 ms. Remains : 194/195 places, 138/138 transitions.
Support contains 91 out of 194 places after structural reductions.
[2024-05-31 22:10:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 22:10:11] [INFO ] Flatten gal took : 47 ms
[2024-05-31 22:10:11] [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-31 22:10:11] [INFO ] Flatten gal took : 19 ms
[2024-05-31 22:10:11] [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 (897 resets) in 1429 ms. (27 steps per ms) remains 17/51 properties
BEST_FIRST walk for 4003 steps (16 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (21 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (19 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (16 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (19 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 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (18 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
// Phase 1: matrix 138 rows 194 cols
[2024-05-31 22:10:11] [INFO ] Computed 58 invariants in 6 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
At refinement iteration 16 (OVERLAPS) 0/332 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 446 constraints, problems are : Problem set: 2 solved, 15 unsolved in 1234 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: 0/0 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
[2024-05-31 22:10:13] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 16 ms to minimize.
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-31 22:10:14] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
[2024-05-31 22:10:14] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:10:14] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:10:14] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/312 variables, 4/426 constraints. Problems are: Problem set: 2 solved, 15 unsolved
[2024-05-31 22:10:15] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:10:15] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:10:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:10:15] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 4/430 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/312 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 20/332 variables, 19/449 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 19/468 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 2/470 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 470 constraints, problems are : Problem set: 2 solved, 15 unsolved in 5012 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: 9/9 constraints]
After SMT, in 6295ms 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 49 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 49 ms. Remains : 192/194 places, 135/138 transitions.
RANDOM walk for 40000 steps (668 resets) in 580 ms. (68 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40004 steps (117 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (130 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (115 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (121 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (122 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (121 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (120 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (114 resets) in 60 ms. (655 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (121 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (120 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (136 resets) in 76 ms. (519 steps per ms) remains 9/11 properties
// Phase 1: matrix 135 rows 192 cols
[2024-05-31 22:10:18] [INFO ] Computed 59 invariants in 4 ms
[2024-05-31 22:10:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/28 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 109/137 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/158 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 4/162 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 114/276 variables, 162/216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:10:19] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 33/309 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/310 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/310 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/310 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 17/327 variables, 17/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 254 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1016 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: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/28 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 109/137 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/158 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 4/162 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 114/276 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 33/309 variables, 12/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:10:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:10:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/309 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 1/310 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/310 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/310 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 17/327 variables, 17/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:10:21] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/327 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/327 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 0/327 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 266 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1632 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: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 6907 ms.
Support contains 12 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 135/135 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 192/192 places, 135/135 transitions.
RANDOM walk for 40000 steps (660 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (119 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (119 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (116 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (123 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (123 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (110 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (112 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (116 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (136 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 812400 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 9
Probabilistic random walk after 812400 steps, saw 110503 distinct states, run finished after 3008 ms. (steps per millisecond=270 ) properties seen :0
[2024-05-31 22:10:31] [INFO ] Invariant cache hit.
[2024-05-31 22:10:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/28 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 109/137 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/158 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/162 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 114/276 variables, 162/216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:10:32] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 33/309 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/310 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/310 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/310 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 17/327 variables, 17/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/327 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 254 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1029 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: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/28 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 109/137 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/158 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 4/162 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 114/276 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 33/309 variables, 12/238 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:10:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/309 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 1/310 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/310 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/310 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 17/327 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 22:10:34] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/327 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/327 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 0/327 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 265 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1674 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: 9/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 2728ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 7253 ms.
Support contains 12 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-31 22:10:41] [INFO ] Invariant cache hit.
[2024-05-31 22:10:42] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-31 22:10:42] [INFO ] Invariant cache hit.
[2024-05-31 22:10:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:10:42] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-31 22:10:42] [INFO ] Redundant transitions in 4 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-31 22:10:42] [INFO ] Invariant cache hit.
[2024-05-31 22:10:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 135/326 variables, 191/250 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:10:44] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:10:45] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:10:46] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 1/327 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:10:48] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:10:49] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:10:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 16 (OVERLAPS) 0/327 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 261 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10325 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: 132/132 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 135/326 variables, 191/258 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 132/392 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 1/327 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-31 22:11:03] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 394 constraints, problems are : Problem set: 0 solved, 132 unsolved in 28434 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: 132/132 constraints, Known Traps: 9/9 constraints]
After SMT, in 38825ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 38828ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39219 ms. Remains : 192/192 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 135
Applied a total of 1 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 135 rows 192 cols
[2024-05-31 22:11:21] [INFO ] Computed 59 invariants in 3 ms
[2024-05-31 22:11:21] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-31 22:11:21] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-31 22:11:21] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 22:11:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-31 22:11:21] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 10 ms returned sat
[2024-05-31 22:11:21] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-31 22:11:21] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:11:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 1
[2024-05-31 22:11:21] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-31 22:11:21] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 800 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-31 22:11:21] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:11:21] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:11:22] [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 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 13 ms. Remains : 193/194 places, 137/138 transitions.
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:11:22] [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 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-31 22:11:22] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:11:22] [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 14 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-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:11:22] [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-31 22:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:11:22] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 22:11:22] [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 72368 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-01
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-02
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-03
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-06
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-07
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-08
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-09
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2024-11
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2023-12
Could not compute solution for formula : DES-PT-20a-CTLCardinality-2023-13

BK_STOP 1717193482881

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r480-tall-171624189800681"
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 ;