About the Execution of GreatSPN+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14333.256 | 1796367.00 | 5628078.00 | 1500.40 | TT??????F??????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r091-tall-171624188300730.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-50a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300730
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 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 97K 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-50a-CTLFireability-2024-00
FORMULA_NAME DES-PT-50a-CTLFireability-2024-01
FORMULA_NAME DES-PT-50a-CTLFireability-2024-02
FORMULA_NAME DES-PT-50a-CTLFireability-2024-03
FORMULA_NAME DES-PT-50a-CTLFireability-2024-04
FORMULA_NAME DES-PT-50a-CTLFireability-2024-05
FORMULA_NAME DES-PT-50a-CTLFireability-2024-06
FORMULA_NAME DES-PT-50a-CTLFireability-2024-07
FORMULA_NAME DES-PT-50a-CTLFireability-2024-08
FORMULA_NAME DES-PT-50a-CTLFireability-2024-09
FORMULA_NAME DES-PT-50a-CTLFireability-2024-10
FORMULA_NAME DES-PT-50a-CTLFireability-2024-11
FORMULA_NAME DES-PT-50a-CTLFireability-2023-12
FORMULA_NAME DES-PT-50a-CTLFireability-2023-13
FORMULA_NAME DES-PT-50a-CTLFireability-2023-14
FORMULA_NAME DES-PT-50a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716324459153
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:47:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 20:47:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:47:40] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 20:47:40] [INFO ] Transformed 314 places.
[2024-05-21 20:47:40] [INFO ] Transformed 271 transitions.
[2024-05-21 20:47:40] [INFO ] Found NUPN structural information;
[2024-05-21 20:47:40] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 81 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 33 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-21 20:47:40] [INFO ] Computed 59 invariants in 29 ms
[2024-05-21 20:47:41] [INFO ] Implicit Places using invariants in 430 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 518 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 81 out of 313 places after structural reductions.
[2024-05-21 20:47:41] [INFO ] Flatten gal took : 51 ms
[2024-05-21 20:47:41] [INFO ] Flatten gal took : 26 ms
[2024-05-21 20:47:41] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 80 out of 313 places (down from 81) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 50 to 48
RANDOM walk for 40000 steps (884 resets) in 1666 ms. (23 steps per ms) remains 33/48 properties
BEST_FIRST walk for 4002 steps (19 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (15 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (19 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (18 resets) in 63 ms. (62 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (24 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (18 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (15 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (25 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (24 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (18 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
// Phase 1: matrix 257 rows 313 cols
[2024-05-21 20:47:42] [INFO ] Computed 58 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 14/67 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 57/124 variables, 25/100 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 57/157 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 136/260 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 136/316 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 6/266 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 14 (OVERLAPS) 256/522 variables, 266/590 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/590 constraints. Problems are: Problem set: 2 solved, 31 unsolved
SMT process timed out in 5132ms, After SMT, problems are : Problem set: 2 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 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 313 transition count 255
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 313 transition count 255
Applied a total of 6 rules in 49 ms. Remains 313 /313 variables (removed 0) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 313/313 places, 255/257 transitions.
RANDOM walk for 40000 steps (537 resets) in 731 ms. (54 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (27 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (25 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (11 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (27 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 631328 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 30
Probabilistic random walk after 631328 steps, saw 90907 distinct states, run finished after 3004 ms. (steps per millisecond=210 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-21 20:47:50] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 20:47:50] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 14/61 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 66/127 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 142/269 variables, 24/187 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 142/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 255/524 variables, 269/598 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 44/568 variables, 44/644 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 44/688 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 688 constraints, problems are : Problem set: 0 solved, 30 unsolved in 35380 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 14/61 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 66/127 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 142/269 variables, 24/187 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 142/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 255/524 variables, 269/598 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-21 20:48:48] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 15 ms to minimize.
[2024-05-21 20:48:49] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-21 20:48:49] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:48:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:48:52] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-21 20:49:04] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:49:06] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
[2024-05-21 20:49:06] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 11 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/568 variables, and 617 constraints, problems are : Problem set: 0 solved, 30 unsolved in 45017 ms.
Refiners :[Domain max(s): 269/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 269/313 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 9/30 constraints, Known Traps: 8/8 constraints]
After SMT, in 80494ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 313/313 places, 255/255 transitions.
RANDOM walk for 40000 steps (544 resets) in 595 ms. (67 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (26 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (10 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (27 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 484820 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 30
Probabilistic random walk after 484820 steps, saw 69746 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2024-05-21 20:49:15] [INFO ] Invariant cache hit.
[2024-05-21 20:49:15] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 14/61 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 66/127 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 142/269 variables, 24/187 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 142/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 255/524 variables, 269/598 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 44/568 variables, 44/644 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 44/688 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 688 constraints, problems are : Problem set: 0 solved, 30 unsolved in 32231 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 14/61 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 66/127 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 142/269 variables, 24/187 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 142/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 255/524 variables, 269/598 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-21 20:50:07] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:50:08] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:50:08] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:50:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 20:50:09] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:50:09] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:50:10] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 7/616 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (OVERLAPS) 44/568 variables, 44/660 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 44/704 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 21/725 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 725 constraints, problems are : Problem set: 0 solved, 30 unsolved in 75010 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 7/7 constraints]
After SMT, in 107299ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 20:51:02] [INFO ] Invariant cache hit.
[2024-05-21 20:51:02] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 20:51:02] [INFO ] Invariant cache hit.
[2024-05-21 20:51:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:51:03] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-05-21 20:51:03] [INFO ] Redundant transitions in 13 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-21 20:51:03] [INFO ] Invariant cache hit.
[2024-05-21 20:51:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/313 variables, 36/359 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 255/568 variables, 313/686 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-21 20:51:23] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:51:23] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:51:23] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:51:23] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/568 variables, 4/692 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 568/568 variables, and 692 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30023 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 1/313 variables, 36/359 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-21 20:51:35] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 20:51:35] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-21 20:51:36] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
[2024-05-21 20:51:36] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 255/568 variables, 313/694 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 254/950 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/568 variables, and 950 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 313/313 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 8/8 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61020 ms. Remains : 313/313 places, 255/255 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-21 20:52:03] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:52:03] [INFO ] Flatten gal took : 22 ms
[2024-05-21 20:52:03] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 30 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:03] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:52:03] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:52:03] [INFO ] Input system was already deterministic with 256 transitions.
RANDOM walk for 40000 steps (899 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (181 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1690948 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :0 out of 1
Probabilistic random walk after 1690948 steps, saw 231228 distinct states, run finished after 3003 ms. (steps per millisecond=563 ) properties seen :0
// Phase 1: matrix 256 rows 312 cols
[2024-05-21 20:52:06] [INFO ] Computed 58 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/568 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 174/253 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/259 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 255/514 variables, 259/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:52:07] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 54/568 variables, 53/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 261 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 8 place count 312 transition count 254
Applied a total of 8 rules in 21 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 312/312 places, 254/256 transitions.
RANDOM walk for 4000000 steps (53978 resets) in 9363 ms. (427 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (7023 resets) in 5179 ms. (772 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 5144907 steps, run timeout after 9001 ms. (steps per millisecond=571 ) properties seen :0 out of 1
Probabilistic random walk after 5144907 steps, saw 677353 distinct states, run finished after 9001 ms. (steps per millisecond=571 ) properties seen :0
// Phase 1: matrix 254 rows 312 cols
[2024-05-21 20:52:20] [INFO ] Computed 60 invariants in 10 ms
[2024-05-21 20:52:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/262 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/566 variables, 50/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/262 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 254/516 variables, 262/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 20:52:21] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 50/566 variables, 50/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/566 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 312/312 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24985 steps, including 89 resets, run visited all 1 properties in 74 ms. (steps per millisecond=337 )
FORMULA DES-PT-50a-CTLFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 83 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 18 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 313/313 places, 257/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:52:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:52:21] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 17 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 311/313 places, 255/257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 15 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:52:22] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 13 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 312/313 places, 256/257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:52:22] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 311 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 311 transition count 255
Applied a total of 2 rules in 13 ms. Remains 311 /313 variables (removed 2) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 311/313 places, 255/257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:52:22] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 313/313 places, 257/257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:52:22] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:52:22] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:52:22] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-05-21 20:52:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 257 transitions and 1239 arcs took 2 ms.
Total runtime 282120 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-50a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 313
TRANSITIONS: 257
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.005s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 675
MODEL NAME: /home/mcc/execution/413/model
313 places, 257 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-50a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-50a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-50a-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA DES-PT-50a-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716326255520
--------------------
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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-50a, 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 r091-tall-171624188300730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 '
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 ;