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.r575-smll-171734919400010.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 MedleyA-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 48K Jun 2 16:33 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 MedleyA-PT-02-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351485637

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:04:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:04:48] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-06-02 18:04:48] [INFO ] Transformed 69 places.
[2024-06-02 18:04:48] [INFO ] Transformed 168 transitions.
[2024-06-02 18:04:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:04:48] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 58 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 67 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 160
Applied a total of 4 rules in 43 ms. Remains 67 /69 variables (removed 2) and now considering 160/162 (removed 2) transitions.
// Phase 1: matrix 160 rows 67 cols
[2024-06-02 18:04:48] [INFO ] Computed 9 invariants in 32 ms
[2024-06-02 18:04:49] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-02 18:04:49] [INFO ] Invariant cache hit.
[2024-06-02 18:04:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:04:49] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-06-02 18:04:49] [INFO ] Invariant cache hit.
[2024-06-02 18:04:49] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:04:51] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 25 ms to minimize.
[2024-06-02 18:04:51] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:04:51] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:04:51] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:04:51] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:04:51] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:04:52] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:04:53] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:04:54] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:04:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:04:54] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 160/227 variables, 67/96 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 156 constraints, problems are : Problem set: 0 solved, 159 unsolved in 9851 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/227 variables, 67/96 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 159/315 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:03] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:05:03] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:05:03] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:05:04] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:05:06] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 9/324 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-02 18:05:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 325 constraints, problems are : Problem set: 0 solved, 159 unsolved in 17000 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 30/30 constraints]
After SMT, in 27289ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 27324ms
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 160/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28172 ms. Remains : 67/69 places, 160/162 transitions.
Support contains 58 out of 67 places after structural reductions.
[2024-06-02 18:05:17] [INFO ] Flatten gal took : 76 ms
[2024-06-02 18:05:17] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:05:17] [INFO ] Input system was already deterministic with 160 transitions.
Reduction of identical properties reduced properties to check from 77 to 74
RANDOM walk for 40000 steps (3973 resets) in 3304 ms. (12 steps per ms) remains 33/74 properties
BEST_FIRST walk for 4003 steps (58 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (84 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (96 resets) in 56 ms. (70 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (87 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (85 resets) in 46 ms. (85 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (76 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (90 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (96 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (89 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (122 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (89 resets) in 17 ms. (222 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4002 steps (89 resets) in 19 ms. (200 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4002 steps (90 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (94 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (82 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (75 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (90 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (88 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (83 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (91 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (81 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (87 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (97 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (87 resets) in 49 ms. (80 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4004 steps (102 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (92 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (121 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (80 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (86 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (67 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (118 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (89 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
[2024-06-02 18:05:18] [INFO ] Invariant cache hit.
[2024-06-02 18:05:18] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/65 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-06-02 18:05:19] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:05:19] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:05:19] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/12 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-06-02 18:05:19] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 159/225 variables, 66/79 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 60/139 constraints. Problems are: Problem set: 3 solved, 26 unsolved
[2024-06-02 18:05:19] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 1/140 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 2/227 variables, 1/141 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 141 constraints, problems are : Problem set: 3 solved, 26 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/65 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-06-02 18:05:20] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 159/225 variables, 66/81 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 60/141 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 9/150 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-06-02 18:05:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:05:21] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:05:21] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 3/153 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-06-02 18:05:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
[2024-06-02 18:05:22] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:05:22] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:05:22] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 4/157 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-06-02 18:05:23] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:05:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 2/159 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 2/227 variables, 1/160 constraints. Problems are: Problem set: 4 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 16/176 constraints. Problems are: Problem set: 4 solved, 25 unsolved
[2024-06-02 18:05:24] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 1/177 constraints. Problems are: Problem set: 4 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 177 constraints, problems are : Problem set: 4 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 25/29 constraints, Known Traps: 16/16 constraints]
After SMT, in 6655ms problems are : Problem set: 4 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 285 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 56 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 56 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 25 place count 56 transition count 140
Applied a total of 25 rules in 42 ms. Remains 56 /67 variables (removed 11) and now considering 140/160 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 56/67 places, 140/160 transitions.
RANDOM walk for 40000 steps (4180 resets) in 994 ms. (40 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (87 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (101 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (91 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (95 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (97 resets) in 80 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (95 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (102 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (123 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (93 resets) in 17 ms. (222 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (97 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (97 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (76 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (94 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (95 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (94 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (79 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (99 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (99 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (107 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (96 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (87 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (126 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (97 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
// Phase 1: matrix 140 rows 56 cols
[2024-06-02 18:05:26] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 18:05:26] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 25/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:05:26] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:05:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:05:26] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:05:26] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/56 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:05:26] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 140/196 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 130 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 25/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:05:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:05:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 140/196 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 22/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/196 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 154 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints]
After SMT, in 2682ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 18 properties in 3710 ms.
Support contains 12 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 140/140 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 50 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 50 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 49 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 49 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 47 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 46 transition count 134
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 31 place count 46 transition count 134
Applied a total of 31 rules in 39 ms. Remains 46 /56 variables (removed 10) and now considering 134/140 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 46/56 places, 134/140 transitions.
RANDOM walk for 40000 steps (4946 resets) in 1750 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1192 resets) in 55 ms. (714 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1170 resets) in 40 ms. (975 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (686 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1319 resets) in 39 ms. (1000 steps per ms) remains 1/2 properties
// Phase 1: matrix 134 rows 46 cols
[2024-06-02 18:05:32] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:05:32] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/180 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 64/64 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/180 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 134/134 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 46 transition count 133
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 44 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 43 transition count 130
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 43 transition count 130
Applied a total of 8 rules in 34 ms. Remains 43 /46 variables (removed 3) and now considering 130/134 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 43/46 places, 130/134 transitions.
RANDOM walk for 40000 steps (5081 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (724 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46469 steps, run visited all 1 properties in 111 ms. (steps per millisecond=418 )
Probabilistic random walk after 46469 steps, saw 11790 distinct states, run finished after 118 ms. (steps per millisecond=393 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 160 transitions.
Computed a total of 18 stabilizing places and 67 stable transitions
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 137
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 132
Applied a total of 32 rules in 6 ms. Remains 51 /67 variables (removed 16) and now considering 132/160 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/67 places, 132/160 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 48 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 48 transition count 115
Applied a total of 38 rules in 8 ms. Remains 48 /67 variables (removed 19) and now considering 115/160 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 48/67 places, 115/160 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 53 transition count 140
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 53 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 52 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 52 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 51 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 51 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 49 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 49 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 40 place count 49 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 47 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 45 transition count 120
Applied a total of 48 rules in 38 ms. Remains 45 /67 variables (removed 22) and now considering 120/160 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 45/67 places, 120/160 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 140
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 51 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 51 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 50 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 50 transition count 120
Applied a total of 34 rules in 7 ms. Remains 50 /67 variables (removed 17) and now considering 120/160 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 50/67 places, 120/160 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 57 transition count 146
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 57 transition count 146
Applied a total of 20 rules in 3 ms. Remains 57 /67 variables (removed 10) and now considering 146/160 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/67 places, 146/160 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 51 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 35 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 39 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 41 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 45 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 42 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 42 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 54 place count 42 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 41 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 39 transition count 95
Applied a total of 60 rules in 24 ms. Remains 39 /67 variables (removed 28) and now considering 95/160 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 39/67 places, 95/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 139
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 51 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 50 transition count 124
Applied a total of 34 rules in 6 ms. Remains 50 /67 variables (removed 17) and now considering 124/160 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 50/67 places, 124/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 121
Applied a total of 34 rules in 4 ms. Remains 50 /67 variables (removed 17) and now considering 121/160 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/67 places, 121/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 56 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 56 transition count 143
Applied a total of 22 rules in 2 ms. Remains 56 /67 variables (removed 11) and now considering 143/160 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 56/67 places, 143/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 30 place count 50 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 50 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 48 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 48 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 42 place count 48 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 47 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 46 transition count 112
Applied a total of 46 rules in 20 ms. Remains 46 /67 variables (removed 21) and now considering 112/160 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 46/67 places, 112/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 53 transition count 138
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 50 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 50 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 49 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 49 transition count 117
Applied a total of 36 rules in 5 ms. Remains 49 /67 variables (removed 18) and now considering 117/160 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/67 places, 117/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Graph (complete) has 350 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 51 transition count 136
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 47 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 43 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 42 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 42 transition count 97
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 53 place count 42 transition count 95
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 57 place count 40 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 38 transition count 93
Applied a total of 61 rules in 24 ms. Remains 38 /67 variables (removed 29) and now considering 93/160 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 38/67 places, 93/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 54 transition count 141
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 54 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 52 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 52 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 126
Applied a total of 32 rules in 5 ms. Remains 51 /67 variables (removed 16) and now considering 126/160 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/67 places, 126/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 52 transition count 137
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 52 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 49 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 49 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 47 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 47 transition count 113
Applied a total of 40 rules in 6 ms. Remains 47 /67 variables (removed 20) and now considering 113/160 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 47/67 places, 113/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 55 transition count 142
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 55 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 54 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 54 transition count 136
Applied a total of 26 rules in 4 ms. Remains 54 /67 variables (removed 13) and now considering 136/160 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/67 places, 136/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 160/160 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 55 transition count 141
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 55 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 52 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 52 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 51 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 51 transition count 120
Applied a total of 32 rules in 5 ms. Remains 51 /67 variables (removed 16) and now considering 120/160 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/67 places, 120/160 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:05:34] [INFO ] Input system was already deterministic with 120 transitions.
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:05:34] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-06-02 18:05:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 160 transitions and 748 arcs took 6 ms.
Total runtime 46513 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-02

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 736
MODEL NAME: /home/mcc/execution/412/model
67 places, 160 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-02-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-02-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717351539854

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

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="MedleyA-PT-02"
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 MedleyA-PT-02, 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 r575-smll-171734919400010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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