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.r520-tall-171662337600001.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 ltsminxred
Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600001
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717217898167

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:19] [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-06-01 04:58:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:58:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 618 ms
[2024-06-01 04:58:20] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
[2024-06-01 04:58:20] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 04:58:20] [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).
Remains 16 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 40000 steps (5296 resets) in 2105 ms. (18 steps per ms) remains 54/85 properties
BEST_FIRST walk for 4002 steps (345 resets) in 59 ms. (66 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (272 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (283 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (271 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (178 resets) in 33 ms. (117 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (180 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (275 resets) in 64 ms. (61 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (277 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (298 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (282 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (284 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (277 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (296 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (225 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (271 resets) in 50 ms. (78 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (285 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (347 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (284 resets) in 37 ms. (105 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (347 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (283 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (283 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (283 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (348 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (279 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (345 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (283 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (159 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (290 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (278 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (276 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (301 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (281 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (284 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (283 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (277 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (280 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (346 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (281 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (282 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (279 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (284 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (177 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (362 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (217 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (275 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (37 resets) in 14 ms. (266 steps per ms) remains 52/54 properties
BEST_FIRST walk for 4002 steps (279 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (280 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (279 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:58:21] [INFO ] Computed 5 invariants in 7 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/30 variables, 4/5 constraints. Problems are: Problem set: 36 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 16 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 51 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 51 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 51 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 4/4 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/5 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 51 solved, 1 unsolved
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Int declared 49/56 variables, and 28 constraints, problems are : Problem set: 52 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/30 constraints, PredecessorRefiner: 0/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 52 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:58:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 04:58:22] [INFO ] Flatten gal took : 21 ms
[2024-06-01 04:58:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:58:22] [INFO ] Flatten gal took : 4 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:58:22] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 9 ms.
[2024-06-01 04:58:22] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 86 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 86 cols
[2024-06-01 04:58:22] [INFO ] Computed 31 invariants in 11 ms
[2024-06-01 04:58:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 04:58:22] [INFO ] Invariant cache hit.
[2024-06-01 04:58:22] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 04:58:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 11/86 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 56/142 variables, 86/117 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 0 solved, 52 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 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, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 11/86 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 13 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 56/142 variables, 86/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 52/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 175 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 2315ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2317ms
Finished structural reductions in LTL mode , in 1 iterations and 2475 ms. Remains : 86/86 places, 56/56 transitions.
Support contains 86 out of 86 places after structural reductions.
[2024-06-01 04:58:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:24] [INFO ] Flatten gal took : 9 ms
[2024-06-01 04:58:24] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6571 resets) in 2343 ms. (17 steps per ms) remains 45/60 properties
BEST_FIRST walk for 4000 steps (264 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (224 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (99 resets) in 21 ms. (182 steps per ms) remains 34/45 properties
BEST_FIRST walk for 4004 steps (100 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (228 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (216 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (211 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (219 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (217 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (221 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (225 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (232 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (264 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (208 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (264 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (223 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (144 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (222 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (228 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (221 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (217 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (223 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (216 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (219 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (217 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (227 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (105 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (264 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (149 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (224 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (230 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (221 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (222 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
[2024-06-01 04:58:25] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp47 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 14/15 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 27 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/77 variables, 6/21 constraints. Problems are: Problem set: 21 solved, 11 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 6/27 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 3/80 variables, 2/29 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 23 solved, 9 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 8 (OVERLAPS) 56/136 variables, 80/109 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/109 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/142 variables, 6/115 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 2/117 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 31 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 6/6 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/8 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/53 variables, 1/9 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 6/15 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 2/17 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/68 variables, 12/29 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 04:58:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 3/32 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 31 solved, 1 unsolved
Problem AtomicPropp54 is UNSAT
After SMT solving in domain Int declared 124/142 variables, and 100 constraints, problems are : Problem set: 32 solved, 0 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/24 constraints, State Equation: 68/86 constraints, PredecessorRefiner: 0/32 constraints, Known Traps: 7/7 constraints]
After SMT, in 489ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 9 simplifications.
[2024-06-01 04:58:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 79 out of 86 places (down from 85) after GAL structural reductions.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 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 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 23 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 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
Applied a total of 15 rules in 17 ms. Remains 22 /86 variables (removed 64) and now considering 19/56 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 22/86 places, 19/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 2 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 79/86 places, 56/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 1 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 79/86 places, 56/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 23 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.0 ms
Discarding 63 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 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 23 transition count 20
Applied a total of 15 rules in 3 ms. Remains 23 /86 variables (removed 63) and now considering 20/56 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 23/86 places, 20/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 2 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 56
Applied a total of 8 rules in 2 ms. Remains 78 /86 variables (removed 8) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/86 places, 56/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 2 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/86 places, 56/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 2 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/86 places, 56/56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 04:58:26] [INFO ] Input system was already deterministic with 56 transitions.
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 04:58:26] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 04:58:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 56 transitions and 223 arcs took 2 ms.
Total runtime 6958 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-01
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-09
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-10
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-14
Could not compute solution for formula : QuasiCertifProtocol-COL-02-CTLCardinality-2024-15

BK_STOP 1717217906626

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/558/ctl_0_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/558/ctl_1_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/558/ctl_2_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/558/ctl_3_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/558/ctl_4_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/558/ctl_5_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/558/ctl_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337600001"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;