About the Execution of GreatSPN+red for RingSingleMessageInMbox-PT-d0m080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2433.968 | 133376.00 | 435424.00 | 193.70 | TTTTTTFTFTFTFFTF | 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.r333-tall-171679077600042.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 RingSingleMessageInMbox-PT-d0m080, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600042
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 23:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716792203140
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:43:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:43:24] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-27 06:43:24] [INFO ] Transformed 385 places.
[2024-05-27 06:43:24] [INFO ] Transformed 59 transitions.
[2024-05-27 06:43:24] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 48 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 13 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2024-05-27 06:43:24] [INFO ] Computed 3 invariants in 9 ms
[2024-05-27 06:43:24] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-27 06:43:24] [INFO ] Invariant cache hit.
[2024-05-27 06:43:24] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:43:24] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-27 06:43:24] [INFO ] Invariant cache hit.
[2024-05-27 06:43:24] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 84 constraints, problems are : Problem set: 5 solved, 53 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 53/137 constraints. Problems are: Problem set: 7 solved, 51 unsolved
[2024-05-27 06:43:26] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 8 ms to minimize.
[2024-05-27 06:43:26] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 139 constraints, problems are : Problem set: 7 solved, 51 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 53/58 constraints, Known Traps: 2/2 constraints]
After SMT, in 2571ms problems are : Problem set: 7 solved, 51 unsolved
Search for dead transitions found 7 dead transitions in 2585ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 52/59 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 53 /54 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-05-27 06:43:27] [INFO ] Computed 8 invariants in 4 ms
[2024-05-27 06:43:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 06:43:27] [INFO ] Invariant cache hit.
[2024-05-27 06:43:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 06:43:27] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/56 places, 51/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2986 ms. Remains : 53/56 places, 51/59 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Support contains 43 out of 48 places after structural reductions.
[2024-05-27 06:43:27] [INFO ] Flatten gal took : 21 ms
[2024-05-27 06:43:27] [INFO ] Flatten gal took : 8 ms
[2024-05-27 06:43:27] [INFO ] Input system was already deterministic with 51 transitions.
Reduction of identical properties reduced properties to check from 43 to 41
RANDOM walk for 40000 steps (8590 resets) in 2430 ms. (16 steps per ms) remains 20/41 properties
BEST_FIRST walk for 4003 steps (186 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (388 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (196 resets) in 18 ms. (210 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (231 resets) in 30 ms. (129 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4001 steps (197 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (222 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (205 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (287 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (191 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (182 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (114 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (617 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (196 resets) in 28 ms. (138 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4000 steps (800 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (391 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (122 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (404 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 06:43:28] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 06:43:28] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/37 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/42 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 47/89 variables, 42/45 constraints. Problems are: Problem set: 6 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 20/65 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 6 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 8 (OVERLAPS) 10/99 variables, 6/71 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 4/75 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/75 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/75 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 75 constraints, problems are : Problem set: 8 solved, 8 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 17/30 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 8 unsolved
[2024-05-27 06:43:28] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 7/37 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 39/76 variables, 37/41 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 12/53 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/54 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 22/98 variables, 10/64 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 12/76 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 7/83 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/83 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1/99 variables, 1/84 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/99 variables, 0/84 constraints. Problems are: Problem set: 8 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 84 constraints, problems are : Problem set: 8 solved, 8 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 8/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 484ms problems are : Problem set: 8 solved, 8 unsolved
Parikh walk visited 0 properties in 5479 ms.
Support contains 13 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 45 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 45 transition count 45
Applied a total of 6 rules in 26 ms. Remains 45 /48 variables (removed 3) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 45/48 places, 45/51 transitions.
RANDOM walk for 40000 steps (8673 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2038 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1993 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1931 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2805 resets) in 64 ms. (615 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (1967 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3763 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
// Phase 1: matrix 45 rows 45 cols
[2024-05-27 06:43:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 06:43:35] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/69 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 20/89 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 66 constraints, problems are : Problem set: 0 solved, 4 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/69 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 20/89 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/90 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 70 constraints, problems are : Problem set: 0 solved, 4 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 1719 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 44 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 44
Applied a total of 2 rules in 18 ms. Remains 44 /45 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 44/45 places, 44/45 transitions.
RANDOM walk for 40000 steps (8690 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1982 resets) in 54 ms. (727 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (2996 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
// Phase 1: matrix 44 rows 44 cols
[2024-05-27 06:43:37] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 06:43:37] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/68 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/87 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/88 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/68 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/87 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/88 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 44/44 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 44/44 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 43
Applied a total of 2 rules in 4 ms. Remains 43 /44 variables (removed 1) and now considering 43/44 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 43/44 places, 43/44 transitions.
RANDOM walk for 40000 steps (8692 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2925 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3864015 steps, run timeout after 3001 ms. (steps per millisecond=1287 ) properties seen :0 out of 1
Probabilistic random walk after 3864015 steps, saw 1473722 distinct states, run finished after 3004 ms. (steps per millisecond=1286 ) properties seen :0
// Phase 1: matrix 43 rows 43 cols
[2024-05-27 06:43:40] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 06:43:40] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 36/66 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/85 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/86 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/66 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/85 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/86 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 43/43 places, 43/43 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-27 06:43:40] [INFO ] Invariant cache hit.
[2024-05-27 06:43:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 06:43:40] [INFO ] Invariant cache hit.
[2024-05-27 06:43:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-27 06:43:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-27 06:43:40] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-27 06:43:40] [INFO ] Invariant cache hit.
[2024-05-27 06:43:40] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-27 06:43:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 64 constraints, problems are : Problem set: 0 solved, 42 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/86 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 42/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 42 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
After SMT, in 1141ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 43/43 places, 43/43 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 43 transition count 36
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 37 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 21 place count 33 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 32 transition count 32
Applied a total of 23 rules in 13 ms. Remains 32 /43 variables (removed 11) and now considering 32/43 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 32 cols
[2024-05-27 06:43:41] [INFO ] Computed 4 invariants in 0 ms
[2024-05-27 06:43:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-27 06:43:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-27 06:43:41] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 06:43:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 06:43:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 06:43:41] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 06:43:41] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 06:43:41] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 132 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:43:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:43:41] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:41] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 1 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:41] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 48
Applied a total of 7 rules in 1 ms. Remains 44 /48 variables (removed 4) and now considering 48/51 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/48 places, 48/51 transitions.
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 10 ms
[2024-05-27 06:43:41] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 9 ms
[2024-05-27 06:43:41] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 45 transition count 49
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 45 transition count 49
Applied a total of 5 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 49/51 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 49/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 47/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 46 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 50
Applied a total of 3 rules in 1 ms. Remains 46 /48 variables (removed 2) and now considering 50/51 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 46/48 places, 50/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 5 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 48
Applied a total of 7 rules in 1 ms. Remains 44 /48 variables (removed 4) and now considering 48/51 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/48 places, 48/51 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:43:42] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:43:42] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-27 06:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 51 transitions and 199 arcs took 3 ms.
Total runtime 18032 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running RingSingleMessageInMbox-PT-d0m080
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 48
TRANSITIONS: 51
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 615
MODEL NAME: /home/mcc/execution/411/model
48 places, 51 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m080-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716792336516
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d0m080"
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 RingSingleMessageInMbox-PT-d0m080, 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 r333-tall-171679077600042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m080.tgz
mv RingSingleMessageInMbox-PT-d0m080 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 '
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 ;