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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 20:29 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 72K 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-14-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-14-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716491211118

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:06:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 19:06:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:06:52] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-23 19:06:52] [INFO ] Transformed 162 places.
[2024-05-23 19:06:52] [INFO ] Transformed 347 transitions.
[2024-05-23 19:06:52] [INFO ] Found NUPN structural information;
[2024-05-23 19:06:52] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Support contains 93 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 318/318 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 129 transition count 259
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 129 transition count 259
Applied a total of 66 rules in 23 ms. Remains 129 /162 variables (removed 33) and now considering 259/318 (removed 59) transitions.
[2024-05-23 19:06:52] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
// Phase 1: matrix 254 rows 129 cols
[2024-05-23 19:06:52] [INFO ] Computed 11 invariants in 17 ms
[2024-05-23 19:06:52] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 19:06:52] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
[2024-05-23 19:06:52] [INFO ] Invariant cache hit.
[2024-05-23 19:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:06:53] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-23 19:06:53] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
[2024-05-23 19:06:53] [INFO ] Invariant cache hit.
[2024-05-23 19:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:06:54] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 17 ms to minimize.
[2024-05-23 19:06:54] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:06:54] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:06:54] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:06:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:06:56] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:06:56] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 2 ms to minimize.
[2024-05-23 19:06:56] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:56] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:56] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 4 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:06:57] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 5 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:06:58] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
[2024-05-23 19:06:59] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:07:02] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:07:02] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:02] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:07:02] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:03] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:07:04] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:07:04] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:07:04] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 253/382 variables, 129/235 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:07:06] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:07] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:07:07] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:07:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:07:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:07:08] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:07:08] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:07:08] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 7/244 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:15] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:07:15] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:16] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:16] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:19] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/383 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 254 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:07:26] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:26] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:07:26] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:07:26] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:27] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:28] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:29] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:29] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:07:30] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 15/173 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:32] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:07:32] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:07:32] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2024-05-23 19:07:32] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:07:33] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:07:34] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 17/190 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:35] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:07:35] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 2 ms to minimize.
[2024-05-23 19:07:36] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:36] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:36] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:38] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:07:42] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:07:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:07:46] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 19:07:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:07:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:07:50] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-23 19:07:50] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:07:50] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:51] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/383 variables, and 222 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/129 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/258 constraints, Known Traps: 211/211 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 129/162 places, 259/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60700 ms. Remains : 129/162 places, 259/318 transitions.
Support contains 93 out of 129 places after structural reductions.
[2024-05-23 19:07:53] [INFO ] Flatten gal took : 41 ms
[2024-05-23 19:07:53] [INFO ] Flatten gal took : 19 ms
[2024-05-23 19:07:53] [INFO ] Input system was already deterministic with 259 transitions.
RANDOM walk for 40000 steps (3371 resets) in 1784 ms. (22 steps per ms) remains 41/92 properties
BEST_FIRST walk for 4003 steps (38 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (37 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (37 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (39 resets) in 45 ms. (87 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (35 resets) in 39 ms. (100 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (41 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4002 steps (36 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (33 resets) in 10 ms. (363 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (23 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (37 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (39 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
[2024-05-23 19:07:54] [INFO ] Flow matrix only has 254 transitions (discarded 5 similar events)
[2024-05-23 19:07:54] [INFO ] Invariant cache hit.
[2024-05-23 19:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 41/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 40/129 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/382 variables, 129/140 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
Problem AtomicPropp32 is UNSAT
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:55] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 20/160 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 4 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 4/164 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:56] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 6/171 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-23 19:07:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/172 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 12 (OVERLAPS) 1/383 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 173 constraints, problems are : Problem set: 3 solved, 36 unsolved in 4062 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 3 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 44/89 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 5/8 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:07:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/11 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 40/129 variables, 8/19 constraints. Problems are: Problem set: 3 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 27/46 constraints. Problems are: Problem set: 3 solved, 36 unsolved
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 4 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
Problem AtomicPropp53 is UNSAT
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
Problem AtomicPropp53 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/66 constraints. Problems are: Problem set: 4 solved, 35 unsolved
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp83 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 6/72 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:08:00] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 17/89 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:08:01] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 3/92 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 3/95 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 1/96 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:08:02] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 7/103 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 7/110 constraints. Problems are: Problem set: 5 solved, 34 unsolved
[2024-05-23 19:08:03] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
SMT process timed out in 9121ms, After SMT, problems are : Problem set: 5 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 84 edges and 129 vertex of which 2 / 129 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 526 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 125 transition count 249
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 39 place count 91 transition count 181
Iterating global reduction 2 with 34 rules applied. Total rules applied 73 place count 91 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 87 transition count 173
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 87 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 87 transition count 169
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 87 place count 86 transition count 168
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 95 place count 82 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 82 transition count 184
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 114 place count 82 transition count 184
Applied a total of 114 rules in 64 ms. Remains 82 /129 variables (removed 47) and now considering 184/259 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 82/129 places, 184/259 transitions.
RANDOM walk for 40000 steps (176 resets) in 391 ms. (102 steps per ms) remains 27/34 properties
BEST_FIRST walk for 4002 steps (47 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (44 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (31 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (38 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (37 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (38 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (40 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (46 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (47 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (36 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (46 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (37 resets) in 30 ms. (129 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (39 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (45 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
[2024-05-23 19:08:04] [INFO ] Flow matrix only has 177 transitions (discarded 7 similar events)
// Phase 1: matrix 177 rows 82 cols
[2024-05-23 19:08:04] [INFO ] Computed 9 invariants in 7 ms
[2024-05-23 19:08:04] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 50/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:08:04] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 177/259 variables, 82/109 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/259 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 112 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 50/82 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-23 19:08:06] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:08:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 177/259 variables, 82/151 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 26/180 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 19:08:08] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/259 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 181 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3518 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 82/82 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 61/61 constraints]
After SMT, in 5072ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 22 different solutions.
Parikh walk visited 22 properties in 3997 ms.
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 184/184 transitions.
Graph (trivial) has 72 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 59 transition count 139
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 59 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 48 place count 59 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 58 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 58 transition count 134
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 58 place count 54 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 52 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 52 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 50 transition count 142
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 50 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 48 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 48 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 48 transition count 136
Applied a total of 75 rules in 41 ms. Remains 48 /82 variables (removed 34) and now considering 136/184 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 48/82 places, 136/184 transitions.
RANDOM walk for 40000 steps (2605 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (435 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (504 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (436 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (417 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 15057 steps, run visited all 4 properties in 93 ms. (steps per millisecond=161 )
Probabilistic random walk after 15057 steps, saw 3744 distinct states, run finished after 98 ms. (steps per millisecond=153 ) properties seen :4
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-14-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 14 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 12 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 85 out of 129 places (down from 87) after GAL structural reductions.
Computed a total of 13 stabilizing places and 23 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 149 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 69 transition count 143
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 69 transition count 143
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 123 place count 63 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 129 place count 63 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 135 place count 63 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 63 transition count 123
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 1 with 4 rules applied. Total rules applied 141 place count 61 transition count 121
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 61 transition count 121
Applied a total of 142 rules in 23 ms. Remains 61 /129 variables (removed 68) and now considering 121/259 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 61/129 places, 121/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 182 edges and 129 vertex of which 6 / 129 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 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 62 place count 64 transition count 135
Iterating global reduction 0 with 61 rules applied. Total rules applied 123 place count 64 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 131 place count 56 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 139 place count 56 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 145 place count 56 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 55 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 55 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 54 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 54 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 152 place count 54 transition count 105
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 154 place count 54 transition count 103
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 158 place count 52 transition count 101
Applied a total of 158 rules in 23 ms. Remains 52 /129 variables (removed 77) and now considering 101/259 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 52/129 places, 101/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 72 transition count 147
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 72 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 65 transition count 133
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 65 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 65 transition count 124
Applied a total of 137 rules in 5 ms. Remains 65 /129 variables (removed 64) and now considering 124/259 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 65/129 places, 124/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 183 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 63 transition count 132
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 63 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 136 place count 54 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 145 place count 54 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 154 place count 54 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 51 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 163 place count 48 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 166 place count 48 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 175 place count 48 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 48 transition count 80
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 2 with 2 rules applied. Total rules applied 178 place count 47 transition count 79
Applied a total of 178 rules in 18 ms. Remains 47 /129 variables (removed 82) and now considering 79/259 (removed 180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 47/129 places, 79/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 68 transition count 139
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 68 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 127 place count 63 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 132 place count 63 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 137 place count 63 transition count 124
Applied a total of 137 rules in 4 ms. Remains 63 /129 variables (removed 66) and now considering 124/259 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/129 places, 124/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 72 transition count 146
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 72 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 121 place count 65 transition count 132
Iterating global reduction 0 with 7 rules applied. Total rules applied 128 place count 65 transition count 132
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 65 transition count 123
Applied a total of 137 rules in 4 ms. Remains 65 /129 variables (removed 64) and now considering 123/259 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/129 places, 123/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 69 transition count 141
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 69 transition count 141
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 62 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 62 transition count 127
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 142 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 60 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 60 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 58 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 58 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 156 place count 58 transition count 103
Applied a total of 156 rules in 5 ms. Remains 58 /129 variables (removed 71) and now considering 103/259 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 58/129 places, 103/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 67 transition count 137
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 67 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 131 place count 60 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 138 place count 60 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 147 place count 60 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 148 place count 59 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 149 place count 59 transition count 111
Applied a total of 149 rules in 5 ms. Remains 59 /129 variables (removed 70) and now considering 111/259 (removed 148) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 59/129 places, 111/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 166 edges and 129 vertex of which 6 / 129 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 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 61 transition count 129
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 61 transition count 129
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 138 place count 52 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 147 place count 52 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 156 place count 52 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 159 place count 49 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 162 place count 49 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 165 place count 46 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 168 place count 46 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 177 place count 46 transition count 78
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 179 place count 46 transition count 76
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 183 place count 44 transition count 74
Applied a total of 183 rules in 16 ms. Remains 44 /129 variables (removed 85) and now considering 74/259 (removed 185) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 44/129 places, 74/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 69 transition count 141
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 69 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 65 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 65 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 134 place count 65 transition count 127
Applied a total of 134 rules in 3 ms. Remains 65 /129 variables (removed 64) and now considering 127/259 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/129 places, 127/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 72 transition count 147
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 72 transition count 147
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 119 place count 67 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 124 place count 67 transition count 137
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 67 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 66 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 66 transition count 128
Applied a total of 132 rules in 4 ms. Remains 66 /129 variables (removed 63) and now considering 128/259 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 66/129 places, 128/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Graph (trivial) has 188 edges and 129 vertex of which 6 / 129 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 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 61 transition count 129
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 61 transition count 129
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 138 place count 52 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 147 place count 52 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 157 place count 52 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 49 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 46 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 46 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 178 place count 46 transition count 77
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 180 place count 46 transition count 75
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 184 place count 44 transition count 73
Applied a total of 184 rules in 15 ms. Remains 44 /129 variables (removed 85) and now considering 73/259 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 44/129 places, 73/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 68 transition count 138
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 68 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 65 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 65 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 64 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 64 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 63 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 63 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 135 place count 63 transition count 124
Applied a total of 135 rules in 5 ms. Remains 63 /129 variables (removed 66) and now considering 124/259 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 63/129 places, 124/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 65 transition count 133
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 65 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 59 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 59 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 143 place count 59 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 146 place count 56 transition count 109
Iterating global reduction 1 with 3 rules applied. Total rules applied 149 place count 56 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 53 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 53 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 163 place count 53 transition count 95
Applied a total of 163 rules in 6 ms. Remains 53 /129 variables (removed 76) and now considering 95/259 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 53/129 places, 95/259 transitions.
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:08:14] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 259/259 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 66 transition count 135
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 66 transition count 135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 134 place count 58 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 142 place count 58 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 55 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 55 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 52 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 52 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 172 place count 52 transition count 86
Applied a total of 172 rules in 6 ms. Remains 52 /129 variables (removed 77) and now considering 86/259 (removed 173) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 52/129 places, 86/259 transitions.
[2024-05-23 19:08:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:08:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:08:14] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-23 19:08:14] [INFO ] Flatten gal took : 9 ms
[2024-05-23 19:08:14] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:08:14] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-23 19:08:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 259 transitions and 721 arcs took 2 ms.
Total runtime 81796 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-14

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: 129
TRANSITIONS: 259
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: 1683
MODEL NAME: /home/mcc/execution/412/model
129 places, 259 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-14-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716491338331

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

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

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-14"
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-14, 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-171640602400802"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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