Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 20:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 20:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 47K 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-02-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-02-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716490094163

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:48:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 18:48:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:48:15] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-23 18:48:15] [INFO ] Transformed 119 places.
[2024-05-23 18:48:15] [INFO ] Transformed 225 transitions.
[2024-05-23 18:48:15] [INFO ] Found NUPN structural information;
[2024-05-23 18:48:15] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA HealthRecord-PT-02-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 219/219 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 100 transition count 186
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 100 transition count 186
Applied a total of 38 rules in 20 ms. Remains 100 /119 variables (removed 19) and now considering 186/219 (removed 33) transitions.
[2024-05-23 18:48:15] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
// Phase 1: matrix 183 rows 100 cols
[2024-05-23 18:48:15] [INFO ] Computed 9 invariants in 8 ms
[2024-05-23 18:48:15] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-23 18:48:15] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
[2024-05-23 18:48:15] [INFO ] Invariant cache hit.
[2024-05-23 18:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:48:15] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-23 18:48:15] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
[2024-05-23 18:48:15] [INFO ] Invariant cache hit.
[2024-05-23 18:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:17] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 14 ms to minimize.
[2024-05-23 18:48:17] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-23 18:48:17] [INFO ] Deduced a trap composed of 38 places in 377 ms of which 1 ms to minimize.
[2024-05-23 18:48:17] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:48:17] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-23 18:48:17] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-23 18:48:18] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:19] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:20] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:21] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 8 ms to minimize.
[2024-05-23 18:48:21] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:48:21] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 182/282 variables, 100/146 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 1/283 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:25] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12683 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:29] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 182/282 variables, 100/149 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 185/334 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 1/283 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-23 18:48:34] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:48:36] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 337 constraints, problems are : Problem set: 0 solved, 185 unsolved in 14770 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 42/42 constraints]
After SMT, in 27599ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 27617ms
Starting structural reductions in LTL mode, iteration 1 : 100/119 places, 186/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28026 ms. Remains : 100/119 places, 186/219 transitions.
Support contains 84 out of 100 places after structural reductions.
[2024-05-23 18:48:43] [INFO ] Flatten gal took : 75 ms
[2024-05-23 18:48:43] [INFO ] Flatten gal took : 22 ms
[2024-05-23 18:48:43] [INFO ] Input system was already deterministic with 186 transitions.
Reduction of identical properties reduced properties to check from 73 to 72
RANDOM walk for 40000 steps (2350 resets) in 1994 ms. (20 steps per ms) remains 34/72 properties
BEST_FIRST walk for 4004 steps (39 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (33 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (37 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (36 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (36 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4004 steps (37 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (35 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (33 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (31 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (35 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (34 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (38 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
[2024-05-23 18:48:44] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
[2024-05-23 18:48:44] [INFO ] Invariant cache hit.
[2024-05-23 18:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/82 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
Problem AtomicPropp61 is UNSAT
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 6/9 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 5/14 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-23 18:48:45] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/16 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 25 unsolved
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 6 (OVERLAPS) 18/100 variables, 6/22 constraints. Problems are: Problem set: 6 solved, 22 unsolved
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 6/28 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/28 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 182/282 variables, 100/128 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/128 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 1/283 variables, 1/129 constraints. Problems are: Problem set: 8 solved, 20 unsolved
[2024-05-23 18:48:46] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/130 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/130 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/130 constraints. Problems are: Problem set: 8 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 130 constraints, problems are : Problem set: 8 solved, 20 unsolved in 2129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 8 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 20 unsolved
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/70 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 14/17 constraints. Problems are: Problem set: 9 solved, 19 unsolved
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/19 constraints. Problems are: Problem set: 9 solved, 19 unsolved
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/20 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 30/100 variables, 6/26 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 6/32 constraints. Problems are: Problem set: 9 solved, 19 unsolved
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 5/37 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 182/282 variables, 100/137 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 19/156 constraints. Problems are: Problem set: 9 solved, 19 unsolved
[2024-05-23 18:48:47] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 1/157 constraints. Problems are: Problem set: 9 solved, 19 unsolved
[2024-05-23 18:48:48] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 1/158 constraints. Problems are: Problem set: 9 solved, 19 unsolved
[2024-05-23 18:48:48] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-23 18:48:48] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 2/160 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/160 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 1/283 variables, 1/161 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/161 constraints. Problems are: Problem set: 9 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 0/283 variables, 0/161 constraints. Problems are: Problem set: 9 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 161 constraints, problems are : Problem set: 9 solved, 19 unsolved in 2113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/28 constraints, Known Traps: 32/32 constraints]
After SMT, in 4263ms problems are : Problem set: 9 solved, 19 unsolved
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 17 properties in 1026 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 186/186 transitions.
Graph (trivial) has 139 edges and 100 vertex of which 10 / 100 are part of one of the 5 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 329 edges and 95 vertex of which 92 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 92 transition count 168
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 88 transition count 162
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 86 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 86 transition count 158
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 81 transition count 158
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 63 place count 45 transition count 86
Iterating global reduction 3 with 36 rules applied. Total rules applied 99 place count 45 transition count 86
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 109 place count 35 transition count 66
Iterating global reduction 3 with 10 rules applied. Total rules applied 119 place count 35 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 35 transition count 62
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 32 transition count 53
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 32 transition count 53
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 29 transition count 47
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 29 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 138 place count 29 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 148 place count 24 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 24 transition count 67
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 160 place count 24 transition count 67
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 169 place count 24 transition count 67
Applied a total of 169 rules in 45 ms. Remains 24 /100 variables (removed 76) and now considering 67/186 (removed 119) transitions.
Running 51 sub problems to find dead transitions.
[2024-05-23 18:48:50] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 24 cols
[2024-05-23 18:48:50] [INFO ] Computed 4 invariants in 3 ms
[2024-05-23 18:48:50] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 3 (OVERLAPS) 63/87 variables, 24/28 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/39 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/39 constraints. Problems are: Problem set: 10 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 39 constraints, problems are : Problem set: 10 solved, 41 unsolved in 433 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 63/87 variables, 24/28 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/39 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 41/80 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/80 constraints. Problems are: Problem set: 10 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/80 constraints. Problems are: Problem set: 10 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 80 constraints, problems are : Problem set: 10 solved, 41 unsolved in 555 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 41/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1029ms problems are : Problem set: 10 solved, 41 unsolved
Search for dead transitions found 10 dead transitions in 1031ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/100 places, 57/186 transitions.
Graph (complete) has 69 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 57
Applied a total of 3 rules in 7 ms. Remains 23 /24 variables (removed 1) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1084 ms. Remains : 23/100 places, 57/186 transitions.
RANDOM walk for 34907 steps (11519 resets) in 825 ms. (42 steps per ms) remains 0/2 properties
Successfully simplified 9 atomic propositions for a total of 15 simplifications.
FORMULA HealthRecord-PT-02-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 10 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 186 transitions.
Computed a total of 10 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 65 transition count 118
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 65 transition count 118
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 57 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 57 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 89 place count 57 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 56 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 56 transition count 96
Applied a total of 91 rules in 4 ms. Remains 56 /100 variables (removed 44) and now considering 96/186 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 56/100 places, 96/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 58 transition count 104
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 58 transition count 104
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 48 transition count 84
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 48 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 108 place count 48 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 46 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 46 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 44 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 44 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 44 transition count 68
Applied a total of 118 rules in 5 ms. Remains 44 /100 variables (removed 56) and now considering 68/186 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 44/100 places, 68/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 59 transition count 106
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 59 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 52 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 52 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 52 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 49 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 49 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 46 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 46 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 46 transition count 72
Applied a total of 113 rules in 8 ms. Remains 46 /100 variables (removed 54) and now considering 72/186 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 46/100 places, 72/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 62 transition count 112
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 62 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 54 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 54 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 52 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 52 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 50 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 50 transition count 82
Applied a total of 104 rules in 5 ms. Remains 50 /100 variables (removed 50) and now considering 82/186 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 50/100 places, 82/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 59 transition count 105
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 59 transition count 105
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 51 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 51 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 51 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 49 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 49 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 47 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 47 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 47 transition count 73
Applied a total of 112 rules in 5 ms. Remains 47 /100 variables (removed 53) and now considering 73/186 (removed 113) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 47/100 places, 73/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 63 transition count 114
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 63 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 56 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 56 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 54 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 52 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 52 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 52 transition count 86
Applied a total of 100 rules in 5 ms. Remains 52 /100 variables (removed 48) and now considering 86/186 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 52/100 places, 86/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Graph (trivial) has 89 edges and 100 vertex of which 12 / 100 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 63 transition count 120
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 63 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 70 place count 56 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 77 place count 56 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 80 place count 56 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 54 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 54 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 53 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 53 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 53 transition count 91
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 49 transition count 87
Applied a total of 98 rules in 16 ms. Remains 49 /100 variables (removed 51) and now considering 87/186 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 49/100 places, 87/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 58 transition count 103
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 58 transition count 103
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 48 transition count 83
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 48 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 108 place count 48 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 45 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 45 transition count 70
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 42 transition count 64
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 42 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 42 transition count 61
Applied a total of 123 rules in 3 ms. Remains 42 /100 variables (removed 58) and now considering 61/186 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/100 places, 61/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Graph (trivial) has 142 edges and 100 vertex of which 12 / 100 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 54 transition count 103
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 54 transition count 103
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 89 place count 44 transition count 83
Iterating global reduction 0 with 10 rules applied. Total rules applied 99 place count 44 transition count 83
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 104 place count 44 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 42 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 42 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 40 transition count 68
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 40 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 114 place count 40 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 40 transition count 62
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 122 place count 38 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 36 transition count 58
Applied a total of 124 rules in 12 ms. Remains 36 /100 variables (removed 64) and now considering 58/186 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 36/100 places, 58/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 58 transitions.
RANDOM walk for 40000 steps (4043 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (638 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 118 steps, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Probabilistic random walk after 118 steps, saw 92 distinct states, run finished after 8 ms. (steps per millisecond=14 ) properties seen :1
FORMULA HealthRecord-PT-02-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 61 transition count 110
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 61 transition count 110
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 52 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 52 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 48 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 48 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 48 transition count 78
Applied a total of 108 rules in 3 ms. Remains 48 /100 variables (removed 52) and now considering 78/186 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/100 places, 78/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 60 transition count 108
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 60 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 52 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 52 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 51 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 50 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 50 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 50 transition count 82
Applied a total of 105 rules in 3 ms. Remains 50 /100 variables (removed 50) and now considering 82/186 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/100 places, 82/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 59 transition count 106
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 59 transition count 106
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 50 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 50 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 50 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 106 place count 47 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 109 place count 47 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 45 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 45 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 45 transition count 70
Applied a total of 115 rules in 2 ms. Remains 45 /100 variables (removed 55) and now considering 70/186 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/100 places, 70/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 63 transition count 114
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 63 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 56 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 56 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 56 transition count 99
Applied a total of 89 rules in 2 ms. Remains 56 /100 variables (removed 44) and now considering 99/186 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 56/100 places, 99/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 186/186 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 63 transition count 114
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 63 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 56 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 56 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 54 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 52 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 52 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 52 transition count 86
Applied a total of 100 rules in 2 ms. Remains 52 /100 variables (removed 48) and now considering 86/186 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 52/100 places, 86/186 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 18:48:51] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 7 ms
[2024-05-23 18:48:51] [INFO ] Flatten gal took : 7 ms
[2024-05-23 18:48:51] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-23 18:48:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 186 transitions and 487 arcs took 4 ms.
Total runtime 36671 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-02

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 787
MODEL NAME: /home/mcc/execution/412/model
100 places, 186 transitions.

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

BK_STOP 1716490133418

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640602100706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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