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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24K May 18 16:43 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 ShieldRVs-PT-002B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717262558142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:22:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:22:39] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-06-01 17:22:39] [INFO ] Transformed 83 places.
[2024-06-01 17:22:39] [INFO ] Transformed 93 transitions.
[2024-06-01 17:22:39] [INFO ] Found NUPN structural information;
[2024-06-01 17:22:39] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 69 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 89
Applied a total of 8 rules in 19 ms. Remains 79 /83 variables (removed 4) and now considering 89/93 (removed 4) transitions.
// Phase 1: matrix 89 rows 79 cols
[2024-06-01 17:22:39] [INFO ] Computed 9 invariants in 10 ms
[2024-06-01 17:22:39] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 17:22:39] [INFO ] Invariant cache hit.
[2024-06-01 17:22:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-06-01 17:22:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 12 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 2 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 5 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 11 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (OVERLAPS) 89/168 variables, 79/196 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/168 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:49] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:50] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/168 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/168 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 25 (OVERLAPS) 0/168 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 219 constraints, problems are : Problem set: 0 solved, 88 unsolved in 11939 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 131/140 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/168 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 88/308 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:54] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:23:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/168 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/168 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 17 (OVERLAPS) 0/168 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 320 constraints, problems are : Problem set: 0 solved, 88 unsolved in 18086 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 144/144 constraints]
After SMT, in 30087ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 30105ms
Starting structural reductions in LTL mode, iteration 1 : 79/83 places, 89/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30477 ms. Remains : 79/83 places, 89/93 transitions.
Support contains 69 out of 79 places after structural reductions.
[2024-06-01 17:23:10] [INFO ] Flatten gal took : 28 ms
[2024-06-01 17:23:10] [INFO ] Flatten gal took : 11 ms
[2024-06-01 17:23:10] [INFO ] Input system was already deterministic with 89 transitions.
RANDOM walk for 40000 steps (360 resets) in 1753 ms. (22 steps per ms) remains 6/68 properties
BEST_FIRST walk for 40003 steps (116 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (91 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (93 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (132 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
[2024-06-01 17:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/79 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
Problem AtomicPropp51 is UNSAT
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 7/16 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 89/168 variables, 79/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 97 constraints, problems are : Problem set: 4 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/79 variables, 4/9 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 9/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 17:23:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 89/168 variables, 79/98 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 100 constraints, problems are : Problem set: 4 solved, 2 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 10/10 constraints]
After SMT, in 595ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 235 ms.
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 89/89 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 83
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 72 transition count 82
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 14 place count 72 transition count 71
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 36 place count 61 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 45 place count 52 transition count 62
Iterating global reduction 3 with 9 rules applied. Total rules applied 54 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 54 place count 52 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 49 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 84 place count 37 transition count 47
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 37 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 36 transition count 46
Applied a total of 89 rules in 43 ms. Remains 36 /79 variables (removed 43) and now considering 46/89 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 36/79 places, 46/89 transitions.
RANDOM walk for 40000 steps (749 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (230 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (296 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Probably explored full state space saw : 30411 states, properties seen :0
Probabilistic random walk after 159062 steps, saw 30411 distinct states, run finished after 413 ms. (steps per millisecond=385 ) properties seen :0
Explored full state space saw : 30411 states, properties seen :0
Exhaustive walk after 159062 steps, saw 30411 distinct states, run finished after 339 ms. (steps per millisecond=469 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:23:12] [INFO ] Input system was already deterministic with 89 transitions.
Support contains 63 out of 79 places (down from 64) after GAL structural reductions.
Computed a total of 23 stabilizing places and 23 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 78 transition count 83
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 73 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 73 transition count 74
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 64 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 54 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 54 transition count 64
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 48 place count 54 transition count 61
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 51 transition count 61
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 74 place count 41 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 40 transition count 50
Applied a total of 75 rules in 14 ms. Remains 40 /79 variables (removed 39) and now considering 50/89 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 40/79 places, 50/89 transitions.
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:12] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 71 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 4 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/79 places, 81/89 transitions.
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:12] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 83
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 83
Applied a total of 12 rules in 2 ms. Remains 73 /79 variables (removed 6) and now considering 83/89 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/79 places, 83/89 transitions.
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:12] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:12] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 3 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/79 places, 81/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 79
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 69 transition count 69
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 59 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 49 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 49 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 58 place count 49 transition count 56
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 46 transition count 56
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 88 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 32 transition count 42
Applied a total of 90 rules in 11 ms. Remains 32 /79 variables (removed 47) and now considering 42/89 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 32/79 places, 42/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 71 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 4 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/79 places, 81/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 80
Applied a total of 18 rules in 4 ms. Remains 70 /79 variables (removed 9) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/79 places, 80/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 3 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/79 places, 81/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 70 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 60 transition count 70
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 50 transition count 60
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 50 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 56 place count 50 transition count 56
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 46 transition count 56
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 90 place count 33 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 31 transition count 41
Applied a total of 92 rules in 12 ms. Remains 31 /79 variables (removed 48) and now considering 41/89 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 31/79 places, 41/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 70 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 60 transition count 70
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 51 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 51 transition count 61
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 54 place count 51 transition count 57
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 47 transition count 57
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 32 transition count 42
Applied a total of 90 rules in 11 ms. Remains 32 /79 variables (removed 47) and now considering 42/89 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 32/79 places, 42/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 69 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 68 transition count 78
Applied a total of 22 rules in 3 ms. Remains 68 /79 variables (removed 11) and now considering 78/89 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/79 places, 78/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 69 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 68 transition count 78
Applied a total of 22 rules in 3 ms. Remains 68 /79 variables (removed 11) and now considering 78/89 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/79 places, 78/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 83
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 83
Applied a total of 12 rules in 2 ms. Remains 73 /79 variables (removed 6) and now considering 83/89 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 73/79 places, 83/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 70 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 64 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 54 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 54 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 54 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 52 transition count 62
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 76 place count 40 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 38 transition count 48
Applied a total of 78 rules in 12 ms. Remains 38 /79 variables (removed 41) and now considering 48/89 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 38/79 places, 48/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 70 transition count 80
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 70 transition count 80
Applied a total of 18 rules in 1 ms. Remains 70 /79 variables (removed 9) and now considering 80/89 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 70/79 places, 80/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 79
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 69 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 59 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 49 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 49 transition count 59
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 49 transition count 55
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 45 transition count 55
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 92 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 30 transition count 40
Applied a total of 94 rules in 11 ms. Remains 30 /79 variables (removed 49) and now considering 40/89 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 30/79 places, 40/89 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:13] [INFO ] Input system was already deterministic with 40 transitions.
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:13] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:23:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 17:23:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 89 transitions and 280 arcs took 1 ms.
Total runtime 34039 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-002B-CTLFireability-2023-15

BK_STOP 1717262593714

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/984/ctl_0_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/984/ctl_1_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/984/ctl_2_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/984/ctl_3_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/984/ctl_4_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/984/ctl_5_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/984/ctl_6_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/984/ctl_7_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/984/ctl_8_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/984/ctl_9_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/984/ctl_10_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/984/ctl_11_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/984/ctl_12_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/984/ctl_13_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/984/ctl_14_
ctl formula name ShieldRVs-PT-002B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/984/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-002B, 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 r528-tall-171683761700730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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