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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 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 HealthRecord-PT-12-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-12-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716491011182

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:03:32] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-23 19:03:32] [INFO ] Transformed 160 places.
[2024-05-23 19:03:32] [INFO ] Transformed 340 transitions.
[2024-05-23 19:03:32] [INFO ] Found NUPN structural information;
[2024-05-23 19:03:32] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 85 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 122 transition count 241
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 122 transition count 241
Applied a total of 76 rules in 21 ms. Remains 122 /160 variables (removed 38) and now considering 241/312 (removed 71) transitions.
[2024-05-23 19:03:32] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
// Phase 1: matrix 234 rows 122 cols
[2024-05-23 19:03:32] [INFO ] Computed 13 invariants in 8 ms
[2024-05-23 19:03:32] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-23 19:03:32] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2024-05-23 19:03:32] [INFO ] Invariant cache hit.
[2024-05-23 19:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-23 19:03:32] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2024-05-23 19:03:32] [INFO ] Invariant cache hit.
[2024-05-23 19:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 13 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:34] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 2 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-05-23 19:03:35] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-23 19:03:36] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 9 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 3 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:40] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:03:40] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:40] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 233/355 variables, 122/200 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2024-05-23 19:03:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:03:50] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:51] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:51] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:03:52] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:03:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 1/356 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/356 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:58] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/356 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:01] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:04:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/356 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 264 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 128/128 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 128/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:04] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:04:04] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:04:04] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:05] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:06] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:04:06] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 233/355 variables, 122/274 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 240/514 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:08] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:14] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 1/356 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-23 19:04:31] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
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 356/356 variables, and 519 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 143/143 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Starting structural reductions in LTL mode, iteration 1 : 122/160 places, 241/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60625 ms. Remains : 122/160 places, 241/312 transitions.
Support contains 85 out of 122 places after structural reductions.
[2024-05-23 19:04:33] [INFO ] Flatten gal took : 43 ms
[2024-05-23 19:04:33] [INFO ] Flatten gal took : 24 ms
[2024-05-23 19:04:33] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 84 out of 122 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (2874 resets) in 1895 ms. (21 steps per ms) remains 42/84 properties
BEST_FIRST walk for 4003 steps (36 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (30 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (35 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (31 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (33 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (34 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (31 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (36 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (33 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
[2024-05-23 19:04:34] [INFO ] Flow matrix only has 234 transitions (discarded 7 similar events)
[2024-05-23 19:04:34] [INFO ] Invariant cache hit.
[2024-05-23 19:04:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/86 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/122 variables, 8/13 constraints. Problems are: Problem set: 4 solved, 38 unsolved
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
Problem AtomicPropp42 is UNSAT
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:35] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
Problem AtomicPropp62 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 17/30 constraints. Problems are: Problem set: 6 solved, 36 unsolved
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp60 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/35 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 233/355 variables, 122/157 constraints. Problems are: Problem set: 7 solved, 35 unsolved
[2024-05-23 19:04:36] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/158 constraints. Problems are: Problem set: 8 solved, 34 unsolved
[2024-05-23 19:04:37] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:37] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 3/161 constraints. Problems are: Problem set: 8 solved, 34 unsolved
[2024-05-23 19:04:37] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 1/162 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/162 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 1/356 variables, 1/163 constraints. Problems are: Problem set: 9 solved, 33 unsolved
[2024-05-23 19:04:38] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 1/164 constraints. Problems are: Problem set: 9 solved, 33 unsolved
[2024-05-23 19:04:38] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:04:38] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:38] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:04:38] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:04:38] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 5/169 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 0/169 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/356 variables, 0/169 constraints. Problems are: Problem set: 9 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 169 constraints, problems are : Problem set: 9 solved, 33 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 9 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 41/80 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 8/13 constraints. Problems are: Problem set: 9 solved, 33 unsolved
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/16 constraints. Problems are: Problem set: 9 solved, 33 unsolved
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/17 constraints. Problems are: Problem set: 9 solved, 33 unsolved
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/18 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 42/122 variables, 8/26 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/51 constraints. Problems are: Problem set: 9 solved, 33 unsolved
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:04:39] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 18/69 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:04:40] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 2/71 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 6/77 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:04:41] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 13/90 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 2/92 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 1/93 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 3/96 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:04:42] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 2/98 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 18 (OVERLAPS) 233/355 variables, 122/220 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 32/252 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:43] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/355 variables, 1/253 constraints. Problems are: Problem set: 10 solved, 32 unsolved
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/356 variables, and 254 constraints, problems are : Problem set: 10 solved, 32 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 32/42 constraints, Known Traps: 87/87 constraints]
After SMT, in 9732ms problems are : Problem set: 10 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 85 edges and 122 vertex of which 4 / 122 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 514 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 116 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 116 transition count 226
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 115 transition count 226
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 37 place count 85 transition count 166
Iterating global reduction 2 with 30 rules applied. Total rules applied 67 place count 85 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 85 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 83 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 83 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 83 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 81 transition count 156
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 87 place count 77 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 77 transition count 172
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 103 place count 77 transition count 172
Applied a total of 103 rules in 54 ms. Remains 77 /122 variables (removed 45) and now considering 172/241 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 77/122 places, 172/241 transitions.
RANDOM walk for 40000 steps (4616 resets) in 580 ms. (68 steps per ms) remains 23/32 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (63 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (70 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (65 resets) in 14 ms. (266 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (66 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (65 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (68 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (67 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (62 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (70 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (70 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (67 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (66 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (62 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (64 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (65 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (64 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (67 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (66 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (69 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (62 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
[2024-05-23 19:04:44] [INFO ] Flow matrix only has 165 transitions (discarded 7 similar events)
// Phase 1: matrix 165 rows 77 cols
[2024-05-23 19:04:44] [INFO ] Computed 10 invariants in 3 ms
[2024-05-23 19:04:44] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 29/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 22/77 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:04:44] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
[2024-05-23 19:04:45] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 165/242 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 117 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 29/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:46] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:46] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 22/77 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:46] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:04:46] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 165/242 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:04:46] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 19:04:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/242 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/242 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 146 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 34/34 constraints]
After SMT, in 3258ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 19 different solutions.
Parikh walk visited 19 properties in 1412 ms.
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 172/172 transitions.
Graph (trivial) has 63 edges and 77 vertex of which 2 / 77 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 375 edges and 76 vertex of which 74 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 74 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 73 transition count 168
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 22 place count 56 transition count 134
Iterating global reduction 2 with 17 rules applied. Total rules applied 39 place count 56 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 56 transition count 132
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 52 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 52 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 51 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 51 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 50 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 50 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 50 transition count 116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 62 place count 47 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 45 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 45 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 45 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 71 place count 43 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 43 transition count 130
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 79 place count 43 transition count 130
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 81 place count 41 transition count 122
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 41 transition count 122
Applied a total of 83 rules in 46 ms. Remains 41 /77 variables (removed 36) and now considering 122/172 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 41/77 places, 122/172 transitions.
RANDOM walk for 40000 steps (5585 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (758 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (763 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (737 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
Probably explored full state space saw : 12781 states, properties seen :2
Probabilistic random walk after 56531 steps, saw 12781 distinct states, run finished after 110 ms. (steps per millisecond=513 ) properties seen :2
Explored full state space saw : 12781 states, properties seen :0
Exhaustive walk after 56531 steps, saw 12781 distinct states, run finished after 52 ms. (steps per millisecond=1087 ) properties seen :0
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 13 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 12 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 71 out of 122 places (down from 76) after GAL structural reductions.
Computed a total of 11 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 64 transition count 129
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 64 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 64 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 57 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 57 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 54 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 51 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 51 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 156 place count 51 transition count 86
Applied a total of 156 rules in 6 ms. Remains 51 /122 variables (removed 71) and now considering 86/241 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/122 places, 86/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 155 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 59 transition count 124
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 59 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 120 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 51 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 51 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 48 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 45 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 45 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 163 place count 45 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 45 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 43 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 42 transition count 68
Applied a total of 172 rules in 20 ms. Remains 42 /122 variables (removed 80) and now considering 68/241 (removed 173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 42/122 places, 68/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 68 transitions.
RANDOM walk for 6613 steps (597 resets) in 17 ms. (367 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-12-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 65 transition count 131
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 65 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 65 transition count 128
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 124 place count 58 transition count 114
Iterating global reduction 1 with 7 rules applied. Total rules applied 131 place count 58 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 58 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 57 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 57 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 56 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 56 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 56 transition count 103
Applied a total of 141 rules in 5 ms. Remains 56 /122 variables (removed 66) and now considering 103/241 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/122 places, 103/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 64 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 64 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 64 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 57 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 57 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 57 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 55 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 55 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 53 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 53 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 153 place count 53 transition count 89
Applied a total of 153 rules in 5 ms. Remains 53 /122 variables (removed 69) and now considering 89/241 (removed 152) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 53/122 places, 89/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 67 transition count 134
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 67 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 67 transition count 131
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 60 transition count 117
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 60 transition count 117
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 60 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 59 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 59 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 58 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 58 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 58 transition count 103
Applied a total of 140 rules in 5 ms. Remains 58 /122 variables (removed 64) and now considering 103/241 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/122 places, 103/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 62 transition count 125
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 62 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 62 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 131 place count 54 transition count 106
Iterating global reduction 1 with 8 rules applied. Total rules applied 139 place count 54 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 145 place count 54 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 52 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 52 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 50 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 50 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 159 place count 50 transition count 84
Applied a total of 159 rules in 4 ms. Remains 50 /122 variables (removed 72) and now considering 84/241 (removed 157) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/122 places, 84/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 71 transition count 143
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 71 transition count 143
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 65 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 65 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 119 place count 65 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 63 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 63 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 62 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 62 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 62 transition count 115
Applied a total of 128 rules in 4 ms. Remains 62 /122 variables (removed 60) and now considering 115/241 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 62/122 places, 115/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 66 transition count 133
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 66 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 66 transition count 130
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 121 place count 60 transition count 118
Iterating global reduction 1 with 6 rules applied. Total rules applied 127 place count 60 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 60 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 59 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 59 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 58 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 58 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 58 transition count 108
Applied a total of 136 rules in 3 ms. Remains 58 /122 variables (removed 64) and now considering 108/241 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 58/122 places, 108/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 70 transition count 141
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 70 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 70 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 63 transition count 125
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 63 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 63 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 61 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 61 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 59 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 59 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 136 place count 59 transition count 107
Applied a total of 136 rules in 3 ms. Remains 59 /122 variables (removed 63) and now considering 107/241 (removed 134) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/122 places, 107/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 158 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 59 transition count 124
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 59 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 120 place count 59 transition count 121
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 51 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 51 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 142 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 49 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 49 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 47 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 47 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 156 place count 47 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 47 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 45 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 44 transition count 76
Applied a total of 165 rules in 14 ms. Remains 44 /122 variables (removed 78) and now considering 76/241 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 44/122 places, 76/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 71 transition count 143
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 71 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 71 transition count 140
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 111 place count 65 transition count 128
Iterating global reduction 1 with 6 rules applied. Total rules applied 117 place count 65 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 122 place count 65 transition count 123
Applied a total of 122 rules in 2 ms. Remains 65 /122 variables (removed 57) and now considering 123/241 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/122 places, 123/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Graph (trivial) has 168 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 61 transition count 128
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 61 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 116 place count 61 transition count 125
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 55 transition count 113
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 55 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 55 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 53 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 53 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 51 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 51 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 51 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 51 transition count 88
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 153 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 49 transition count 86
Applied a total of 154 rules in 13 ms. Remains 49 /122 variables (removed 73) and now considering 86/241 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 49/122 places, 86/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 63 transition count 127
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 63 transition count 124
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 55 transition count 108
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 55 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 55 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 52 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 152 place count 49 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 49 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 164 place count 49 transition count 78
Applied a total of 164 rules in 3 ms. Remains 49 /122 variables (removed 73) and now considering 78/241 (removed 163) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/122 places, 78/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 64 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 64 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 64 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 57 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 57 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 57 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 56 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 55 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 55 transition count 97
Applied a total of 146 rules in 2 ms. Remains 55 /122 variables (removed 67) and now considering 97/241 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/122 places, 97/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 66 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 66 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 66 transition count 130
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 59 transition count 116
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 59 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 59 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 58 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 58 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 57 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 57 transition count 102
Applied a total of 141 rules in 2 ms. Remains 57 /122 variables (removed 65) and now considering 102/241 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 57/122 places, 102/241 transitions.
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:49] [INFO ] Flatten gal took : 21 ms
[2024-05-23 19:04:50] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 241/241 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 66 transition count 133
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 66 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 66 transition count 130
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 123 place count 58 transition count 114
Iterating global reduction 1 with 8 rules applied. Total rules applied 131 place count 58 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 137 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 56 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 56 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 55 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 55 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 55 transition count 97
Applied a total of 146 rules in 3 ms. Remains 55 /122 variables (removed 67) and now considering 97/241 (removed 144) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/122 places, 97/241 transitions.
[2024-05-23 19:04:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:50] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-23 19:04:50] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:04:50] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:04:50] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-23 19:04:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 241 transitions and 685 arcs took 2 ms.
Total runtime 77763 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 122
TRANSITIONS: 241
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.005s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1358
MODEL NAME: /home/mcc/execution/414/model
122 places, 241 transitions.

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

BK_STOP 1716491116777

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-12, 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 r179-tall-171640602300786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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