fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683762200938
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
707.300 59051.00 86287.00 192.70 [undef] Cannot compute

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762200938.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 ShieldRVt-PT-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762200938
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 48K 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 ShieldRVt-PT-004B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717275235184

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:53:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:53:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:53:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-01 20:53:56] [INFO ] Transformed 203 places.
[2024-06-01 20:53:56] [INFO ] Transformed 203 transitions.
[2024-06-01 20:53:56] [INFO ] Found NUPN structural information;
[2024-06-01 20:53:56] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 113 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 195 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 195 transition count 195
Applied a total of 16 rules in 28 ms. Remains 195 /203 variables (removed 8) and now considering 195/203 (removed 8) transitions.
// Phase 1: matrix 195 rows 195 cols
[2024-06-01 20:53:56] [INFO ] Computed 17 invariants in 16 ms
[2024-06-01 20:53:56] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 20:53:56] [INFO ] Invariant cache hit.
[2024-06-01 20:53:57] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-01 20:53:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:53:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 8 ms to minimize.
[2024-06-01 20:53:58] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 28 places in 423 ms of which 1 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:53:59] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:00] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:54:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
[2024-06-01 20:54:01] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:54:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-06-01 20:54:01] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-06-01 20:54:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:02] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:54:02] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:54:02] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:03] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:54:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:04] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:04] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:54:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:54:04] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 3 ms to minimize.
[2024-06-01 20:54:04] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:54:04] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:06] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 195/390 variables, 195/250 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 4 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:54:08] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:54:09] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:54:09] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:54:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 13/263 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:10] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:13] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/390 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (OVERLAPS) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 265 constraints, problems are : Problem set: 0 solved, 194 unsolved in 19738 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/390 variables, 195/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 194/459 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 3 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:21] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:54:22] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:54:22] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2024-06-01 20:54:22] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:54:22] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:54:23] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 14/493 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:25] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:54:25] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:54:25] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:54:26] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:27] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 11/504 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:29] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:32] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:54:33] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:54:33] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:54:34] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-01 20:54:34] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:54:34] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:35] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:54:35] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:54:36] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:54:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:54:37] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:40] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-01 20:54:46] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 518 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 112/112 constraints]
After SMT, in 49818ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 49832ms
Starting structural reductions in LTL mode, iteration 1 : 195/203 places, 195/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50294 ms. Remains : 195/203 places, 195/203 transitions.
Support contains 113 out of 195 places after structural reductions.
[2024-06-01 20:54:47] [INFO ] Flatten gal took : 33 ms
[2024-06-01 20:54:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 20:54:47] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 111 out of 195 places (down from 113) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 78 to 77
RANDOM walk for 40000 steps (9 resets) in 1729 ms. (23 steps per ms) remains 6/77 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/5 properties
[2024-06-01 20:54:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/119 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/195 variables, 7/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 6/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/390 variables, 195/220 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 4/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 224 constraints, problems are : Problem set: 3 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/195 variables, 14/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 12/29 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/31 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/390 variables, 195/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 228 constraints, problems are : Problem set: 3 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 922ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 195 transition count 136
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 136 transition count 136
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 118 place count 136 transition count 118
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 154 place count 118 transition count 118
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 176 place count 96 transition count 96
Iterating global reduction 2 with 22 rules applied. Total rules applied 198 place count 96 transition count 96
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 198 place count 96 transition count 86
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 218 place count 86 transition count 86
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 286 place count 52 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 52 transition count 51
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 3 with 2 rules applied. Total rules applied 289 place count 51 transition count 50
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 309 place count 41 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 310 place count 41 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 40 transition count 56
Applied a total of 311 rules in 36 ms. Remains 40 /195 variables (removed 155) and now considering 56/195 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 40/195 places, 56/195 transitions.
RANDOM walk for 40000 steps (27 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Probably explored full state space saw : 261993 states, properties seen :0
Probabilistic random walk after 2357985 steps, saw 261993 distinct states, run finished after 2180 ms. (steps per millisecond=1081 ) properties seen :0
Explored full state space saw : 262153 states, properties seen :0
Exhaustive walk after 2359320 steps, saw 262153 distinct states, run finished after 1841 ms. (steps per millisecond=1281 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 10 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 9 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 99 out of 195 places (down from 100) after GAL structural reductions.
Computed a total of 62 stabilizing places and 62 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 160 transition count 160
Applied a total of 70 rules in 19 ms. Remains 160 /195 variables (removed 35) and now considering 160/195 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 160/195 places, 160/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 163 transition count 163
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 163 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 162 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 161 transition count 161
Applied a total of 68 rules in 9 ms. Remains 161 /195 variables (removed 34) and now considering 161/195 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 161/195 places, 161/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 160 transition count 160
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 158 transition count 158
Applied a total of 74 rules in 9 ms. Remains 158 /195 variables (removed 37) and now considering 158/195 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 158/195 places, 158/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 194 transition count 135
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 135 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 134 transition count 134
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 120 place count 134 transition count 117
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 154 place count 117 transition count 117
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 177 place count 94 transition count 94
Iterating global reduction 3 with 23 rules applied. Total rules applied 200 place count 94 transition count 94
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 200 place count 94 transition count 84
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 220 place count 84 transition count 84
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 274 place count 57 transition count 57
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 57 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 55 transition count 55
Applied a total of 277 rules in 24 ms. Remains 55 /195 variables (removed 140) and now considering 55/195 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 55/195 places, 55/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 160 transition count 160
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 158 transition count 158
Applied a total of 74 rules in 9 ms. Remains 158 /195 variables (removed 37) and now considering 158/195 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 158/195 places, 158/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 163 transition count 163
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 163 transition count 163
Applied a total of 64 rules in 5 ms. Remains 163 /195 variables (removed 32) and now considering 163/195 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 163/195 places, 163/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 167 transition count 167
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 167 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 166 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 166 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 165 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 165 transition count 165
Applied a total of 60 rules in 9 ms. Remains 165 /195 variables (removed 30) and now considering 165/195 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 165/195 places, 165/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 194 transition count 141
Reduce places removed 53 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 141 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 139 transition count 139
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 110 place count 139 transition count 120
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 148 place count 120 transition count 120
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 169 place count 99 transition count 99
Iterating global reduction 3 with 21 rules applied. Total rules applied 190 place count 99 transition count 99
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 190 place count 99 transition count 92
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 92 transition count 92
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 260 place count 64 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 261 place count 64 transition count 63
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 4 with 2 rules applied. Total rules applied 263 place count 63 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 61 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 266 place count 60 transition count 60
Applied a total of 266 rules in 18 ms. Remains 60 /195 variables (removed 135) and now considering 60/195 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 60/195 places, 60/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Applied a total of 66 rules in 5 ms. Remains 162 /195 variables (removed 33) and now considering 162/195 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 162/195 places, 162/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 194 transition count 141
Reduce places removed 53 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 141 transition count 133
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 133 transition count 133
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 122 place count 133 transition count 117
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 154 place count 117 transition count 117
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 174 place count 97 transition count 97
Iterating global reduction 3 with 20 rules applied. Total rules applied 194 place count 97 transition count 97
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 194 place count 97 transition count 89
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 210 place count 89 transition count 89
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 266 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 61 transition count 60
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 4 with 2 rules applied. Total rules applied 269 place count 60 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 58 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 57 transition count 57
Applied a total of 272 rules in 17 ms. Remains 57 /195 variables (removed 138) and now considering 57/195 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 57/195 places, 57/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Applied a total of 66 rules in 5 ms. Remains 162 /195 variables (removed 33) and now considering 162/195 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 162/195 places, 162/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 160 transition count 160
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 160 transition count 160
Applied a total of 70 rules in 5 ms. Remains 160 /195 variables (removed 35) and now considering 160/195 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 160/195 places, 160/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 160 transition count 160
Applied a total of 70 rules in 8 ms. Remains 160 /195 variables (removed 35) and now considering 160/195 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 160/195 places, 160/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 194 transition count 131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 131 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 126 place count 131 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 160 place count 114 transition count 114
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 181 place count 93 transition count 93
Iterating global reduction 2 with 21 rules applied. Total rules applied 202 place count 93 transition count 93
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 202 place count 93 transition count 84
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 220 place count 84 transition count 84
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 282 place count 53 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 53 transition count 52
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 3 with 2 rules applied. Total rules applied 285 place count 52 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 50 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 288 place count 49 transition count 49
Applied a total of 288 rules in 14 ms. Remains 49 /195 variables (removed 146) and now considering 49/195 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 49/195 places, 49/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 194 transition count 135
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 135 transition count 135
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 118 place count 135 transition count 116
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 156 place count 116 transition count 116
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 180 place count 92 transition count 92
Iterating global reduction 2 with 24 rules applied. Total rules applied 204 place count 92 transition count 92
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 204 place count 92 transition count 82
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 224 place count 82 transition count 82
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 280 place count 54 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 54 transition count 53
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 3 with 2 rules applied. Total rules applied 283 place count 53 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 51 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 50 transition count 50
Applied a total of 286 rules in 12 ms. Remains 50 /195 variables (removed 145) and now considering 50/195 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 50/195 places, 50/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 161 transition count 161
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 159 transition count 159
Applied a total of 72 rules in 9 ms. Remains 159 /195 variables (removed 36) and now considering 159/195 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 159/195 places, 159/195 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:54:53] [INFO ] Input system was already deterministic with 159 transitions.
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:54:53] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 20:54:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 195 places, 195 transitions and 462 arcs took 2 ms.
Total runtime 57463 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 : ShieldRVt-PT-004B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVt-PT-004B-CTLFireability-2023-15

BK_STOP 1717275294235

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/909/ctl_0_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/909/ctl_1_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/909/ctl_2_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/909/ctl_3_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/909/ctl_4_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/909/ctl_5_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/909/ctl_6_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/909/ctl_7_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/909/ctl_8_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/909/ctl_9_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/909/ctl_10_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/909/ctl_11_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/909/ctl_12_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/909/ctl_13_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/909/ctl_14_
ctl formula name ShieldRVt-PT-004B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/909/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="ShieldRVt-PT-004B"
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 ShieldRVt-PT-004B, 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-171683762200938"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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