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

About the Execution of LTSMin+red for ShieldIIPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
476.951 68924.00 104485.00 290.60 ?????T?????F???T normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 167K 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 ShieldIIPt-PT-010B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-010B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717236556114

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:09:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:09:17] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-01 10:09:17] [INFO ] Transformed 703 places.
[2024-06-01 10:09:17] [INFO ] Transformed 653 transitions.
[2024-06-01 10:09:17] [INFO ] Found NUPN structural information;
[2024-06-01 10:09:17] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldIIPt-PT-010B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 616 transition count 566
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 616 transition count 566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 175 place count 615 transition count 565
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 615 transition count 565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 614 transition count 564
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 614 transition count 564
Applied a total of 178 rules in 159 ms. Remains 614 /703 variables (removed 89) and now considering 564/653 (removed 89) transitions.
// Phase 1: matrix 564 rows 614 cols
[2024-06-01 10:09:17] [INFO ] Computed 91 invariants in 22 ms
[2024-06-01 10:09:18] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 10:09:18] [INFO ] Invariant cache hit.
[2024-06-01 10:09:18] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2024-06-01 10:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:28] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 17 ms to minimize.
[2024-06-01 10:09:28] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:09:28] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:09:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:09:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 5 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 12 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 17 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:09:29] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:09:30] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:09:30] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-06-01 10:09:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:30] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 5 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:09:32] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:09:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:09:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:09:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:39] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:09:39] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:09:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 5 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:41] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:09:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:44] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:09:44] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:09:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:09:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:09:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:09:46] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:09:46] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:09:46] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:09:46] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:48] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1178 variables, and 172 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:09:53] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:09:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:09:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:56] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:09:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:09:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:09:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:09:57] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:09:57] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:09:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:09:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:09:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:09:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:09:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:09:59] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:09:59] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:09:59] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:10:01] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:10:01] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:10:03] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:10:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:10:04] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:10:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:10:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 563 unsolved
[2024-06-01 10:10:08] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:10:08] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:10:09] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:10:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:10:09] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:10:09] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:10:09] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 7 (OVERLAPS) 564/1178 variables, 614/833 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 563/1396 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 1396 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 128/128 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 614/703 places, 564/653 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61172 ms. Remains : 614/703 places, 564/653 transitions.
Support contains 99 out of 614 places after structural reductions.
[2024-06-01 10:10:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 10:10:18] [INFO ] Flatten gal took : 62 ms
FORMULA ShieldIIPt-PT-010B-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:10:18] [INFO ] Flatten gal took : 30 ms
[2024-06-01 10:10:19] [INFO ] Input system was already deterministic with 564 transitions.
Support contains 83 out of 614 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1844 ms. (21 steps per ms) remains 2/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
[2024-06-01 10:10:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 499/614 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 564/1178 variables, 614/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1178 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1178 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/115 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 499/614 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:10:20] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 564/1178 variables, 614/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1178 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 5 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:10:21] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-06-01 10:10:22] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 7/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1178 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 728 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 651 ms.
Support contains 5 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 614 transition count 445
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 495 transition count 445
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 238 place count 495 transition count 375
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 378 place count 425 transition count 375
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 395 place count 408 transition count 358
Iterating global reduction 2 with 17 rules applied. Total rules applied 412 place count 408 transition count 358
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 412 place count 408 transition count 345
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 438 place count 395 transition count 345
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 1 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 336 rules applied. Total rules applied 774 place count 227 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 775 place count 227 transition count 176
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 777 place count 226 transition count 175
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -17
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 833 place count 198 transition count 192
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 834 place count 198 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 843 place count 198 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 844 place count 197 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 846 place count 195 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 846 place count 195 transition count 189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 848 place count 194 transition count 189
Applied a total of 848 rules in 142 ms. Remains 194 /614 variables (removed 420) and now considering 189/564 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 194/614 places, 189/564 transitions.
RANDOM walk for 40000 steps (8 resets) in 454 ms. (87 steps per ms) remains 1/2 properties
BEST_FIRST walk for 20301 steps (4 resets) in 57 ms. (350 steps per ms) remains 0/1 properties
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 49 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 28 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 564 transitions.
Computed a total of 163 stabilizing places and 163 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 594 transition count 544
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 594 transition count 544
Applied a total of 40 rules in 25 ms. Remains 594 /614 variables (removed 20) and now considering 544/564 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 594/614 places, 544/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 20 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 21 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 544 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 18 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 591/614 places, 541/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 19 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 22 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 613 transition count 448
Reduce places removed 115 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 116 rules applied. Total rules applied 231 place count 498 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 497 transition count 447
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 232 place count 497 transition count 380
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 366 place count 430 transition count 380
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 384 place count 412 transition count 362
Iterating global reduction 3 with 18 rules applied. Total rules applied 402 place count 412 transition count 362
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 402 place count 412 transition count 349
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 428 place count 399 transition count 349
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 742 place count 242 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 743 place count 242 transition count 191
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 745 place count 241 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 747 place count 239 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 749 place count 237 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 749 place count 237 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 751 place count 236 transition count 187
Applied a total of 751 rules in 66 ms. Remains 236 /614 variables (removed 378) and now considering 187/564 (removed 377) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 236/614 places, 187/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 8 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 18 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 591/614 places, 541/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 23 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 592/614 places, 542/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 595 transition count 545
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 595 transition count 545
Applied a total of 38 rules in 18 ms. Remains 595 /614 variables (removed 19) and now considering 545/564 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 595/614 places, 545/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 15 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 16 ms
[2024-06-01 10:10:23] [INFO ] Input system was already deterministic with 545 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 17 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 591/614 places, 541/564 transitions.
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:10:23] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 613 transition count 451
Reduce places removed 112 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 117 rules applied. Total rules applied 229 place count 501 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 234 place count 496 transition count 446
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 234 place count 496 transition count 379
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 368 place count 429 transition count 379
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 382 place count 415 transition count 365
Iterating global reduction 3 with 14 rules applied. Total rules applied 396 place count 415 transition count 365
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 396 place count 415 transition count 355
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 416 place count 405 transition count 355
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 720 place count 253 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 721 place count 253 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 723 place count 252 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 725 place count 250 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 727 place count 248 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 727 place count 248 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 729 place count 247 transition count 198
Applied a total of 729 rules in 64 ms. Remains 247 /614 variables (removed 367) and now considering 198/564 (removed 366) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 247/614 places, 198/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 7 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 17 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 592/614 places, 542/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 17 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 592/614 places, 542/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 592 transition count 542
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 592 transition count 542
Applied a total of 44 rules in 17 ms. Remains 592 /614 variables (removed 22) and now considering 542/564 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 592/614 places, 542/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 542 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 594 transition count 544
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 594 transition count 544
Applied a total of 40 rules in 17 ms. Remains 594 /614 variables (removed 20) and now considering 544/564 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 594/614 places, 544/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 544 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 591 transition count 541
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 591 transition count 541
Applied a total of 46 rules in 20 ms. Remains 591 /614 variables (removed 23) and now considering 541/564 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 591/614 places, 541/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 12 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 541 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 613 transition count 443
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 493 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 492 transition count 442
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 242 place count 492 transition count 373
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 380 place count 423 transition count 373
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 398 place count 405 transition count 355
Iterating global reduction 3 with 18 rules applied. Total rules applied 416 place count 405 transition count 355
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 416 place count 405 transition count 341
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 444 place count 391 transition count 341
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 758 place count 234 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 759 place count 234 transition count 183
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 761 place count 233 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 763 place count 231 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 765 place count 229 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 765 place count 229 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 767 place count 228 transition count 179
Applied a total of 767 rules in 50 ms. Remains 228 /614 variables (removed 386) and now considering 179/564 (removed 385) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 228/614 places, 179/564 transitions.
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 10:10:24] [INFO ] Input system was already deterministic with 179 transitions.
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-010B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 13 ms
[2024-06-01 10:10:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:10:24] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 10:10:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 614 places, 564 transitions and 1448 arcs took 3 ms.
Total runtime 67412 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 : ShieldIIPt-PT-010B-CTLCardinality-2024-00
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-03
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldIIPt-PT-010B-CTLCardinality-2023-14

BK_STOP 1717236625038

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/972/ctl_0_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/972/ctl_1_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/972/ctl_2_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/972/ctl_3_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/972/ctl_4_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/972/ctl_5_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/972/ctl_6_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/972/ctl_7_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/972/ctl_8_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/972/ctl_9_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/972/ctl_10_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/972/ctl_11_
ctl formula name ShieldIIPt-PT-010B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/972/ctl_12_
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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPt-PT-010B, examination is CTLCardinality"
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-171683760700265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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