Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K 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 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717235502213

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:51:43] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 09:51:43] [INFO ] Transformed 213 places.
[2024-06-01 09:51:43] [INFO ] Transformed 198 transitions.
[2024-06-01 09:51:43] [INFO ] Found NUPN structural information;
[2024-06-01 09:51:43] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 120 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 206 transition count 191
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 191
Applied a total of 14 rules in 30 ms. Remains 206 /213 variables (removed 7) and now considering 191/198 (removed 7) transitions.
// Phase 1: matrix 191 rows 206 cols
[2024-06-01 09:51:43] [INFO ] Computed 28 invariants in 17 ms
[2024-06-01 09:51:44] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 09:51:44] [INFO ] Invariant cache hit.
[2024-06-01 09:51:44] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-06-01 09:51:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:45] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 13 ms to minimize.
[2024-06-01 09:51:45] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:51:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:51:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:51:46] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:51:48] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:51:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 8 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:51:49] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:50] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 191/397 variables, 206/273 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:51:52] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:51:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:55] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:51:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:51:55] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:51:55] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/397 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:51:56] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:51:57] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:51:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:51:58] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/397 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:05] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/397 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 19 (OVERLAPS) 0/397 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 288 constraints, problems are : Problem set: 0 solved, 190 unsolved in 24961 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:10] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/397 variables, 206/289 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 190/479 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:52:12] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:52:13] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:52:14] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:15] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:52:15] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:52:16] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:52:16] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:52:16] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
[2024-06-01 09:52:17] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:52:17] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 7/495 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:52:20] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:22] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-06-01 09:52:22] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:52:22] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:52:23] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:25] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:52:25] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:52:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:52:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-01 09:52:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/397 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/397 variables, and 508 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 84/84 constraints]
After SMT, in 55057ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 55076ms
Starting structural reductions in LTL mode, iteration 1 : 206/213 places, 191/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55614 ms. Remains : 206/213 places, 191/198 transitions.
Support contains 120 out of 206 places after structural reductions.
[2024-06-01 09:52:39] [INFO ] Flatten gal took : 34 ms
[2024-06-01 09:52:39] [INFO ] Flatten gal took : 15 ms
[2024-06-01 09:52:39] [INFO ] Input system was already deterministic with 191 transitions.
RANDOM walk for 40000 steps (8 resets) in 1522 ms. (26 steps per ms) remains 7/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
[2024-06-01 09:52:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/166 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/206 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 191/397 variables, 206/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/397 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/166 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
Problem AtomicPropp96 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 6/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:52:40] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/206 variables, 6/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 191/397 variables, 206/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 3/244 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 09:52:41] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:52:41] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:52:41] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:52:41] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 4/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/397 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 248 constraints, problems are : Problem set: 1 solved, 3 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 955ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 704 ms.
Support contains 12 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 191/191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 206 transition count 153
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 168 transition count 151
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 82 place count 167 transition count 148
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 164 transition count 148
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 85 place count 164 transition count 134
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 113 place count 150 transition count 134
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 128 place count 135 transition count 119
Iterating global reduction 4 with 15 rules applied. Total rules applied 143 place count 135 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 143 place count 135 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 157 place count 128 transition count 112
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 251 place count 81 transition count 65
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 265 place count 74 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 266 place count 74 transition count 68
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 74 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 73 transition count 67
Applied a total of 269 rules in 73 ms. Remains 73 /206 variables (removed 133) and now considering 67/191 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 73/206 places, 67/191 transitions.
RANDOM walk for 40000 steps (9 resets) in 324 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 442671 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 3
Probabilistic random walk after 442671 steps, saw 274672 distinct states, run finished after 3004 ms. (steps per millisecond=147 ) properties seen :0
// Phase 1: matrix 67 rows 73 cols
[2024-06-01 09:52:45] [INFO ] Computed 28 invariants in 1 ms
[2024-06-01 09:52:45] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/57 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 54/111 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 16/127 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/140 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 112 constraints, problems are : Problem set: 0 solved, 3 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 73/73 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/57 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 5/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 54/111 variables, 57/82 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 11/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/127 variables, 8/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/140 variables, 8/115 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 4/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 119 constraints, problems are : Problem set: 1 solved, 2 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 73/73 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 315ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 67/67 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 71 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 71 transition count 64
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 6 place count 70 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 67 transition count 61
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 14 place count 66 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 65 transition count 61
Applied a total of 15 rules in 8 ms. Remains 65 /73 variables (removed 8) and now considering 61/67 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 65/73 places, 61/67 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 590145 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 2
Probabilistic random walk after 590145 steps, saw 338240 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
// Phase 1: matrix 61 rows 65 cols
[2024-06-01 09:52:48] [INFO ] Computed 28 invariants in 4 ms
[2024-06-01 09:52:48] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/36 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/77 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/103 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/106 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/106 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/126 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/126 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/126 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/36 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:52:48] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 09:52:48] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/103 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/104 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/104 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/106 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/106 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 20/126 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/126 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/126 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/126 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 65/65 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 65/65 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 09:52:49] [INFO ] Invariant cache hit.
[2024-06-01 09:52:49] [INFO ] Implicit Places using invariants in 46 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/65 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 64 transition count 60
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 60
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 63 cols
[2024-06-01 09:52:49] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 09:52:49] [INFO ] Implicit Places using invariants in 51 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 62/65 places, 60/61 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 59
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 61 cols
[2024-06-01 09:52:49] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 09:52:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 09:52:49] [INFO ] Invariant cache hit.
[2024-06-01 09:52:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:52:49] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 61/65 places, 59/61 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 233 ms. Remains : 61/65 places, 59/61 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 721937 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 2
Probabilistic random walk after 721937 steps, saw 395687 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-06-01 09:52:52] [INFO ] Invariant cache hit.
[2024-06-01 09:52:52] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/71 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/97 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/100 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 20/120 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/120 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/120 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 39/71 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/97 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 09:52:52] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/98 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/100 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 20/120 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/120 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/120 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/120 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 61/61 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 59/59 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 09:52:52] [INFO ] Invariant cache hit.
[2024-06-01 09:52:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 09:52:52] [INFO ] Invariant cache hit.
[2024-06-01 09:52:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:52:52] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-06-01 09:52:52] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 09:52:52] [INFO ] Invariant cache hit.
[2024-06-01 09:52:52] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 09:52:53] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 59/120 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 56 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 59/120 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 56/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 61/61 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 2/2 constraints]
After SMT, in 1854ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1854ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1967 ms. Remains : 61/61 places, 59/59 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 151 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 60 transition count 59
Applied a total of 9 rules in 11 ms. Remains 60 /61 variables (removed 1) and now considering 59/59 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 59 rows 60 cols
[2024-06-01 09:52:54] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 09:52:54] [INFO ] [Real]Absence check using 25 positive place invariants in 3 ms returned sat
[2024-06-01 09:52:54] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 09:52:54] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2024-06-01 09:52:54] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 09:52:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 09:52:54] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 09:52:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:52:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 09:52:54] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 09:52:54] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 200 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 191 transitions.
Computed a total of 56 stabilizing places and 56 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 164
Applied a total of 54 rules in 11 ms. Remains 179 /206 variables (removed 27) and now considering 164/191 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 179/206 places, 164/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 186 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 186 transition count 171
Applied a total of 40 rules in 6 ms. Remains 186 /206 variables (removed 20) and now considering 171/191 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 186/206 places, 171/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 165
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 165
Applied a total of 52 rules in 6 ms. Remains 180 /206 variables (removed 26) and now considering 165/191 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 180/206 places, 165/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 9 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Applied a total of 52 rules in 8 ms. Remains 180 /206 variables (removed 26) and now considering 165/191 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 180/206 places, 165/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Applied a total of 52 rules in 11 ms. Remains 180 /206 variables (removed 26) and now considering 165/191 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 180/206 places, 165/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 205 transition count 143
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 158 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 157 transition count 141
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 97 place count 157 transition count 127
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 125 place count 143 transition count 127
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 142 place count 126 transition count 110
Iterating global reduction 3 with 17 rules applied. Total rules applied 159 place count 126 transition count 110
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 159 place count 126 transition count 100
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 179 place count 116 transition count 100
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 267 place count 72 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 70 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 68 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 271 place count 68 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 67 transition count 53
Applied a total of 273 rules in 21 ms. Remains 67 /206 variables (removed 139) and now considering 53/191 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 67/206 places, 53/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 3 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 3 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 164
Applied a total of 54 rules in 11 ms. Remains 179 /206 variables (removed 27) and now considering 164/191 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 179/206 places, 164/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 205 transition count 151
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 166 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 165 transition count 150
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 80 place count 165 transition count 136
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 108 place count 151 transition count 136
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 122 place count 137 transition count 122
Iterating global reduction 3 with 14 rules applied. Total rules applied 136 place count 137 transition count 122
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 136 place count 137 transition count 113
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 154 place count 128 transition count 113
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 240 place count 85 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 83 transition count 68
Applied a total of 242 rules in 20 ms. Remains 83 /206 variables (removed 123) and now considering 68/191 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 83/206 places, 68/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 3 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 4 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 166
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 166
Applied a total of 50 rules in 7 ms. Remains 181 /206 variables (removed 25) and now considering 166/191 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 181/206 places, 166/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 167
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 166
Applied a total of 50 rules in 8 ms. Remains 181 /206 variables (removed 25) and now considering 166/191 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 181/206 places, 166/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 166
Applied a total of 50 rules in 11 ms. Remains 181 /206 variables (removed 25) and now considering 166/191 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 181/206 places, 166/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 165
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 178 transition count 163
Applied a total of 56 rules in 12 ms. Remains 178 /206 variables (removed 28) and now considering 163/191 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 178/206 places, 163/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 168
Applied a total of 46 rules in 5 ms. Remains 183 /206 variables (removed 23) and now considering 168/191 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 183/206 places, 168/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 205 transition count 151
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 166 transition count 149
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 85 place count 165 transition count 145
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 89 place count 161 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 89 place count 161 transition count 131
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 117 place count 147 transition count 131
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 132 place count 132 transition count 116
Iterating global reduction 4 with 15 rules applied. Total rules applied 147 place count 132 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 147 place count 132 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 165 place count 123 transition count 107
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 251 place count 80 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 252 place count 80 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 78 transition count 62
Applied a total of 254 rules in 21 ms. Remains 78 /206 variables (removed 128) and now considering 62/191 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 78/206 places, 62/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 3 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 3 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 190 transition count 175
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 190 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 189 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 188 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 188 transition count 173
Applied a total of 36 rules in 10 ms. Remains 188 /206 variables (removed 18) and now considering 173/191 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 188/206 places, 173/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 191/191 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 168
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 168
Applied a total of 46 rules in 9 ms. Remains 183 /206 variables (removed 23) and now considering 168/191 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 183/206 places, 168/191 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 09:52:55] [INFO ] Input system was already deterministic with 168 transitions.
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Flatten gal took : 8 ms
[2024-06-01 09:52:55] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 09:52:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 191 transitions and 478 arcs took 3 ms.
Total runtime 72322 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-2023-15

BK_STOP 1717235576100

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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