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.r311-tall-171662335600002.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 QuasiCertifProtocol-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335600002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K 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 QuasiCertifProtocol-COL-02-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716646321142

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:12:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 14:12:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:12:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2024-05-25 14:12:03] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2024-05-25 14:12:03] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 14:12:03] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 6 formulas.
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40002 steps (5289 resets) in 1510 ms. (26 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40003 steps (2804 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1815 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3332 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:12:03] [INFO ] Computed 5 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/56 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 3 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/56 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 3 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
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 7 ms.
[2024-05-25 14:12:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 14:12:04] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:12:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:12:04] [INFO ] Flatten gal took : 4 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:12:04] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 8 ms.
[2024-05-25 14:12:04] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 76 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 10 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-25 14:12:04] [INFO ] Computed 22 invariants in 9 ms
[2024-05-25 14:12:04] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-25 14:12:04] [INFO ] Invariant cache hit.
[2024-05-25 14:12:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 14:12:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/131 variables, 75/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 98 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1010 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/131 variables, 75/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 52/149 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/132 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 150 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1145 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 2193ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2195ms
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2337 ms. Remains : 76/86 places, 56/56 transitions.
Support contains 76 out of 76 places after structural reductions.
[2024-05-25 14:12:06] [INFO ] Flatten gal took : 9 ms
[2024-05-25 14:12:06] [INFO ] Flatten gal took : 10 ms
[2024-05-25 14:12:06] [INFO ] Input system was already deterministic with 56 transitions.
Reduction of identical properties reduced properties to check from 34 to 31
RANDOM walk for 40000 steps (6559 resets) in 1248 ms. (32 steps per ms) remains 19/31 properties
BEST_FIRST walk for 4002 steps (92 resets) in 58 ms. (67 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (227 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (224 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (229 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (106 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (104 resets) in 14 ms. (266 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4002 steps (226 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (103 resets) in 21 ms. (181 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4003 steps (222 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (224 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (223 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (101 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (221 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (213 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (218 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (264 resets) in 27 ms. (142 steps per ms) remains 14/14 properties
[2024-05-25 14:12:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 2 (OVERLAPS) 55/129 variables, 74/96 constraints. Problems are: Problem set: 2 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/132 variables, 2/98 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 98 constraints, problems are : Problem set: 2 solved, 12 unsolved in 268 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 2/20 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 50/112 variables, 62/82 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 10/92 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 18/130 variables, 13/105 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 2/107 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 2/109 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 2/132 variables, 1/110 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/132 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 110 constraints, problems are : Problem set: 2 solved, 12 unsolved in 599 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 12/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 880ms problems are : Problem set: 2 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 48 steps, including 1 resets, run visited all 6 properties in 1 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 157 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 6 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 7 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 23 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 22 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 22 transition count 19
Applied a total of 16 rules in 19 ms. Remains 22 /76 variables (removed 54) and now considering 19/56 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 22/76 places, 19/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 2 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 6 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 71/76 places, 53/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 71/76 places, 53/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 12 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 29 output transitions
Drop transitions (Output transitions of discarded places.) removed 29 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 12 transition count 10
Applied a total of 18 rules in 1 ms. Remains 12 /76 variables (removed 64) and now considering 10/56 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 12/76 places, 10/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 0 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 0 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 9 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 71/76 places, 53/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 2 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 2 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 34 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 33 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 33 transition count 29
Applied a total of 13 rules in 3 ms. Remains 33 /76 variables (removed 43) and now considering 29/56 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 33/76 places, 29/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 2 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 1 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 29 transitions.
RANDOM walk for 22664 steps (4081 resets) in 180 ms. (125 steps per ms) remains 0/1 properties
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/76 places, 56/56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 14:12:08] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 6 ms
[2024-05-25 14:12:08] [INFO ] Flatten gal took : 6 ms
[2024-05-25 14:12:08] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 24 ms.
[2024-05-25 14:12:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 76 places, 56 transitions and 190 arcs took 2 ms.
Total runtime 6560 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-02

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/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: 550
MODEL NAME: /home/mcc/execution/415/model
76 places, 56 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..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716646330951

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="QuasiCertifProtocol-COL-02"
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 QuasiCertifProtocol-COL-02, 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 r311-tall-171662335600002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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