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.r512-smll-171654407100209.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 Peterson-COL-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K 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 Peterson-COL-3-CTLCardinality-2024-00
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-01
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-02
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-03
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-04
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-05
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-06
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-07
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-08
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-09
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-10
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-11
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-12
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-13
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-14
FORMULA_NAME Peterson-COL-3-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717257517399

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:58:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:58:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:58:40] [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 15:58:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:58:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1358 ms
[2024-06-01 15:58:41] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
[2024-06-01 15:58:41] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-06-01 15:58:41] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (8 resets) in 1832 ms. (21 steps per ms) remains 38/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
// Phase 1: matrix 14 rows 9 cols
[2024-06-01 15:58:43] [INFO ] Computed 1 invariants in 9 ms
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
After SMT solving in domain Real declared 9/23 variables, and 1 constraints, problems are : Problem set: 38 solved, 0 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 38 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 38 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-COL-3-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:58:43] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 15:58:43] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:58:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-COL-3-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:58:43] [INFO ] Flatten gal took : 3 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 15:58:43] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 46 ms.
[2024-06-01 15:58:43] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Support contains 224 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 16 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-06-01 15:58:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-06-01 15:58:43] [INFO ] Computed 15 invariants in 14 ms
[2024-06-01 15:58:43] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 15:58:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 15:58:43] [INFO ] Invariant cache hit.
[2024-06-01 15:58:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 15:58:44] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-01 15:58:44] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 15:58:44] [INFO ] Invariant cache hit.
[2024-06-01 15:58:44] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 51 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:58:48] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 4 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:58:49] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-06-01 15:58:50] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:58:50] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 4 ms to minimize.
[2024-06-01 15:58:50] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:58:50] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:58:50] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 3 ms to minimize.
[2024-06-01 15:58:51] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 4 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 3 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 4 ms to minimize.
[2024-06-01 15:58:52] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 3 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 10 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:58:53] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:58:54] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:58:56] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:58:57] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:58:57] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:58:57] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:58:58] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:58:58] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:58:58] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:58:58] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 3 ms to minimize.
[2024-06-01 15:58:58] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-06-01 15:58:59] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 4 ms to minimize.
[2024-06-01 15:58:59] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:58:59] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 12 ms to minimize.
[2024-06-01 15:59:00] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 3 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:59:01] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:59:03] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 4 ms to minimize.
[2024-06-01 15:59:04] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:59:05] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 3 ms to minimize.
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:59:06] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:59:07] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 4 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 3 ms to minimize.
[2024-06-01 15:59:08] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:11] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 3 ms to minimize.
[2024-06-01 15:59:12] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-06-01 15:59:13] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/552 variables, and 96 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:18] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-06-01 15:59:19] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:59:20] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 4 ms to minimize.
[2024-06-01 15:59:20] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 4 ms to minimize.
[2024-06-01 15:59:20] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-06-01 15:59:20] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:23] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:59:24] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 3 ms to minimize.
[2024-06-01 15:59:25] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:59:25] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:28] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 3 ms to minimize.
[2024-06-01 15:59:28] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:59:41] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/552 variables, and 114 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/328 constraints, Known Traps: 99/99 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Finished structural reductions in LTL mode , in 1 iterations and 61062 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 224 out of 244 places after structural reductions.
[2024-06-01 15:59:44] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:59:44] [INFO ] Flatten gal took : 67 ms
[2024-06-01 15:59:45] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (8 resets) in 3589 ms. (11 steps per ms) remains 17/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
[2024-06-01 15:59:46] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-06-01 15:59:46] [INFO ] Invariant cache hit.
[2024-06-01 15:59:46] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/4 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/8 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/301 constraints. Problems are: Problem set: 15 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/313 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/316 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 15 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 15 solved, 2 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 212/228 variables, 8/8 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 15 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 1/318 constraints. Problems are: Problem set: 15 solved, 2 unsolved
[2024-06-01 15:59:47] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 4 ms to minimize.
[2024-06-01 15:59:47] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:59:48] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 3 ms to minimize.
Problem AtomicPropp8 is UNSAT
[2024-06-01 15:59:49] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:59:49] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 552/552 variables, and 329 constraints, problems are : Problem set: 17 solved, 0 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/17 constraints, Known Traps: 11/11 constraints]
After SMT, in 2777ms problems are : Problem set: 17 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 17 atomic propositions for a total of 8 simplifications.
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 26 ms
[2024-06-01 15:59:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-COL-3-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:59:49] [INFO ] Input system was already deterministic with 332 transitions.
Support contains 212 out of 244 places (down from 224) after GAL structural reductions.
FORMULA Peterson-COL-3-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 22 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 29 ms
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 45 ms
[2024-06-01 15:59:49] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 208 transition count 296
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 208 transition count 272
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 184 transition count 272
Applied a total of 120 rules in 77 ms. Remains 184 /244 variables (removed 60) and now considering 272/332 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 184/244 places, 272/332 transitions.
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 25 ms
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 30 ms
[2024-06-01 15:59:49] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 27 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 32 ms
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 36 ms
[2024-06-01 15:59:49] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 23 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:59:49] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:49] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:50] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:50] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-06-01 15:59:50] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:59:50] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:59:50] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-01 15:59:50] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:59:50] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:59:50] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:59:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 6 ms.
Total runtime 70301 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 : Peterson-COL-3-CTLCardinality-2024-02
Could not compute solution for formula : Peterson-COL-3-CTLCardinality-2024-05
Could not compute solution for formula : Peterson-COL-3-CTLCardinality-2024-08
Could not compute solution for formula : Peterson-COL-3-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-COL-3-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-COL-3-CTLCardinality-2024-13

BK_STOP 1717257590538

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-COL-3-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/859/ctl_0_
ctl formula name Peterson-COL-3-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/859/ctl_1_
ctl formula name Peterson-COL-3-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/859/ctl_2_
ctl formula name Peterson-COL-3-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/859/ctl_3_
ctl formula name Peterson-COL-3-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/859/ctl_4_
ctl formula name Peterson-COL-3-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/859/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="Peterson-COL-3"
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 Peterson-COL-3, 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 r512-smll-171654407100209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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