fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r179-tall-171640600700074
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13141.304 979805.00 2322931.00 1757.30 ?T???T?????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640600700074.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 FlexibleBarrier-PT-12b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600700074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716419421182

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:10:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:10:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:10:22] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-22 23:10:22] [INFO ] Transformed 1988 places.
[2024-05-22 23:10:22] [INFO ] Transformed 2289 transitions.
[2024-05-22 23:10:22] [INFO ] Found NUPN structural information;
[2024-05-22 23:10:22] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 118 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 751 places :
Symmetric choice reduction at 0 with 751 rule applications. Total rules 751 place count 1237 transition count 1538
Iterating global reduction 0 with 751 rules applied. Total rules applied 1502 place count 1237 transition count 1538
Discarding 325 places :
Symmetric choice reduction at 0 with 325 rule applications. Total rules 1827 place count 912 transition count 1213
Iterating global reduction 0 with 325 rules applied. Total rules applied 2152 place count 912 transition count 1213
Discarding 183 places :
Symmetric choice reduction at 0 with 183 rule applications. Total rules 2335 place count 729 transition count 1030
Iterating global reduction 0 with 183 rules applied. Total rules applied 2518 place count 729 transition count 1030
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 2592 place count 729 transition count 956
Applied a total of 2592 rules in 349 ms. Remains 729 /1988 variables (removed 1259) and now considering 956/2289 (removed 1333) transitions.
// Phase 1: matrix 956 rows 729 cols
[2024-05-22 23:10:23] [INFO ] Computed 14 invariants in 24 ms
[2024-05-22 23:10:23] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-22 23:10:23] [INFO ] Invariant cache hit.
[2024-05-22 23:10:24] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Running 955 sub problems to find dead transitions.
[2024-05-22 23:10:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (OVERLAPS) 1/729 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 955 unsolved
[2024-05-22 23:10:44] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 32 ms to minimize.
[2024-05-22 23:10:44] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 4 ms to minimize.
[2024-05-22 23:10:44] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-05-22 23:10:44] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/1685 variables, and 18 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/729 constraints, PredecessorRefiner: 955/955 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (OVERLAPS) 1/729 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/729 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 955 unsolved
[2024-05-22 23:11:05] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/729 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 955 unsolved
[2024-05-22 23:11:17] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-22 23:11:17] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-22 23:11:17] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/1685 variables, and 22 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/729 constraints, PredecessorRefiner: 0/955 constraints, Known Traps: 8/8 constraints]
After SMT, in 60741ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 60851ms
Starting structural reductions in LTL mode, iteration 1 : 729/1988 places, 956/2289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62262 ms. Remains : 729/1988 places, 956/2289 transitions.
Support contains 118 out of 729 places after structural reductions.
[2024-05-22 23:11:25] [INFO ] Flatten gal took : 99 ms
[2024-05-22 23:11:25] [INFO ] Flatten gal took : 66 ms
[2024-05-22 23:11:25] [INFO ] Input system was already deterministic with 956 transitions.
Support contains 112 out of 729 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (454 resets) in 1591 ms. (25 steps per ms) remains 47/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 46/46 properties
[2024-05-22 23:11:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 657/729 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/729 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 956/1685 variables, 729/743 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 0/1685 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 743 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2932 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 729/729 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 657/729 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 23:11:29] [INFO ] Deduced a trap composed of 229 places in 224 ms of which 4 ms to minimize.
[2024-05-22 23:11:30] [INFO ] Deduced a trap composed of 194 places in 242 ms of which 4 ms to minimize.
[2024-05-22 23:11:30] [INFO ] Deduced a trap composed of 192 places in 228 ms of which 5 ms to minimize.
[2024-05-22 23:11:30] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 4 ms to minimize.
[2024-05-22 23:11:30] [INFO ] Deduced a trap composed of 196 places in 205 ms of which 3 ms to minimize.
[2024-05-22 23:11:31] [INFO ] Deduced a trap composed of 194 places in 217 ms of which 5 ms to minimize.
[2024-05-22 23:11:31] [INFO ] Deduced a trap composed of 249 places in 224 ms of which 4 ms to minimize.
[2024-05-22 23:11:31] [INFO ] Deduced a trap composed of 188 places in 221 ms of which 3 ms to minimize.
[2024-05-22 23:11:31] [INFO ] Deduced a trap composed of 191 places in 215 ms of which 3 ms to minimize.
[2024-05-22 23:11:32] [INFO ] Deduced a trap composed of 223 places in 203 ms of which 4 ms to minimize.
[2024-05-22 23:11:32] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/729 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 23:11:33] [INFO ] Deduced a trap composed of 191 places in 202 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/729 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 23:11:34] [INFO ] Deduced a trap composed of 228 places in 216 ms of which 4 ms to minimize.
[2024-05-22 23:11:34] [INFO ] Deduced a trap composed of 221 places in 199 ms of which 3 ms to minimize.
[2024-05-22 23:11:34] [INFO ] Deduced a trap composed of 195 places in 194 ms of which 4 ms to minimize.
SMT process timed out in 8120ms, After SMT, problems are : Problem set: 0 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 729 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 729/729 places, 956/956 transitions.
Graph (trivial) has 461 edges and 729 vertex of which 66 / 729 are part of one of the 11 SCC in 4 ms
Free SCC test removed 55 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 674 transition count 840
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 624 transition count 839
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 102 place count 624 transition count 802
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 176 place count 587 transition count 802
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 217 place count 546 transition count 761
Iterating global reduction 2 with 41 rules applied. Total rules applied 258 place count 546 transition count 761
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 261 place count 546 transition count 758
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 277 place count 530 transition count 742
Iterating global reduction 3 with 16 rules applied. Total rules applied 293 place count 530 transition count 742
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 301 place count 530 transition count 734
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 453 place count 454 transition count 658
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 456 place count 451 transition count 655
Iterating global reduction 4 with 3 rules applied. Total rules applied 459 place count 451 transition count 655
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 462 place count 451 transition count 652
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 464 place count 450 transition count 652
Free-agglomeration rule applied 152 times.
Iterating global reduction 5 with 152 rules applied. Total rules applied 616 place count 450 transition count 500
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 5 with 152 rules applied. Total rules applied 768 place count 298 transition count 500
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 772 place count 294 transition count 496
Iterating global reduction 6 with 4 rules applied. Total rules applied 776 place count 294 transition count 496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 780 place count 294 transition count 492
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 794 place count 294 transition count 478
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 797 place count 294 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 293 transition count 477
Applied a total of 798 rules in 253 ms. Remains 293 /729 variables (removed 436) and now considering 477/956 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 293/729 places, 477/956 transitions.
RANDOM walk for 40000 steps (738 resets) in 1337 ms. (29 steps per ms) remains 21/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (9 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 13/13 properties
[2024-05-22 23:11:35] [INFO ] Flow matrix only has 458 transitions (discarded 19 similar events)
// Phase 1: matrix 458 rows 293 cols
[2024-05-22 23:11:35] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 23:11:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 252/277 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 454/731 variables, 277/289 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/731 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/731 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 20/751 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/751 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/751 variables, and 308 constraints, problems are : Problem set: 0 solved, 13 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 293/293 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 252/277 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 143 places in 76 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 144 places in 77 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 145 places in 74 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 146 places in 73 ms of which 4 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 144 places in 77 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 149 places in 79 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 147 places in 71 ms of which 2 ms to minimize.
[2024-05-22 23:11:36] [INFO ] Deduced a trap composed of 145 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 23:11:37] [INFO ] Deduced a trap composed of 141 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 454/731 variables, 277/299 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 20/751 variables, 16/325 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/751 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 751/751 variables, and 331 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 293/293 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
After SMT, in 2729ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 11 properties in 2263 ms.
Support contains 12 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 477/477 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 293 transition count 464
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 280 transition count 464
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 26 place count 280 transition count 459
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 275 transition count 459
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 61 place count 250 transition count 434
Iterating global reduction 2 with 25 rules applied. Total rules applied 86 place count 250 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 250 transition count 433
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 248 transition count 431
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 248 transition count 431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 248 transition count 429
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 121 place count 234 transition count 414
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 129 place count 234 transition count 406
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 139 place count 224 transition count 396
Iterating global reduction 5 with 10 rules applied. Total rules applied 149 place count 224 transition count 396
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 159 place count 224 transition count 386
Free-agglomeration rule applied 13 times with reduction of 4 identical transitions.
Iterating global reduction 6 with 13 rules applied. Total rules applied 172 place count 224 transition count 369
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 187 place count 211 transition count 367
Discarding 35 places :
Symmetric choice reduction at 7 with 35 rule applications. Total rules 222 place count 176 transition count 332
Iterating global reduction 7 with 35 rules applied. Total rules applied 257 place count 176 transition count 332
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 292 place count 176 transition count 297
Applied a total of 292 rules in 83 ms. Remains 176 /293 variables (removed 117) and now considering 297/477 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 176/293 places, 297/477 transitions.
RANDOM walk for 40000 steps (295 resets) in 247 ms. (161 steps per ms) remains 1/2 properties
BEST_FIRST walk for 36862 steps (14 resets) in 23 ms. (1535 steps per ms) remains 0/1 properties
[2024-05-22 23:11:40] [INFO ] Flatten gal took : 36 ms
[2024-05-22 23:11:40] [INFO ] Flatten gal took : 45 ms
[2024-05-22 23:11:40] [INFO ] Input system was already deterministic with 956 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Graph (trivial) has 674 edges and 729 vertex of which 67 / 729 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 672 transition count 818
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 592 transition count 818
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 161 place count 592 transition count 777
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 243 place count 551 transition count 777
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 329 place count 465 transition count 691
Iterating global reduction 2 with 86 rules applied. Total rules applied 415 place count 465 transition count 691
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 424 place count 465 transition count 682
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 424 place count 465 transition count 679
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 430 place count 462 transition count 679
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 459 place count 433 transition count 650
Iterating global reduction 3 with 29 rules applied. Total rules applied 488 place count 433 transition count 650
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 517 place count 433 transition count 621
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 599 place count 392 transition count 580
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 607 place count 384 transition count 572
Iterating global reduction 4 with 8 rules applied. Total rules applied 615 place count 384 transition count 572
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 623 place count 384 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 635 place count 384 transition count 552
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 637 place count 382 transition count 550
Applied a total of 637 rules in 142 ms. Remains 382 /729 variables (removed 347) and now considering 550/956 (removed 406) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 143 ms. Remains : 382/729 places, 550/956 transitions.
[2024-05-22 23:11:41] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:41] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:41] [INFO ] Input system was already deterministic with 550 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Graph (trivial) has 689 edges and 729 vertex of which 73 / 729 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 667 transition count 813
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 587 transition count 813
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 161 place count 587 transition count 772
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 243 place count 546 transition count 772
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 331 place count 458 transition count 684
Iterating global reduction 2 with 88 rules applied. Total rules applied 419 place count 458 transition count 684
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 428 place count 458 transition count 675
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 428 place count 458 transition count 673
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 432 place count 456 transition count 673
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 461 place count 427 transition count 644
Iterating global reduction 3 with 29 rules applied. Total rules applied 490 place count 427 transition count 644
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 518 place count 427 transition count 616
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 592 place count 390 transition count 579
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 601 place count 381 transition count 570
Iterating global reduction 4 with 9 rules applied. Total rules applied 610 place count 381 transition count 570
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 619 place count 381 transition count 561
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 631 place count 381 transition count 549
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 633 place count 379 transition count 547
Applied a total of 633 rules in 119 ms. Remains 379 /729 variables (removed 350) and now considering 547/956 (removed 409) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 119 ms. Remains : 379/729 places, 547/956 transitions.
[2024-05-22 23:11:41] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:41] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:41] [INFO ] Input system was already deterministic with 547 transitions.
RANDOM walk for 40000 steps (2104 resets) in 697 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (28 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1169514 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 1169514 steps, saw 219743 distinct states, run finished after 3004 ms. (steps per millisecond=389 ) properties seen :0
[2024-05-22 23:11:44] [INFO ] Flow matrix only has 536 transitions (discarded 11 similar events)
// Phase 1: matrix 536 rows 379 cols
[2024-05-22 23:11:44] [INFO ] Computed 14 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/71 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 445/516 variables, 57/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 299/815 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/815 variables, 211/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 99/914 variables, 88/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/914 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/914 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 914/915 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/71 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 445/516 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 299/815 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 211/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/815 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 99/914 variables, 88/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/914 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/914 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 914/915 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
FORMULA FlexibleBarrier-PT-12b-CTLFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Graph (trivial) has 557 edges and 729 vertex of which 73 / 729 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 667 transition count 820
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 594 transition count 820
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 147 place count 594 transition count 771
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 245 place count 545 transition count 771
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 331 place count 459 transition count 685
Iterating global reduction 2 with 86 rules applied. Total rules applied 417 place count 459 transition count 685
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 426 place count 459 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 426 place count 459 transition count 675
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 458 transition count 675
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 456 place count 430 transition count 647
Iterating global reduction 3 with 28 rules applied. Total rules applied 484 place count 430 transition count 647
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 512 place count 430 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 586 place count 393 transition count 582
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 594 place count 385 transition count 574
Iterating global reduction 4 with 8 rules applied. Total rules applied 602 place count 385 transition count 574
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 610 place count 385 transition count 566
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 612 place count 383 transition count 564
Applied a total of 612 rules in 83 ms. Remains 383 /729 variables (removed 346) and now considering 564/956 (removed 392) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 383/729 places, 564/956 transitions.
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 23 ms
[2024-05-22 23:11:45] [INFO ] Input system was already deterministic with 564 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 665 transition count 892
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 665 transition count 892
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 134 place count 665 transition count 886
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 183 place count 616 transition count 837
Iterating global reduction 1 with 49 rules applied. Total rules applied 232 place count 616 transition count 837
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 256 place count 616 transition count 813
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 275 place count 597 transition count 794
Iterating global reduction 2 with 19 rules applied. Total rules applied 294 place count 597 transition count 794
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 307 place count 597 transition count 781
Applied a total of 307 rules in 46 ms. Remains 597 /729 variables (removed 132) and now considering 781/956 (removed 175) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 597/729 places, 781/956 transitions.
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 21 ms
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 22 ms
[2024-05-22 23:11:45] [INFO ] Input system was already deterministic with 781 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 663 transition count 890
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 663 transition count 890
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 663 transition count 881
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 190 place count 614 transition count 832
Iterating global reduction 1 with 49 rules applied. Total rules applied 239 place count 614 transition count 832
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 261 place count 614 transition count 810
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 280 place count 595 transition count 791
Iterating global reduction 2 with 19 rules applied. Total rules applied 299 place count 595 transition count 791
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 311 place count 595 transition count 779
Applied a total of 311 rules in 56 ms. Remains 595 /729 variables (removed 134) and now considering 779/956 (removed 177) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 595/729 places, 779/956 transitions.
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:11:45] [INFO ] Input system was already deterministic with 779 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Graph (trivial) has 687 edges and 729 vertex of which 73 / 729 are part of one of the 12 SCC in 0 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 667 transition count 815
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 589 transition count 815
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 157 place count 589 transition count 772
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 243 place count 546 transition count 772
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 330 place count 459 transition count 685
Iterating global reduction 2 with 87 rules applied. Total rules applied 417 place count 459 transition count 685
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 426 place count 459 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 426 place count 459 transition count 675
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 458 transition count 675
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 457 place count 429 transition count 646
Iterating global reduction 3 with 29 rules applied. Total rules applied 486 place count 429 transition count 646
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 515 place count 429 transition count 617
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 591 place count 391 transition count 579
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 600 place count 382 transition count 570
Iterating global reduction 4 with 9 rules applied. Total rules applied 609 place count 382 transition count 570
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 618 place count 382 transition count 561
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 630 place count 382 transition count 549
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 632 place count 380 transition count 547
Applied a total of 632 rules in 110 ms. Remains 380 /729 variables (removed 349) and now considering 547/956 (removed 409) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 110 ms. Remains : 380/729 places, 547/956 transitions.
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:11:45] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:11:45] [INFO ] Input system was already deterministic with 547 transitions.
RANDOM walk for 40000 steps (2113 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1019868 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 1
Probabilistic random walk after 1019868 steps, saw 235036 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
[2024-05-22 23:11:48] [INFO ] Flow matrix only has 536 transitions (discarded 11 similar events)
// Phase 1: matrix 536 rows 380 cols
[2024-05-22 23:11:48] [INFO ] Computed 14 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 312/684 variables, 144/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 108/792 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 120/912 variables, 108/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/912 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/915 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/915 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/915 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/915 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 915/916 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 246/372 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 312/684 variables, 144/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 108/792 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/912 variables, 108/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/915 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/915 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/915 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/915 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 915/916 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 283 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
FORMULA FlexibleBarrier-PT-12b-CTLFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 665 transition count 892
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 665 transition count 892
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 665 transition count 883
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 183 place count 619 transition count 837
Iterating global reduction 1 with 46 rules applied. Total rules applied 229 place count 619 transition count 837
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 253 place count 619 transition count 813
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 269 place count 603 transition count 797
Iterating global reduction 2 with 16 rules applied. Total rules applied 285 place count 603 transition count 797
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 295 place count 603 transition count 787
Applied a total of 295 rules in 42 ms. Remains 603 /729 variables (removed 126) and now considering 787/956 (removed 169) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 603/729 places, 787/956 transitions.
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:49] [INFO ] Input system was already deterministic with 787 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 662 transition count 889
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 662 transition count 889
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 141 place count 662 transition count 882
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 193 place count 610 transition count 830
Iterating global reduction 1 with 52 rules applied. Total rules applied 245 place count 610 transition count 830
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 269 place count 610 transition count 806
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 289 place count 590 transition count 786
Iterating global reduction 2 with 20 rules applied. Total rules applied 309 place count 590 transition count 786
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 322 place count 590 transition count 773
Applied a total of 322 rules in 39 ms. Remains 590 /729 variables (removed 139) and now considering 773/956 (removed 183) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 590/729 places, 773/956 transitions.
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:49] [INFO ] Input system was already deterministic with 773 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 665 transition count 892
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 665 transition count 892
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 137 place count 665 transition count 883
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 184 place count 618 transition count 836
Iterating global reduction 1 with 47 rules applied. Total rules applied 231 place count 618 transition count 836
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 252 place count 618 transition count 815
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 270 place count 600 transition count 797
Iterating global reduction 2 with 18 rules applied. Total rules applied 288 place count 600 transition count 797
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 299 place count 600 transition count 786
Applied a total of 299 rules in 38 ms. Remains 600 /729 variables (removed 129) and now considering 786/956 (removed 170) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 600/729 places, 786/956 transitions.
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:49] [INFO ] Input system was already deterministic with 786 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 659 transition count 886
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 659 transition count 886
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 148 place count 659 transition count 878
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 201 place count 606 transition count 825
Iterating global reduction 1 with 53 rules applied. Total rules applied 254 place count 606 transition count 825
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 279 place count 606 transition count 800
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 299 place count 586 transition count 780
Iterating global reduction 2 with 20 rules applied. Total rules applied 319 place count 586 transition count 780
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 332 place count 586 transition count 767
Applied a total of 332 rules in 39 ms. Remains 586 /729 variables (removed 143) and now considering 767/956 (removed 189) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 586/729 places, 767/956 transitions.
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:49] [INFO ] Input system was already deterministic with 767 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 660 transition count 887
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 660 transition count 887
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 147 place count 660 transition count 878
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 198 place count 609 transition count 827
Iterating global reduction 1 with 51 rules applied. Total rules applied 249 place count 609 transition count 827
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 273 place count 609 transition count 803
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 292 place count 590 transition count 784
Iterating global reduction 2 with 19 rules applied. Total rules applied 311 place count 590 transition count 784
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 323 place count 590 transition count 772
Applied a total of 323 rules in 39 ms. Remains 590 /729 variables (removed 139) and now considering 772/956 (removed 184) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 590/729 places, 772/956 transitions.
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:49] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:49] [INFO ] Input system was already deterministic with 772 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 664 transition count 891
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 664 transition count 891
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 664 transition count 882
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 188 place count 615 transition count 833
Iterating global reduction 1 with 49 rules applied. Total rules applied 237 place count 615 transition count 833
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 261 place count 615 transition count 809
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 279 place count 597 transition count 791
Iterating global reduction 2 with 18 rules applied. Total rules applied 297 place count 597 transition count 791
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 309 place count 597 transition count 779
Applied a total of 309 rules in 76 ms. Remains 597 /729 variables (removed 132) and now considering 779/956 (removed 177) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 597/729 places, 779/956 transitions.
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 23 ms
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:11:50] [INFO ] Input system was already deterministic with 779 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 672 transition count 899
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 672 transition count 899
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 121 place count 672 transition count 892
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 163 place count 630 transition count 850
Iterating global reduction 1 with 42 rules applied. Total rules applied 205 place count 630 transition count 850
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 222 place count 630 transition count 833
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 239 place count 613 transition count 816
Iterating global reduction 2 with 17 rules applied. Total rules applied 256 place count 613 transition count 816
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 267 place count 613 transition count 805
Applied a total of 267 rules in 70 ms. Remains 613 /729 variables (removed 116) and now considering 805/956 (removed 151) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 613/729 places, 805/956 transitions.
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:11:50] [INFO ] Input system was already deterministic with 805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 659 transition count 886
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 659 transition count 886
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 149 place count 659 transition count 877
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 201 place count 607 transition count 825
Iterating global reduction 1 with 52 rules applied. Total rules applied 253 place count 607 transition count 825
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 278 place count 607 transition count 800
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 297 place count 588 transition count 781
Iterating global reduction 2 with 19 rules applied. Total rules applied 316 place count 588 transition count 781
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 328 place count 588 transition count 769
Applied a total of 328 rules in 64 ms. Remains 588 /729 variables (removed 141) and now considering 769/956 (removed 187) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 588/729 places, 769/956 transitions.
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:11:50] [INFO ] Input system was already deterministic with 769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 664 transition count 891
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 664 transition count 891
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 138 place count 664 transition count 883
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 186 place count 616 transition count 835
Iterating global reduction 1 with 48 rules applied. Total rules applied 234 place count 616 transition count 835
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 256 place count 616 transition count 813
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 273 place count 599 transition count 796
Iterating global reduction 2 with 17 rules applied. Total rules applied 290 place count 599 transition count 796
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 302 place count 599 transition count 784
Applied a total of 302 rules in 37 ms. Remains 599 /729 variables (removed 130) and now considering 784/956 (removed 172) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 599/729 places, 784/956 transitions.
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:11:50] [INFO ] Input system was already deterministic with 784 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 729/729 places, 956/956 transitions.
Graph (trivial) has 687 edges and 729 vertex of which 67 / 729 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 672 transition count 818
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 592 transition count 818
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 161 place count 592 transition count 776
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 245 place count 550 transition count 776
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 331 place count 464 transition count 690
Iterating global reduction 2 with 86 rules applied. Total rules applied 417 place count 464 transition count 690
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 426 place count 464 transition count 681
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 426 place count 464 transition count 678
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 432 place count 461 transition count 678
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 461 place count 432 transition count 649
Iterating global reduction 3 with 29 rules applied. Total rules applied 490 place count 432 transition count 649
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 519 place count 432 transition count 620
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 599 place count 392 transition count 580
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 607 place count 384 transition count 572
Iterating global reduction 4 with 8 rules applied. Total rules applied 615 place count 384 transition count 572
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 623 place count 384 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 635 place count 384 transition count 552
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 636 place count 384 transition count 552
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 638 place count 382 transition count 550
Applied a total of 638 rules in 114 ms. Remains 382 /729 variables (removed 347) and now considering 550/956 (removed 406) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 382/729 places, 550/956 transitions.
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:11:50] [INFO ] Input system was already deterministic with 550 transitions.
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:11:50] [INFO ] Flatten gal took : 19 ms
[2024-05-22 23:11:50] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-22 23:11:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 729 places, 956 transitions and 2765 arcs took 10 ms.
Total runtime 88538 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-12b

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 687
MODEL NAME: /home/mcc/execution/413/model
729 places, 956 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716420400987

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640600700074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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