fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r504-tall-171649612300218
Last Updated
July 7, 2024

About the Execution of LTSMin+red for LamportFastMutEx-COL-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
390.596 44378.00 62915.00 158.20 F??????????????? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.8K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K May 18 16:42 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 LamportFastMutEx-COL-4-CTLFireability-2024-00
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-01
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-02
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-03
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-04
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-05
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-06
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-07
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-08
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-09
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-10
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-11
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-12
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-13
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-14
FORMULA_NAME LamportFastMutEx-COL-4-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717224911097

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:55:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:55:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:55: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 06:55:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:55:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2024-06-01 06:55:13] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
FORMULA LamportFastMutEx-COL-4-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:55:13] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-06-01 06:55:13] [INFO ] Skeletonized 5 HLPN properties in 2 ms. Removed 10 properties that had guard overlaps.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 615 steps (0 resets) in 36 ms. (16 steps per ms) remains 0/12 properties
[2024-06-01 06:55:13] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:55:13] [INFO ] Flatten gal took : 3 ms
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 06:55:13] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 38 ms.
[2024-06-01 06:55:13] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Support contains 98 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 06:55:13] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-06-01 06:55:13] [INFO ] Computed 26 invariants in 17 ms
[2024-06-01 06:55:13] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 06:55:13] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 06:55:13] [INFO ] Invariant cache hit.
[2024-06-01 06:55:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 06:55:13] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 06:55:13] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 06:55:13] [INFO ] Invariant cache hit.
[2024-06-01 06:55:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 16 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 5 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 5 solved, 171 unsolved
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 7 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 3 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/86 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/96 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/102 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 7/109 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/116 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 15/131 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 5/136 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/136 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 144/246 variables, 102/238 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 40/278 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/246 variables, 0/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 280 constraints, problems are : Problem set: 24 solved, 152 unsolved in 14583 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 112/112 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 60/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/86 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 52/138 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/146 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/146 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/248 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/288 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 152/440 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 5/445 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:33] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:55:34] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/448 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:37] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 6/454 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/457 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/459 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 7/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 466 constraints, problems are : Problem set: 24 solved, 152 unsolved in 25322 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 146/146 constraints]
After SMT, in 40010ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 40036ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 156/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40471 ms. Remains : 102/102 places, 156/180 transitions.
Support contains 98 out of 102 places after structural reductions.
[2024-06-01 06:55:53] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:55:53] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Reduction of identical properties reduced properties to check from 34 to 28
RANDOM walk for 781 steps (0 resets) in 100 ms. (7 steps per ms) remains 0/28 properties
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 18 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 9 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 9 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 152
Applied a total of 8 rules in 9 ms. Remains 98 /102 variables (removed 4) and now considering 152/156 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 98/102 places, 152/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 102/102 places, 156/156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:55:54] [INFO ] Input system was already deterministic with 156 transitions.
[2024-06-01 06:55:54] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:55:55] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:55:55] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 14 ms.
[2024-06-01 06:55:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 156 transitions and 672 arcs took 4 ms.
Total runtime 42821 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 : LamportFastMutEx-COL-4-CTLFireability-2024-01
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-02
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-03
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-04
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-05
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-06
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-07
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-08
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-09
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-10
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-11
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-12
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-13
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-14
Could not compute solution for formula : LamportFastMutEx-COL-4-CTLFireability-2024-15

BK_STOP 1717224955475

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/953/ctl_0_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/953/ctl_1_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/953/ctl_2_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/953/ctl_3_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/953/ctl_4_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/953/ctl_5_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/953/ctl_6_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/953/ctl_7_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/953/ctl_8_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/953/ctl_9_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/953/ctl_10_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/953/ctl_11_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/953/ctl_12_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/953/ctl_13_
ctl formula name LamportFastMutEx-COL-4-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/953/ctl_14_
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="LamportFastMutEx-COL-4"
export BK_EXAMINATION="CTLFireability"
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 LamportFastMutEx-COL-4, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612300218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;