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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 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 73K 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-15-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-15-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717201674120

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:27:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:27:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:27:55] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 00:27:55] [INFO ] Transformed 163 places.
[2024-06-01 00:27:55] [INFO ] Transformed 348 transitions.
[2024-06-01 00:27:55] [INFO ] Found NUPN structural information;
[2024-06-01 00:27:55] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Support contains 90 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 122 transition count 242
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 122 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 121 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 121 transition count 240
Applied a total of 84 rules in 26 ms. Remains 121 /163 variables (removed 42) and now considering 240/319 (removed 79) transitions.
[2024-06-01 00:27:55] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
// Phase 1: matrix 233 rows 121 cols
[2024-06-01 00:27:55] [INFO ] Computed 13 invariants in 8 ms
[2024-06-01 00:27:55] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 00:27:55] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2024-06-01 00:27:55] [INFO ] Invariant cache hit.
[2024-06-01 00:27:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:27:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-06-01 00:27:55] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2024-06-01 00:27:55] [INFO ] Invariant cache hit.
[2024-06-01 00:27:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 14 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 8 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 15/88 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (OVERLAPS) 232/353 variables, 121/212 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 1/354 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:10] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:10] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:14] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/354 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 17 (OVERLAPS) 0/354 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 222 constraints, problems are : Problem set: 0 solved, 239 unsolved in 22807 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:28:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:21] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:28:21] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:21] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:21] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:22] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:22] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:28:22] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:28:22] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:23] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:23] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:23] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2024-06-01 00:28:23] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:24] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:28:24] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:28:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:28:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:25] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:26] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:26] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:26] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:28:26] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:26] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:28:27] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 232/353 variables, 121/266 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 239/505 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:29] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:29] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-01 00:28:33] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:34] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 17 (OVERLAPS) 1/354 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 510 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 136/136 constraints]
After SMT, in 53012ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 53028ms
Starting structural reductions in LTL mode, iteration 1 : 121/163 places, 240/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53401 ms. Remains : 121/163 places, 240/319 transitions.
Support contains 90 out of 121 places after structural reductions.
[2024-06-01 00:28:49] [INFO ] Flatten gal took : 64 ms
[2024-06-01 00:28:49] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:28:49] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40000 steps (3689 resets) in 2952 ms. (13 steps per ms) remains 37/73 properties
BEST_FIRST walk for 4003 steps (45 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (48 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (44 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (45 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (45 resets) in 17 ms. (222 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (46 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (45 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (47 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (48 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (45 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (50 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (49 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (48 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (40 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (60 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (49 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
[2024-06-01 00:28:50] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2024-06-01 00:28:50] [INFO ] Invariant cache hit.
[2024-06-01 00:28:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/90 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 33 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 3 (OVERLAPS) 31/121 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-01 00:28:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:28:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:50] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 13/26 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 2 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/46 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 232/353 variables, 121/167 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/354 variables, 1/168 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/354 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 168 constraints, problems are : Problem set: 2 solved, 32 unsolved in 3764 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 2 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 34/87 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 6/11 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 7/18 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 32 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/121 variables, 8/26 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 27/53 constraints. Problems are: Problem set: 3 solved, 31 unsolved
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/58 constraints. Problems are: Problem set: 3 solved, 31 unsolved
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 10/68 constraints. Problems are: Problem set: 3 solved, 31 unsolved
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 5/73 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/73 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 232/353 variables, 121/194 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 31/225 constraints. Problems are: Problem set: 3 solved, 31 unsolved
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 1/226 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 1/354 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 31 unsolved
At refinement iteration 17 (OVERLAPS) 0/354 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 227 constraints, problems are : Problem set: 3 solved, 31 unsolved in 4852 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/34 constraints, Known Traps: 61/61 constraints]
After SMT, in 8640ms problems are : Problem set: 3 solved, 31 unsolved
Fused 31 Parikh solutions to 29 different solutions.
Parikh walk visited 27 properties in 7022 ms.
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 159 edges and 121 vertex of which 4 / 121 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 506 edges and 119 vertex of which 115 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 115 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 3 rules applied. Total rules applied 6 place count 114 transition count 225
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 113 transition count 224
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 112 transition count 223
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 58 place count 64 transition count 127
Iterating global reduction 4 with 48 rules applied. Total rules applied 106 place count 64 transition count 127
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 114 place count 56 transition count 111
Iterating global reduction 4 with 8 rules applied. Total rules applied 122 place count 56 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 131 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 54 transition count 96
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 137 place count 52 transition count 92
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 52 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 145 place count 52 transition count 86
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 6 with 2 rules applied. Total rules applied 147 place count 51 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 159 place count 45 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 45 transition count 119
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 164 place count 45 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 167 place count 42 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 42 transition count 256
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 172 place count 41 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 173 place count 41 transition count 252
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 174 place count 40 transition count 203
Iterating global reduction 8 with 1 rules applied. Total rules applied 175 place count 40 transition count 203
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 176 place count 39 transition count 201
Iterating global reduction 8 with 1 rules applied. Total rules applied 177 place count 39 transition count 201
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 192 place count 39 transition count 186
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 201 place count 39 transition count 186
Applied a total of 201 rules in 76 ms. Remains 39 /121 variables (removed 82) and now considering 186/240 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 39/121 places, 186/240 transitions.
RANDOM walk for 40000 steps (7670 resets) in 510 ms. (78 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (805 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (867 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (857 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
[2024-06-01 00:29:06] [INFO ] Flow matrix only has 147 transitions (discarded 39 similar events)
// Phase 1: matrix 147 rows 39 cols
[2024-06-01 00:29:06] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 00:29:06] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/186 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/186 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 39 ms.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 186/186 transitions.
Graph (trivial) has 7 edges and 39 vertex of which 2 / 39 are part of one of the 1 SCC in 0 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 189 edges and 38 vertex of which 26 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 26 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 24 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 24 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 24 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 23 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 23 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 22 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 22 transition count 104
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 38 place count 22 transition count 94
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 40 place count 21 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 49 place count 21 transition count 84
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 69 place count 21 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 21 transition count 76
Applied a total of 77 rules in 29 ms. Remains 21 /39 variables (removed 18) and now considering 76/186 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 21/39 places, 76/186 transitions.
RANDOM walk for 40000 steps (4414 resets) in 351 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (854 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8716 steps, run visited all 1 properties in 26 ms. (steps per millisecond=335 )
Probabilistic random walk after 8716 steps, saw 1779 distinct states, run finished after 29 ms. (steps per millisecond=300 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 240 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 165 edges and 121 vertex of which 6 / 121 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 65 transition count 134
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 65 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 114 place count 58 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 121 place count 58 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 128 place count 58 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 55 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 55 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 137 place count 52 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 140 place count 52 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 149 place count 52 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 52 transition count 87
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 2 with 4 rules applied. Total rules applied 155 place count 50 transition count 85
Applied a total of 155 rules in 19 ms. Remains 50 /121 variables (removed 71) and now considering 85/240 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 50/121 places, 85/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 132
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 59 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 59 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 130 place count 59 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 57 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 55 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 144 place count 55 transition count 98
Applied a total of 144 rules in 6 ms. Remains 55 /121 variables (removed 66) and now considering 98/240 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/121 places, 98/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 155 edges and 121 vertex of which 6 / 121 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 122 place count 52 transition count 110
Iterating global reduction 0 with 9 rules applied. Total rules applied 131 place count 52 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 141 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 49 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 46 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 46 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 46 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 46 transition count 74
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 2 with 4 rules applied. Total rules applied 168 place count 44 transition count 72
Applied a total of 168 rules in 18 ms. Remains 44 /121 variables (removed 77) and now considering 72/240 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 44/121 places, 72/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 65 transition count 132
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 65 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 57 transition count 116
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 57 transition count 116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 135 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 54 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 51 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 156 place count 51 transition count 85
Applied a total of 156 rules in 5 ms. Remains 51 /121 variables (removed 70) and now considering 85/240 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 51/121 places, 85/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 72 transition count 146
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 72 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 68 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 68 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 109 place count 68 transition count 135
Applied a total of 109 rules in 2 ms. Remains 68 /121 variables (removed 53) and now considering 135/240 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/121 places, 135/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 71 transition count 142
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 71 transition count 142
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 65 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 65 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 117 place count 65 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 64 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 64 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 63 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 63 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 63 transition count 117
Applied a total of 124 rules in 3 ms. Remains 63 /121 variables (removed 58) and now considering 117/240 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/121 places, 117/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 72 transition count 146
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 72 transition count 146
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 66 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 66 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 66 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 65 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 65 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 64 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 64 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 64 transition count 122
Applied a total of 121 rules in 3 ms. Remains 64 /121 variables (removed 57) and now considering 122/240 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/121 places, 122/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 74 transition count 149
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 74 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 69 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 69 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 69 transition count 136
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 67 transition count 130
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 67 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 66 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 66 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 116 place count 66 transition count 125
Applied a total of 116 rules in 3 ms. Remains 66 /121 variables (removed 55) and now considering 125/240 (removed 115) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 66/121 places, 125/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 64 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 64 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 56 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 56 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 56 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 53 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 53 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 50 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 50 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 159 place count 50 transition count 82
Applied a total of 159 rules in 2 ms. Remains 50 /121 variables (removed 71) and now considering 82/240 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/121 places, 82/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 140
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 61 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 61 transition count 124
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 128 place count 61 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 59 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 59 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 57 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 142 place count 57 transition count 100
Applied a total of 142 rules in 2 ms. Remains 57 /121 variables (removed 64) and now considering 100/240 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/121 places, 100/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 64 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 64 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 56 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 56 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 138 place count 56 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 53 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 147 place count 50 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 150 place count 50 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 159 place count 50 transition count 82
Applied a total of 159 rules in 3 ms. Remains 50 /121 variables (removed 71) and now considering 82/240 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/121 places, 82/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 63 transition count 128
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 63 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 124 place count 55 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 132 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 150 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 153 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 49 transition count 79
Applied a total of 162 rules in 2 ms. Remains 49 /121 variables (removed 72) and now considering 79/240 (removed 161) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/121 places, 79/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Graph (trivial) has 168 edges and 121 vertex of which 6 / 121 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 130
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 120 place count 53 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 129 place count 53 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 138 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 50 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 48 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 48 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 154 place count 48 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 48 transition count 82
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 2 with 4 rules applied. Total rules applied 160 place count 46 transition count 80
Applied a total of 160 rules in 12 ms. Remains 46 /121 variables (removed 75) and now considering 80/240 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 46/121 places, 80/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 69 transition count 140
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 69 transition count 140
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 62 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 62 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 62 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 61 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 61 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 60 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 60 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 134 place count 60 transition count 109
Applied a total of 134 rules in 2 ms. Remains 60 /121 variables (removed 61) and now considering 109/240 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/121 places, 109/240 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:07] [INFO ] Input system was already deterministic with 109 transitions.
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:29:07] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:29:07] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:29:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 240 transitions and 686 arcs took 4 ms.
Total runtime 72209 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2023-13
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-15-CTLFireability-2023-15

BK_STOP 1717201747855

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-15-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1118/ctl_0_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1118/ctl_1_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1118/ctl_2_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1118/ctl_3_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1118/ctl_4_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1118/ctl_5_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1118/ctl_6_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1118/ctl_7_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1118/ctl_8_
ctl formula name HealthRecord-PT-15-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1118/ctl_9_
ctl formula name HealthRecord-PT-15-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1118/ctl_10_
ctl formula name HealthRecord-PT-15-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1118/ctl_11_
ctl formula name HealthRecord-PT-15-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1118/ctl_12_
ctl formula name HealthRecord-PT-15-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1118/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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