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.r575-smll-171734919400002.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 MedleyA-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 18K Jun 2 16:33 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 MedleyA-PT-01-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-01-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351382252

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:03:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:03:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:03:05] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-02 18:03:05] [INFO ] Transformed 61 places.
[2024-06-02 18:03:05] [INFO ] Transformed 53 transitions.
[2024-06-02 18:03:05] [INFO ] Found NUPN structural information;
[2024-06-02 18:03:05] [INFO ] Parsed PT model containing 61 places and 53 transitions and 210 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 59 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 21 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-06-02 18:03:05] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 61 cols
[2024-06-02 18:03:05] [INFO ] Computed 20 invariants in 19 ms
[2024-06-02 18:03:06] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-02 18:03:06] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:06] [INFO ] Invariant cache hit.
[2024-06-02 18:03:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 18:03:06] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-02 18:03:06] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:06] [INFO ] Invariant cache hit.
[2024-06-02 18:03:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:07] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 18 ms to minimize.
[2024-06-02 18:03:07] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:03:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 167 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3331 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/166 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:10] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:03:11] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:03:11] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 1/113 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/113 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 222 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3090 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 6514ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 6532ms
Finished structural reductions in LTL mode , in 1 iterations and 7340 ms. Remains : 61/61 places, 53/53 transitions.
Support contains 59 out of 61 places after structural reductions.
[2024-06-02 18:03:13] [INFO ] Flatten gal took : 46 ms
[2024-06-02 18:03:13] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:03:13] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 64 to 58
RANDOM walk for 40000 steps (8 resets) in 4067 ms. (9 steps per ms) remains 13/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
[2024-06-02 18:03:15] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-06-02 18:03:15] [INFO ] Invariant cache hit.
[2024-06-02 18:03:15] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 6/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/61 variables, 14/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 40/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 51/112 variables, 61/142 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 21/163 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 164 constraints, problems are : Problem set: 1 solved, 3 unsolved in 158 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 22/40 variables, 13/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 22/53 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/61 variables, 7/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 21/81 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 51/112 variables, 61/143 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 21/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 3/167 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:03:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 4/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/113 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/113 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 172 constraints, problems are : Problem set: 1 solved, 3 unsolved in 415 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 592ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 4643 steps, including 183 resets, run visited all 3 properties in 55 ms. (steps per millisecond=84 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 63 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:15] [INFO ] Input system was already deterministic with 53 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:03:15] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:15] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:15] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 51
Applied a total of 4 rules in 32 ms. Remains 59 /61 variables (removed 2) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 59/61 places, 51/53 transitions.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:15] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:15] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 51
Applied a total of 4 rules in 9 ms. Remains 59 /61 variables (removed 2) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 59/61 places, 51/53 transitions.
[2024-06-02 18:03:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 61 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 52
Applied a total of 2 rules in 6 ms. Remains 60 /61 variables (removed 1) and now considering 52/53 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 60/61 places, 52/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/61 places, 53/53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:03:16] [INFO ] Input system was already deterministic with 53 transitions.
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:16] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 18:03:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 53 transitions and 210 arcs took 5 ms.
Total runtime 11388 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-01

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: 61
TRANSITIONS: 53
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: 588
MODEL NAME: /home/mcc/execution/412/model
61 places, 53 transitions.

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.
Creating all event NSFs..
Building monolithic NSF...
FORMULA MedleyA-PT-01-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-01-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717351399082

--------------------
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="MedleyA-PT-01"
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 MedleyA-PT-01, 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 r575-smll-171734919400002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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