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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 23:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 12 23:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 23:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 23:53 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-d0m040-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716792128222

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-d0m040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:42:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:42:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:42:09] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-27 06:42:09] [INFO ] Transformed 385 places.
[2024-05-27 06:42:09] [INFO ] Transformed 59 transitions.
[2024-05-27 06:42:09] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 47 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 53 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 58
Applied a total of 4 rules in 18 ms. Remains 53 /56 variables (removed 3) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 53 cols
[2024-05-27 06:42:09] [INFO ] Computed 3 invariants in 9 ms
[2024-05-27 06:42:09] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-27 06:42:09] [INFO ] Invariant cache hit.
[2024-05-27 06:42:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-27 06:42:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-27 06:42:09] [INFO ] Invariant cache hit.
[2024-05-27 06:42:09] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/111 variables, 53/56 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 26/82 constraints. Problems are: Problem set: 5 solved, 52 unsolved
[2024-05-27 06:42:10] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 83 constraints, problems are : Problem set: 5 solved, 52 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 58/111 variables, 53/57 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 26/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 52/135 constraints. Problems are: Problem set: 7 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/135 constraints. Problems are: Problem set: 7 solved, 50 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/135 constraints. Problems are: Problem set: 7 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 135 constraints, problems are : Problem set: 7 solved, 50 unsolved in 1209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 52/57 constraints, Known Traps: 1/1 constraints]
After SMT, in 2398ms problems are : Problem set: 7 solved, 50 unsolved
Search for dead transitions found 7 dead transitions in 2411ms
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 : 53/56 places, 51/59 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 50
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 1 rules in 1 ms. Remains 52 /53 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 52 cols
[2024-05-27 06:42:12] [INFO ] Computed 8 invariants in 3 ms
[2024-05-27 06:42:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 06:42:12] [INFO ] Invariant cache hit.
[2024-05-27 06:42:12] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-27 06:42:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/56 places, 50/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2767 ms. Remains : 52/56 places, 50/59 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Support contains 42 out of 47 places after structural reductions.
[2024-05-27 06:42:12] [INFO ] Flatten gal took : 20 ms
[2024-05-27 06:42:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 06:42:12] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 40 out of 47 places (down from 42) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 41 to 37
RANDOM walk for 40000 steps (8546 resets) in 1640 ms. (24 steps per ms) remains 13/37 properties
BEST_FIRST walk for 40003 steps (3724 resets) in 307 ms. (129 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (1944 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3690 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (2066 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1844 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1926 resets) in 183 ms. (217 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (3759 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2196 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
// Phase 1: matrix 50 rows 47 cols
[2024-05-27 06:42:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 06:42:13] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/36 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/43 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 48/91 variables, 43/46 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 21/67 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/67 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 8 (OVERLAPS) 6/97 variables, 4/71 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 2/73 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/73 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/97 variables, 0/73 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 73 constraints, problems are : Problem set: 5 solved, 4 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-27 06:42:13] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 7/37 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 42/79 variables, 37/41 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 15/56 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/57 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 18/97 variables, 10/67 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 8/75 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 3/78 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 0/78 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/97 variables, 0/78 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 78 constraints, problems are : Problem set: 5 solved, 4 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 303ms problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 720 ms.
Support contains 12 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 121 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 44 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 44 transition count 48
Applied a total of 5 rules in 16 ms. Remains 44 /47 variables (removed 3) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 44/47 places, 48/50 transitions.
RANDOM walk for 40000 steps (8576 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3678 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3768 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3760 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 463 steps, run visited all 3 properties in 12 ms. (steps per millisecond=38 )
Probabilistic random walk after 463 steps, saw 249 distinct states, run finished after 18 ms. (steps per millisecond=25 ) properties seen :3
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:42:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 11 ms
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 6 ms
[2024-05-27 06:42:14] [INFO ] Input system was already deterministic with 50 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 141 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 42 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:14] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 43 transition count 47
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 47
Applied a total of 7 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 47/50 transitions.
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:14] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 43 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 45
Applied a total of 7 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 45/50 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 45/50 transitions.
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:14] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 141 edges and 47 vertex of which 46 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 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 6 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:14] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 141 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 44 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 44 transition count 48
Applied a total of 5 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 44/47 places, 48/50 transitions.
[2024-05-27 06:42:14] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 44 transition count 48
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 44 transition count 48
Applied a total of 5 rules in 3 ms. Remains 44 /47 variables (removed 3) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/47 places, 48/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 141 edges and 47 vertex of which 46 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 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 5 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 42 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 42 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 141 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 43 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 43 transition count 47
Applied a total of 7 rules in 5 ms. Remains 43 /47 variables (removed 4) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 43/47 places, 47/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 141 edges and 47 vertex of which 46 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 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 4 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 43 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 45
Applied a total of 7 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 45/50 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 45/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 141 edges and 47 vertex of which 46 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 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 44
Applied a total of 9 rules in 4 ms. Remains 42 /47 variables (removed 5) and now considering 44/50 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/47 places, 44/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 43 transition count 47
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 47
Applied a total of 7 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 47/50 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:42:15] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-27 06:42:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 50 transitions and 195 arcs took 1 ms.
Total runtime 5789 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d0m040

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 556
MODEL NAME: /home/mcc/execution/412/model
47 places, 50 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-d0m040-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716792151114

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

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