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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.6K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:37 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 83K 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-005B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-005B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716927726135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 20:22:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 20:22:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:22:07] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-28 20:22:07] [INFO ] Transformed 353 places.
[2024-05-28 20:22:07] [INFO ] Transformed 328 transitions.
[2024-05-28 20:22:07] [INFO ] Found NUPN structural information;
[2024-05-28 20:22:07] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 123 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 328/328 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 327 transition count 302
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 327 transition count 302
Applied a total of 52 rules in 46 ms. Remains 327 /353 variables (removed 26) and now considering 302/328 (removed 26) transitions.
// Phase 1: matrix 302 rows 327 cols
[2024-05-28 20:22:07] [INFO ] Computed 46 invariants in 9 ms
[2024-05-28 20:22:07] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-28 20:22:07] [INFO ] Invariant cache hit.
[2024-05-28 20:22:08] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-28 20:22:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 31 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 10 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:22:14] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 8 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:25] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 10 (OVERLAPS) 302/629 variables, 327/461 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/629 variables, and 462 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 89/135 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:41] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:41] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/629 variables, 327/465 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 301/766 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-28 20:22:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-28 20:22:48] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-28 20:22:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:48] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-28 20:22:48] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:22:49] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:22:50] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:22:50] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:50] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:22:51] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:22:51] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:22:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:22:51] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-28 20:22:52] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 20/786 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-28 20:22:59] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 16/802 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-28 20:23:04] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-28 20:23:05] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:23:05] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:23:06] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-28 20:23:06] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:23:06] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:23:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 7/809 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 809 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 135/135 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 327/353 places, 302/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60719 ms. Remains : 327/353 places, 302/328 transitions.
Support contains 123 out of 327 places after structural reductions.
[2024-05-28 20:23:08] [INFO ] Flatten gal took : 63 ms
[2024-05-28 20:23:08] [INFO ] Flatten gal took : 36 ms
[2024-05-28 20:23:08] [INFO ] Input system was already deterministic with 302 transitions.
Reduction of identical properties reduced properties to check from 89 to 88
RANDOM walk for 40000 steps (8 resets) in 1554 ms. (25 steps per ms) remains 4/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
[2024-05-28 20:23:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 1 (OVERLAPS) 89/102 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 225/327 variables, 36/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 302/629 variables, 327/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/629 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 373 constraints, problems are : Problem set: 1 solved, 2 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/78 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 249/327 variables, 39/46 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:23:09] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:23:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 7/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 302/629 variables, 327/380 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 2/382 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 20:23:10] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:23:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 2/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 384 constraints, problems are : Problem set: 1 solved, 2 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 949ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 389 ms.
Support contains 7 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 327 transition count 238
Reduce places removed 64 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 66 rules applied. Total rules applied 130 place count 263 transition count 236
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 262 transition count 234
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 260 transition count 234
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 135 place count 260 transition count 208
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 187 place count 234 transition count 208
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 207 place count 214 transition count 188
Iterating global reduction 4 with 20 rules applied. Total rules applied 227 place count 214 transition count 188
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 227 place count 214 transition count 174
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 255 place count 200 transition count 174
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 425 place count 115 transition count 89
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 449 place count 103 transition count 95
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 450 place count 103 transition count 94
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 454 place count 103 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 455 place count 102 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 457 place count 100 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 457 place count 100 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 99 transition count 92
Applied a total of 459 rules in 66 ms. Remains 99 /327 variables (removed 228) and now considering 92/302 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 99/327 places, 92/302 transitions.
RANDOM walk for 36001 steps (8 resets) in 887 ms. (40 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 302 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 303 transition count 278
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 303 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 302 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 302 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 301 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 301 transition count 276
Applied a total of 52 rules in 26 ms. Remains 301 /327 variables (removed 26) and now considering 276/302 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 301/327 places, 276/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 302 transition count 277
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 302 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 301 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 301 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 300 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 300 transition count 275
Applied a total of 54 rules in 33 ms. Remains 300 /327 variables (removed 27) and now considering 275/302 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 300/327 places, 275/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 275 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 301 transition count 276
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 301 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 300 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 27 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 299/327 places, 274/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Applied a total of 54 rules in 15 ms. Remains 300 /327 variables (removed 27) and now considering 275/302 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 300/327 places, 275/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 275 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 302 transition count 277
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 302 transition count 277
Applied a total of 50 rules in 13 ms. Remains 302 /327 variables (removed 25) and now considering 277/302 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 302/327 places, 277/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 299 transition count 274
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 299 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 298 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 298 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 297 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 297 transition count 272
Applied a total of 60 rules in 26 ms. Remains 297 /327 variables (removed 30) and now considering 272/302 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 297/327 places, 272/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 326 transition count 237
Reduce places removed 64 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 66 rules applied. Total rules applied 130 place count 262 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 261 transition count 235
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 131 place count 261 transition count 208
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 185 place count 234 transition count 208
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 208 place count 211 transition count 185
Iterating global reduction 3 with 23 rules applied. Total rules applied 231 place count 211 transition count 185
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 231 place count 211 transition count 168
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 265 place count 194 transition count 168
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 417 place count 118 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 419 place count 116 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 421 place count 114 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 421 place count 114 transition count 89
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 423 place count 113 transition count 89
Applied a total of 423 rules in 59 ms. Remains 113 /327 variables (removed 214) and now considering 89/302 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 113/327 places, 89/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 301 transition count 276
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 301 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 300 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 22 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 299/327 places, 274/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 303 transition count 278
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 303 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 302 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 302 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 301 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 301 transition count 276
Applied a total of 52 rules in 15 ms. Remains 301 /327 variables (removed 26) and now considering 276/302 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 301/327 places, 276/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 326 transition count 235
Reduce places removed 66 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 68 rules applied. Total rules applied 134 place count 260 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 259 transition count 233
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 135 place count 259 transition count 206
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 189 place count 232 transition count 206
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 211 place count 210 transition count 184
Iterating global reduction 3 with 22 rules applied. Total rules applied 233 place count 210 transition count 184
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 233 place count 210 transition count 167
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 267 place count 193 transition count 167
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 419 place count 117 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 115 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 423 place count 113 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 423 place count 113 transition count 88
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 425 place count 112 transition count 88
Applied a total of 425 rules in 43 ms. Remains 112 /327 variables (removed 215) and now considering 88/302 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 112/327 places, 88/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 326 transition count 239
Reduce places removed 62 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 64 rules applied. Total rules applied 126 place count 264 transition count 237
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 130 place count 263 transition count 234
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 260 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 133 place count 260 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 181 place count 236 transition count 210
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 201 place count 216 transition count 190
Iterating global reduction 4 with 20 rules applied. Total rules applied 221 place count 216 transition count 190
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 221 place count 216 transition count 175
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 251 place count 201 transition count 175
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 397 place count 128 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 399 place count 126 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 400 place count 125 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 400 place count 125 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 124 transition count 99
Applied a total of 402 rules in 33 ms. Remains 124 /327 variables (removed 203) and now considering 99/302 (removed 203) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 124/327 places, 99/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 326 transition count 235
Reduce places removed 66 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 68 rules applied. Total rules applied 134 place count 260 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 259 transition count 233
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 135 place count 259 transition count 207
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 187 place count 233 transition count 207
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 208 place count 212 transition count 186
Iterating global reduction 3 with 21 rules applied. Total rules applied 229 place count 212 transition count 186
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 229 place count 212 transition count 169
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 263 place count 195 transition count 169
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 419 place count 117 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 115 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 114 transition count 89
Applied a total of 422 rules in 24 ms. Remains 114 /327 variables (removed 213) and now considering 89/302 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 114/327 places, 89/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 326 transition count 237
Reduce places removed 64 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 66 rules applied. Total rules applied 130 place count 262 transition count 235
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 261 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 260 transition count 234
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 133 place count 260 transition count 207
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 187 place count 233 transition count 207
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 209 place count 211 transition count 185
Iterating global reduction 4 with 22 rules applied. Total rules applied 231 place count 211 transition count 185
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 231 place count 211 transition count 169
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 263 place count 195 transition count 169
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 415 place count 119 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 417 place count 117 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 419 place count 115 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 419 place count 115 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 421 place count 114 transition count 90
Applied a total of 421 rules in 24 ms. Remains 114 /327 variables (removed 213) and now considering 90/302 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 114/327 places, 90/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 301 transition count 276
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 301 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 300 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Applied a total of 56 rules in 22 ms. Remains 299 /327 variables (removed 28) and now considering 274/302 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 299/327 places, 274/302 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Applied a total of 54 rules in 7 ms. Remains 300 /327 variables (removed 27) and now considering 275/302 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 300/327 places, 275/302 transitions.
[2024-05-28 20:23:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:23:12] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:23:12] [INFO ] Input system was already deterministic with 275 transitions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 302/302 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 300 transition count 275
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 300 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 299 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 299 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 298 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 298 transition count 273
Applied a total of 58 rules in 15 ms. Remains 298 /327 variables (removed 29) and now considering 273/302 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 298/327 places, 273/302 transitions.
[2024-05-28 20:23:12] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:23:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:23:12] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-28 20:23:12] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:23:12] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:23:12] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-28 20:23:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 302 transitions and 764 arcs took 5 ms.
Total runtime 64932 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-005B

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1040
MODEL NAME: /home/mcc/execution/411/model
327 places, 302 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Error in allocating array of size 524288 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-005B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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