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-171662337600017.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-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 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.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 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 72K 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-10-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717217951201

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:59:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:12] [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:59:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:59:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 620 ms
[2024-06-01 04:59:13] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-06-01 04:59:13] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-06-01 04:59:13] [INFO ] Skeletonized 16 HLPN properties in 4 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 1 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 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 40005 steps (2225 resets) in 1950 ms. (20 steps per ms) remains 51/85 properties
BEST_FIRST walk for 4001 steps (86 resets) in 74 ms. (53 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (67 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (64 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (83 resets) in 74 ms. (53 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (108 resets) in 72 ms. (54 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4005 steps (55 resets) in 50 ms. (78 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (84 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (83 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4005 steps (80 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (83 resets) in 40 ms. (97 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (120 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (82 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (81 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (80 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (82 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (81 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (80 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (83 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (83 resets) in 41 ms. (95 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4005 steps (83 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (82 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (80 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (83 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (64 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (88 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (88 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (83 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (82 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4005 steps (120 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (63 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (80 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (85 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (55 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (128 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (83 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (85 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (90 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (82 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (64 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (90 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (80 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (92 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4006 steps (57 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (82 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (84 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (84 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (120 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4005 steps (83 resets) in 14 ms. (267 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (83 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 04:59:14] [INFO ] Computed 5 invariants in 7 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp82 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 29 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/5 constraints. Problems are: Problem set: 36 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 15 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/55 variables, 29/34 constraints. Problems are: Problem set: 43 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 43 solved, 8 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/56 variables, 1/35 constraints. Problems are: Problem set: 44 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 44 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 44 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 44 solved, 7 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 5/5 constraints. Problems are: Problem set: 44 solved, 7 unsolved
[2024-06-01 04:59:15] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 44 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 44 solved, 7 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/53 variables, 27/33 constraints. Problems are: Problem set: 46 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/34 constraints. Problems are: Problem set: 46 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/34 constraints. Problems are: Problem set: 46 solved, 5 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 7 (OVERLAPS) 3/56 variables, 3/37 constraints. Problems are: Problem set: 49 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 1/38 constraints. Problems are: Problem set: 49 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 49 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 49 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 49 solved, 2 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 666ms problems are : Problem set: 49 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 72 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 2 properties in 5 ms.
Successfully simplified 49 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:15] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 04:59:15] [INFO ] Flatten gal took : 17 ms
[2024-06-01 04:59:15] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 04:59:15] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:59:15] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 17 ms.
[2024-06-01 04:59:15] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 537 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 176
Applied a total of 1 rules in 13 ms. Remains 549 /550 variables (removed 1) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 549 cols
[2024-06-01 04:59:15] [INFO ] Computed 374 invariants in 35 ms
[2024-06-01 04:59:15] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-06-01 04:59:15] [INFO ] Invariant cache hit.
[2024-06-01 04:59:16] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 04:59:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 15/538 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 11/549 variables, 122/374 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 176/725 variables, 549/923 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/725 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 923 constraints, problems are : Problem set: 0 solved, 164 unsolved in 13374 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 15/538 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 11/549 variables, 122/374 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 176/725 variables, 549/923 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 164/1087 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/725 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 1087 constraints, problems are : Problem set: 0 solved, 164 unsolved in 15038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 28642ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 28649ms
Starting structural reductions in LTL mode, iteration 1 : 549/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29404 ms. Remains : 549/550 places, 176/176 transitions.
Support contains 537 out of 549 places after structural reductions.
[2024-06-01 04:59:44] [INFO ] Flatten gal took : 38 ms
[2024-06-01 04:59:44] [INFO ] Flatten gal took : 28 ms
[2024-06-01 04:59:44] [INFO ] Input system was already deterministic with 176 transitions.
RANDOM walk for 40000 steps (2772 resets) in 2073 ms. (19 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (32 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (33 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (34 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (40 resets) in 72 ms. (54 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (32 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (33 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (37 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (40 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 481733 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :14 out of 36
Probabilistic random walk after 481733 steps, saw 69020 distinct states, run finished after 3016 ms. (steps per millisecond=159 ) properties seen :14
[2024-06-01 04:59:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/373 variables, 2/12 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 220/232 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/232 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 154/527 variables, 132/364 constraints. Problems are: Problem set: 9 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/364 constraints. Problems are: Problem set: 9 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 7 (OVERLAPS) 176/703 variables, 527/891 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 0/891 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 22/725 variables, 22/913 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 10/923 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/923 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/725 variables, 0/923 constraints. Problems are: Problem set: 19 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/725 variables, and 923 constraints, problems are : Problem set: 19 solved, 3 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/163 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 56/219 variables, 111/112 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/112 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/241 variables, 1/113 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/113 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 242/483 variables, 231/344 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/344 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 176/659 variables, 483/827 constraints. Problems are: Problem set: 19 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 0/827 constraints. Problems are: Problem set: 19 solved, 3 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 11 (OVERLAPS) 66/725 variables, 66/893 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 30/923 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/725 variables, 1/924 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/725 variables, 0/924 constraints. Problems are: Problem set: 21 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/725 variables, 0/924 constraints. Problems are: Problem set: 21 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/725 variables, and 924 constraints, problems are : Problem set: 21 solved, 1 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 2022ms problems are : Problem set: 21 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 21 atomic propositions for a total of 7 simplifications.
[2024-06-01 04:59:50] [INFO ] Flatten gal took : 22 ms
[2024-06-01 04:59:50] [INFO ] Flatten gal took : 23 ms
[2024-06-01 04:59:50] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 530 out of 549 places (down from 531) after GAL structural reductions.
Computed a total of 549 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 549 transition count 176
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 1 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 524 transition count 176
Applied a total of 25 rules in 42 ms. Remains 524 /549 variables (removed 25) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 524/549 places, 176/176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:59:51] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 536 transition count 176
Applied a total of 13 rules in 12 ms. Remains 536 /549 variables (removed 13) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 536/549 places, 176/176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 18 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:59:51] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 549/549 places, 176/176 transitions.
Graph (complete) has 2333 edges and 549 vertex of which 382 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.5 ms
Discarding 167 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 382 transition count 133
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 382 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 381 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 381 transition count 132
Applied a total of 26 rules in 47 ms. Remains 381 /549 variables (removed 168) and now considering 132/176 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 381/549 places, 132/176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 11 ms
[2024-06-01 04:59:51] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 536 transition count 176
Applied a total of 13 rules in 19 ms. Remains 536 /549 variables (removed 13) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 536/549 places, 176/176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 15 ms
[2024-06-01 04:59:51] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 524 transition count 176
Applied a total of 25 rules in 13 ms. Remains 524 /549 variables (removed 25) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 524/549 places, 176/176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:51] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 524 transition count 176
Applied a total of 25 rules in 19 ms. Remains 524 /549 variables (removed 25) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 524/549 places, 176/176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 16 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 13 ms
[2024-06-01 04:59:51] [INFO ] Input system was already deterministic with 176 transitions.
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 14 ms
[2024-06-01 04:59:51] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 04:59:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 549 places, 176 transitions and 1221 arcs took 4 ms.
Total runtime 39202 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-10-CTLCardinality-2024-00
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLCardinality-2024-05
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLCardinality-2024-06
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-COL-10-CTLCardinality-2024-15

BK_STOP 1717217991825

--------------------
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-10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/534/ctl_0_
ctl formula name QuasiCertifProtocol-COL-10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/534/ctl_1_
ctl formula name QuasiCertifProtocol-COL-10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/534/ctl_2_
ctl formula name QuasiCertifProtocol-COL-10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/534/ctl_3_
ctl formula name QuasiCertifProtocol-COL-10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/534/ctl_4_
ctl formula name QuasiCertifProtocol-COL-10-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/534/ctl_5_
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-10"
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-10, 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-171662337600017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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