MCC'2024- Execution of r480-tall-171624189800698

About the Execution of LTSMin+red for DES-PT-30a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
425.396	146842.00	202434.00	254.60	[undef]	Cannot compute

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-171624189800698.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-30a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800698
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 70K 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-30a-CTLFireability-2024-00
FORMULA_NAME DES-PT-30a-CTLFireability-2024-01
FORMULA_NAME DES-PT-30a-CTLFireability-2024-02
FORMULA_NAME DES-PT-30a-CTLFireability-2024-03
FORMULA_NAME DES-PT-30a-CTLFireability-2024-04
FORMULA_NAME DES-PT-30a-CTLFireability-2024-05
FORMULA_NAME DES-PT-30a-CTLFireability-2024-06
FORMULA_NAME DES-PT-30a-CTLFireability-2024-07
FORMULA_NAME DES-PT-30a-CTLFireability-2024-08
FORMULA_NAME DES-PT-30a-CTLFireability-2024-09
FORMULA_NAME DES-PT-30a-CTLFireability-2024-10
FORMULA_NAME DES-PT-30a-CTLFireability-2024-11
FORMULA_NAME DES-PT-30a-CTLFireability-2023-12
FORMULA_NAME DES-PT-30a-CTLFireability-2023-13
FORMULA_NAME DES-PT-30a-CTLFireability-2023-14
FORMULA_NAME DES-PT-30a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717194344900

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:25:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:25:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:25:46] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-31 22:25:46] [INFO ] Transformed 234 places.
[2024-05-31 22:25:46] [INFO ] Transformed 191 transitions.
[2024-05-31 22:25:46] [INFO ] Found NUPN structural information;
[2024-05-31 22:25:46] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 109 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 234 cols
[2024-05-31 22:25:46] [INFO ] Computed 59 invariants in 24 ms
[2024-05-31 22:25:47] [INFO ] Implicit Places using invariants in 437 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 472 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 177/177 transitions.
Applied a total of 0 rules in 9 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 518 ms. Remains : 233/234 places, 177/177 transitions.
Support contains 109 out of 233 places after structural reductions.
[2024-05-31 22:25:47] [INFO ] Flatten gal took : 68 ms
[2024-05-31 22:25:47] [INFO ] Flatten gal took : 32 ms
[2024-05-31 22:25:47] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 107 out of 233 places (down from 109) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 79 to 73
RANDOM walk for 40000 steps (888 resets) in 2085 ms. (19 steps per ms) remains 48/73 properties
BEST_FIRST walk for 4002 steps (18 resets) in 56 ms. (70 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (24 resets) in 80 ms. (49 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (23 resets) in 69 ms. (57 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (15 resets) in 66 ms. (59 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (26 resets) in 53 ms. (74 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (19 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (24 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (22 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (19 resets) in 21 ms. (182 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (25 resets) in 22 ms. (173 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (24 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (17 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (21 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (16 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (21 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (22 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (19 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (24 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (20 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
// Phase 1: matrix 177 rows 233 cols
[2024-05-31 22:25:48] [INFO ] Computed 58 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 27/94 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 34/128 variables, 17/126 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 34/160 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 81/209 variables, 25/185 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 81/266 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 3/212 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (OVERLAPS) 176/388 variables, 212/482 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 16 (OVERLAPS) 22/410 variables, 21/503 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 21/524 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 524 constraints, problems are : Problem set: 0 solved, 48 unsolved in 5018 ms.
Refiners :[Domain max(s): 233/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 27/94 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 34/128 variables, 17/126 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 34/160 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 81/209 variables, 25/185 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 81/266 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 3/212 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:25:54] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 18 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (OVERLAPS) 176/388 variables, 212/483 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 11/494 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/410 variables, and 494 constraints, problems are : Problem set: 0 solved, 48 unsolved in 5006 ms.
Refiners :[Domain max(s): 212/233 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 212/233 constraints, PredecessorRefiner: 11/48 constraints, Known Traps: 1/1 constraints]
After SMT, in 10119ms problems are : Problem set: 0 solved, 48 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 232 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 232 transition count 174
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 232 transition count 174
Applied a total of 6 rules in 44 ms. Remains 232 /233 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 232/233 places, 174/177 transitions.
RANDOM walk for 40000 steps (659 resets) in 761 ms. (52 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (24 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (24 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (24 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (19 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (22 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (22 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
Interrupted probabilistic random walk after 673982 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 48
Probabilistic random walk after 673982 steps, saw 97629 distinct states, run finished after 3023 ms. (steps per millisecond=222 ) properties seen :0
// Phase 1: matrix 174 rows 232 cols
[2024-05-31 22:26:02] [INFO ] Computed 60 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 27/94 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 41/135 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 78/213 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 174/387 variables, 213/273 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:26:03] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:26:03] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:26:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 19/406 variables, 19/295 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:26:06] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 296 constraints, problems are : Problem set: 0 solved, 48 unsolved in 6537 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 27/94 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 41/135 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 78/213 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 22:26:09] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:26:09] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:26:09] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 174/387 variables, 213/280 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 19/406 variables, 19/310 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 37/347 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 347 constraints, problems are : Problem set: 0 solved, 48 unsolved in 23047 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 29650ms problems are : Problem set: 0 solved, 48 unsolved
Fused 48 Parikh solutions to 47 different solutions.
Parikh walk visited 21 properties in 6134 ms.
Support contains 45 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 232/232 places, 174/174 transitions.
RANDOM walk for 40000 steps (661 resets) in 377 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (21 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (24 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 742964 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 27
Probabilistic random walk after 742964 steps, saw 105764 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2024-05-31 22:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 25/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 45/115 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 93/208 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 174/382 variables, 208/268 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 24/406 variables, 24/292 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-31 22:26:42] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:26:42] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:26:43] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-31 22:26:43] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:26:43] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/406 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-31 22:26:44] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:26:44] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:26:44] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 300 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3844 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 25/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 45/115 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 93/208 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 174/382 variables, 208/276 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 24/406 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 21/327 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-31 22:26:52] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/406 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-31 22:26:55] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/406 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 329 constraints, problems are : Problem set: 0 solved, 27 unsolved in 19971 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 10/10 constraints]
After SMT, in 23847ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 1 properties in 3933 ms.
Support contains 43 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 232/232 places, 174/174 transitions.
RANDOM walk for 40000 steps (641 resets) in 358 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (16 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 620720 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 26
Probabilistic random walk after 620720 steps, saw 90820 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-31 22:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 26/69 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 45/114 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 94/208 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 174/382 variables, 208/268 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:27:13] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:27:13] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:27:13] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 24/406 variables, 24/295 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:27:14] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:27:14] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 297 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2737 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 26/69 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 45/114 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 94/208 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 174/382 variables, 208/273 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 24/406 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/406 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 323 constraints, problems are : Problem set: 0 solved, 26 unsolved in 9831 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 5/5 constraints]
After SMT, in 12595ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 7772 ms.
Support contains 43 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 22:27:33] [INFO ] Invariant cache hit.
[2024-05-31 22:27:33] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 22:27:33] [INFO ] Invariant cache hit.
[2024-05-31 22:27:33] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-31 22:27:33] [INFO ] Redundant transitions in 5 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-31 22:27:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/406 variables, 232/292 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:27:35] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:27:35] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:27:36] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 297 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6670 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/232 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/406 variables, 232/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 173/470 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-31 22:27:50] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:27:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 472 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 7/7 constraints]
After SMT, in 36770ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 36775ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37154 ms. Remains : 232/232 places, 174/174 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 30 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 23 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 177 transitions.
Computed a total of 136 stabilizing places and 131 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 23 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 12 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 25 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 12 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 12 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 3 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:10] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 13 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:10] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 3 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:28:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 3 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 232/233 places, 176/177 transitions.
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:28:11] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:28:11] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-31 22:28:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 177 transitions and 859 arcs took 3 ms.
Total runtime 145146 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-30a-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-04
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-06
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-30a-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-30a-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-30a-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-30a-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-30a-CTLFireability-2023-15

BK_STOP 1717194491742

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DES-PT-30a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/645/ctl_0_
ctl formula name DES-PT-30a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/645/ctl_1_
ctl formula name DES-PT-30a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/645/ctl_2_
ctl formula name DES-PT-30a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/645/ctl_3_
ctl formula name DES-PT-30a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/645/ctl_4_
ctl formula name DES-PT-30a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/645/ctl_5_
ctl formula name DES-PT-30a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/645/ctl_6_
ctl formula name DES-PT-30a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/645/ctl_7_
ctl formula name DES-PT-30a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/645/ctl_8_
ctl formula name DES-PT-30a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/645/ctl_9_
ctl formula name DES-PT-30a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/645/ctl_10_
ctl formula name DES-PT-30a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/645/ctl_11_
ctl formula name DES-PT-30a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/645/ctl_12_
ctl formula name DES-PT-30a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/645/ctl_13_
ctl formula name DES-PT-30a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/645/ctl_14_
ctl formula name DES-PT-30a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/645/ctl_15_
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-30a"
export BK_EXAMINATION="CTLFireability"
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-30a, examination is CTLFireability"
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-171624189800698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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