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-171683762200954.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-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762200954
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 55K 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.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 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 60K 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-005B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717275514141

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-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:58:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:58:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:58:35] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-01 20:58:35] [INFO ] Transformed 253 places.
[2024-06-01 20:58:35] [INFO ] Transformed 253 transitions.
[2024-06-01 20:58:35] [INFO ] Found NUPN structural information;
[2024-06-01 20:58:35] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 106 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 236 transition count 236
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 236 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 235
Applied a total of 36 rules in 48 ms. Remains 235 /253 variables (removed 18) and now considering 235/253 (removed 18) transitions.
// Phase 1: matrix 235 rows 235 cols
[2024-06-01 20:58:35] [INFO ] Computed 21 invariants in 10 ms
[2024-06-01 20:58:35] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 20:58:35] [INFO ] Invariant cache hit.
[2024-06-01 20:58:36] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-01 20:58:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 10 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 1 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 14 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:42] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 20:58:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:58:44] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:58:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:46] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:58:47] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 2 ms to minimize.
[2024-06-01 20:58:48] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:49] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 235/470 variables, 235/309 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:51] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-06-01 20:58:52] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:58:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:58:52] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/470 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 14 (OVERLAPS) 0/470 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 313 constraints, problems are : Problem set: 0 solved, 234 unsolved in 20930 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:58:58] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:58:58] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/470 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 234/549 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/569 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:59:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 17/586 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:59:08] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-06-01 20:59:08] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:59:08] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:59:09] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 10/596 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:59:13] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:59:14] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:59:14] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:59:15] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:59:15] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:59:19] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:59:19] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:59:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 7/608 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-06-01 20:59:23] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:59:24] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 610 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 120/120 constraints]
After SMT, in 51024ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 51039ms
Starting structural reductions in LTL mode, iteration 1 : 235/253 places, 235/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51539 ms. Remains : 235/253 places, 235/253 transitions.
Support contains 106 out of 235 places after structural reductions.
[2024-06-01 20:59:27] [INFO ] Flatten gal took : 50 ms
[2024-06-01 20:59:27] [INFO ] Flatten gal took : 16 ms
[2024-06-01 20:59:27] [INFO ] Input system was already deterministic with 235 transitions.
RANDOM walk for 40000 steps (10 resets) in 1580 ms. (25 steps per ms) remains 8/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
[2024-06-01 20:59:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 189/207 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/235 variables, 3/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 235/470 variables, 235/256 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/256 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/256 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 256 constraints, problems are : Problem set: 2 solved, 3 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 129/142 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 93/235 variables, 10/22 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:59:28] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 11/33 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 235/470 variables, 235/269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 3/272 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 4/276 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:59:29] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 2/278 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/470 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 278 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 19/19 constraints]
After SMT, in 1769ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 534 ms.
Support contains 13 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 235/235 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 235 transition count 178
Reduce places removed 57 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 61 rules applied. Total rules applied 118 place count 178 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 174 transition count 174
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 122 place count 174 transition count 146
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 178 place count 146 transition count 146
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 200 place count 124 transition count 124
Iterating global reduction 3 with 22 rules applied. Total rules applied 222 place count 124 transition count 124
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 222 place count 124 transition count 116
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 238 place count 116 transition count 116
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 320 place count 75 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 75 transition count 74
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 323 place count 74 transition count 73
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 347 place count 62 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 348 place count 61 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 349 place count 60 transition count 80
Applied a total of 349 rules in 46 ms. Remains 60 /235 variables (removed 175) and now considering 80/235 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 60/235 places, 80/235 transitions.
RANDOM walk for 40000 steps (10 resets) in 516 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1027847 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 3
Probabilistic random walk after 1027847 steps, saw 194819 distinct states, run finished after 3011 ms. (steps per millisecond=341 ) properties seen :0
// Phase 1: matrix 80 rows 60 cols
[2024-06-01 20:59:33] [INFO ] Computed 20 invariants in 4 ms
[2024-06-01 20:59:33] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/42 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/50 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 17/140 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 104 constraints, problems are : Problem set: 0 solved, 3 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/42 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/50 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 73/123 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/140 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 109 constraints, problems are : Problem set: 0 solved, 3 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 213 ms.
Support contains 13 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-06-01 20:59:34] [INFO ] Invariant cache hit.
[2024-06-01 20:59:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 20:59:34] [INFO ] Invariant cache hit.
[2024-06-01 20:59:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 20:59:34] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-01 20:59:34] [INFO ] Redundant transitions in 4 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 20:59:34] [INFO ] Invariant cache hit.
[2024-06-01 20:59:34] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 6/60 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 20:59:34] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 80/140 variables, 60/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 24/110 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 110 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 80/140 variables, 60/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 24/110 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 72/182 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 20:59:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 20:59:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 184 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 8/8 constraints]
After SMT, in 2729ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2863 ms. Remains : 60/60 places, 80/80 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 60 transition count 75
Applied a total of 5 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 75/80 (removed 5) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 75 rows 60 cols
[2024-06-01 20:59:37] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 20:59:37] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 20:59:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 20:59:37] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 20:59:37] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 20:59:37] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 156 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 14 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 235 transitions.
Computed a total of 73 stabilizing places and 73 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 234 transition count 168
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 168 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 167 transition count 167
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 134 place count 167 transition count 140
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 188 place count 140 transition count 140
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 212 place count 116 transition count 116
Iterating global reduction 3 with 24 rules applied. Total rules applied 236 place count 116 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 236 place count 116 transition count 106
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 256 place count 106 transition count 106
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 326 place count 71 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 71 transition count 70
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 329 place count 70 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 68 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 67 transition count 67
Applied a total of 332 rules in 24 ms. Remains 67 /235 variables (removed 168) and now considering 67/235 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 67/235 places, 67/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 200 transition count 200
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 200 transition count 200
Applied a total of 70 rules in 8 ms. Remains 200 /235 variables (removed 35) and now considering 200/235 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 200/235 places, 200/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 9 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 9 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 198 transition count 198
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 198 transition count 198
Applied a total of 74 rules in 8 ms. Remains 198 /235 variables (removed 37) and now considering 198/235 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 198/235 places, 198/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 9 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 196
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 196
Applied a total of 78 rules in 7 ms. Remains 196 /235 variables (removed 39) and now considering 196/235 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 196/235 places, 196/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 198 transition count 198
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 198 transition count 198
Applied a total of 74 rules in 7 ms. Remains 198 /235 variables (removed 37) and now considering 198/235 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 198/235 places, 198/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 202 transition count 202
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 202 transition count 202
Applied a total of 66 rules in 7 ms. Remains 202 /235 variables (removed 33) and now considering 202/235 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 202/235 places, 202/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 10 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 203 transition count 203
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 203 transition count 203
Applied a total of 64 rules in 6 ms. Remains 203 /235 variables (removed 32) and now considering 203/235 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 203/235 places, 203/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 203 transition count 203
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 203 transition count 203
Applied a total of 64 rules in 7 ms. Remains 203 /235 variables (removed 32) and now considering 203/235 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 203/235 places, 203/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 10 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 200 transition count 200
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 200 transition count 200
Applied a total of 70 rules in 7 ms. Remains 200 /235 variables (removed 35) and now considering 200/235 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 200/235 places, 200/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 197
Applied a total of 76 rules in 7 ms. Remains 197 /235 variables (removed 38) and now considering 197/235 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 197/235 places, 197/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 10 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 196
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 196
Applied a total of 78 rules in 7 ms. Remains 196 /235 variables (removed 39) and now considering 196/235 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 196/235 places, 196/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 197
Applied a total of 76 rules in 7 ms. Remains 197 /235 variables (removed 38) and now considering 197/235 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 197/235 places, 197/235 transitions.
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:59:37] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 202 transition count 202
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 202 transition count 202
Applied a total of 66 rules in 11 ms. Remains 202 /235 variables (removed 33) and now considering 202/235 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 202/235 places, 202/235 transitions.
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:38] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 197
Applied a total of 76 rules in 5 ms. Remains 197 /235 variables (removed 38) and now considering 197/235 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 197/235 places, 197/235 transitions.
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:59:38] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 234 transition count 164
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 164 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 163 transition count 163
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 142 place count 163 transition count 138
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 192 place count 138 transition count 138
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 216 place count 114 transition count 114
Iterating global reduction 3 with 24 rules applied. Total rules applied 240 place count 114 transition count 114
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 240 place count 114 transition count 102
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 264 place count 102 transition count 102
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 338 place count 65 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 65 transition count 64
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 341 place count 64 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 343 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 61 transition count 61
Applied a total of 344 rules in 21 ms. Remains 61 /235 variables (removed 174) and now considering 61/235 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 61/235 places, 61/235 transitions.
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:59:38] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 201 transition count 201
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 201 transition count 201
Applied a total of 68 rules in 8 ms. Remains 201 /235 variables (removed 34) and now considering 201/235 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 201/235 places, 201/235 transitions.
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:59:38] [INFO ] Input system was already deterministic with 201 transitions.
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 20:59:38] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 20:59:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 235 transitions and 560 arcs took 3 ms.
Total runtime 62915 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-005B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVt-PT-005B-CTLFireability-2023-15

BK_STOP 1717275578607

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

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

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