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

About the Execution of GreatSPN+red for StigmergyElection-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
270.684 6096.00 15123.00 46.70 TTTFTTTTTFFFFTFF 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.r399-tall-171690529900250.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 StigmergyElection-PT-02a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529900250
=====================================================================

--------------------
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 100K 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 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 18:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15K 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 StigmergyElection-PT-02a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717008486140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 18:48:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 18:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:48:07] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-29 18:48:07] [INFO ] Transformed 30 places.
[2024-05-29 18:48:07] [INFO ] Transformed 66 transitions.
[2024-05-29 18:48:07] [INFO ] Found NUPN structural information;
[2024-05-29 18:48:07] [INFO ] Parsed PT model containing 30 places and 66 transitions and 196 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 14 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-29 18:48:07] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 30 cols
[2024-05-29 18:48:07] [INFO ] Computed 3 invariants in 7 ms
[2024-05-29 18:48:07] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-29 18:48:07] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2024-05-29 18:48:07] [INFO ] Invariant cache hit.
[2024-05-29 18:48:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:48:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-29 18:48:07] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2024-05-29 18:48:07] [INFO ] Invariant cache hit.
[2024-05-29 18:48:07] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 8 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 82 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1025 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 1/70 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/70 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 127 constraints, problems are : Problem set: 0 solved, 45 unsolved in 560 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1640ms
Finished structural reductions in LTL mode , in 1 iterations and 1918 ms. Remains : 30/30 places, 46/46 transitions.
Support contains 29 out of 30 places after structural reductions.
[2024-05-29 18:48:09] [INFO ] Flatten gal took : 18 ms
[2024-05-29 18:48:09] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:48:09] [INFO ] Input system was already deterministic with 46 transitions.
Reduction of identical properties reduced properties to check from 42 to 40
RANDOM walk for 40000 steps (944 resets) in 1445 ms. (27 steps per ms) remains 9/40 properties
BEST_FIRST walk for 40004 steps (265 resets) in 283 ms. (140 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (249 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (440 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (419 resets) in 299 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (465 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (261 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (263 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
[2024-05-29 18:48:10] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2024-05-29 18:48:10] [INFO ] Invariant cache hit.
[2024-05-29 18:48:10] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/30 variables, 2/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 16/33 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-29 18:48:11] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 30/70 variables, and 34 constraints, problems are : Problem set: 9 solved, 0 unsolved in 182 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/30 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 201ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2024-05-29 18:48:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 5 ms
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 46 transitions.
Support contains 23 out of 30 places (down from 25) after GAL structural reductions.
Computed a total of 6 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 44
Applied a total of 2 rules in 5 ms. Remains 29 /30 variables (removed 1) and now considering 44/46 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 29/30 places, 44/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 20 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 17 place count 20 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 16 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 14 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 14 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 13 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 13 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 13 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 11 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 11 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 9 transition count 16
Applied a total of 46 rules in 20 ms. Remains 9 /30 variables (removed 21) and now considering 16/46 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 9/30 places, 16/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 24 steps (1 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 24 transition count 38
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 24 transition count 38
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 22 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 22 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 21 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 21 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 21 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 19 transition count 30
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 17 transition count 28
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 17 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 15 transition count 24
Applied a total of 33 rules in 7 ms. Remains 15 /30 variables (removed 15) and now considering 24/46 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 15/30 places, 24/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 42
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 38
Applied a total of 8 rules in 2 ms. Remains 26 /30 variables (removed 4) and now considering 38/46 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 26/30 places, 38/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
Applied a total of 2 rules in 0 ms. Remains 29 /30 variables (removed 1) and now considering 45/46 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 29/30 places, 45/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 37
Applied a total of 10 rules in 1 ms. Remains 25 /30 variables (removed 5) and now considering 37/46 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 25/30 places, 37/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 30 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 44
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 25 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 35
Applied a total of 16 rules in 4 ms. Remains 23 /30 variables (removed 7) and now considering 35/46 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 23/30 places, 35/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 20 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 17 place count 20 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 16 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 14 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 14 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 12 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 12 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 12 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 12 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 10 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 10 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 8 transition count 12
Applied a total of 49 rules in 5 ms. Remains 8 /30 variables (removed 22) and now considering 12/46 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 8/30 places, 12/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 24 steps (2 resets) in 8 ms. (2 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 25 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 25 transition count 40
Applied a total of 12 rules in 5 ms. Remains 25 /30 variables (removed 5) and now considering 40/46 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 25/30 places, 40/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Applied a total of 4 rules in 1 ms. Remains 28 /30 variables (removed 2) and now considering 43/46 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/30 places, 43/46 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:48:11] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-29 18:48:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 46 transitions and 128 arcs took 1 ms.
Total runtime 4046 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-02a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/405/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: 544
MODEL NAME: /home/mcc/execution/405/model
30 places, 46 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717008492236

--------------------
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="StigmergyElection-PT-02a"
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 StigmergyElection-PT-02a, 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 r399-tall-171690529900250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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