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.r492-smll-171636265900001.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 EGFr-PT-02010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636265900001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K 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 EGFr-PT-02010-CTLCardinality-2024-00
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-01
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-02
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-03
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-04
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-05
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-06
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-07
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-08
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-09
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-10
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2024-11
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-12
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-13
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-14
FORMULA_NAME EGFr-PT-02010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717193221069

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:07:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:07:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:07:04] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-31 22:07:04] [INFO ] Transformed 40 places.
[2024-05-31 22:07:04] [INFO ] Transformed 68 transitions.
[2024-05-31 22:07:04] [INFO ] Found NUPN structural information;
[2024-05-31 22:07:04] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
FORMULA EGFr-PT-02010-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 91 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-31 22:07:04] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2024-05-31 22:07:04] [INFO ] Computed 20 invariants in 11 ms
[2024-05-31 22:07:04] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 22:07:04] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-31 22:07:04] [INFO ] Invariant cache hit.
[2024-05-31 22:07:05] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:07:05] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-31 22:07:05] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-31 22:07:05] [INFO ] Invariant cache hit.
[2024-05-31 22:07:05] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-31 22:07:05] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 20 ms to minimize.
[2024-05-31 22:07:05] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 22:07:06] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 125 constraints, problems are : Problem set: 9 solved, 56 unsolved in 2329 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 6/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 56/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 181 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1253 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 56/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 3711ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 3738ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 53/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4481 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 40 out of 40 places after structural reductions.
[2024-05-31 22:07:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 22:07:09] [INFO ] Flatten gal took : 54 ms
[2024-05-31 22:07:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:07:09] [INFO ] Flatten gal took : 20 ms
[2024-05-31 22:07:09] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 39 out of 40 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 54 to 51
RANDOM walk for 40000 steps (1789 resets) in 2692 ms. (14 steps per ms) remains 4/51 properties
BEST_FIRST walk for 40002 steps (427 resets) in 339 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (436 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (391 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (426 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
[2024-05-31 22:07:10] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-31 22:07:10] [INFO ] Computed 20 invariants in 1 ms
[2024-05-31 22:07:10] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/18 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:07:10] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:07:10] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem AtomicPropp37 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/34 variables, 18/47 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 10 (OVERLAPS) 11/45 variables, 15/64 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 2/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 28/73 variables, 22/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 22/110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 11/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/73 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 121 constraints, problems are : Problem set: 2 solved, 2 unsolved in 245 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/14 variables, 7/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 2/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/27 variables, 14/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/40 variables, 13/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 4/56 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 33/73 variables, 26/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/73 variables, 26/108 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 13/121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 2/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-31 22:07:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/73 variables, 1/124 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/73 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/73 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 124 constraints, problems are : Problem set: 2 solved, 2 unsolved in 201 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 455ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Graph (complete) has 116 edges and 40 vertex of which 36 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 36 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 35 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 35 transition count 46
Applied a total of 7 rules in 34 ms. Remains 35 /40 variables (removed 5) and now considering 46/53 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 35/40 places, 46/53 transitions.
RANDOM walk for 40000 steps (1971 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (437 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (423 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2985 states, properties seen :0
Probabilistic random walk after 17107 steps, saw 2985 distinct states, run finished after 143 ms. (steps per millisecond=119 ) properties seen :0
Explored full state space saw : 2985 states, properties seen :0
Exhaustive walk after 17107 steps, saw 2985 distinct states, run finished after 105 ms. (steps per millisecond=162 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:07:11] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:07:11] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:07:11] [INFO ] Input system was already deterministic with 53 transitions.
Computed a total of 14 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-31 22:07:11] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:07:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:07:11] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-31 22:07:11] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:07:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:07:11] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 53/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 39/40 places, 51/53 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:07:12] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:07:12] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 22:07:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 53 transitions and 278 arcs took 2 ms.
Total runtime 8486 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 : EGFr-PT-02010-CTLCardinality-2024-00
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-01
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-02
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-03
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-04
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-07
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-08
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2024-11
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2023-13
Could not compute solution for formula : EGFr-PT-02010-CTLCardinality-2023-14

BK_STOP 1717193232822

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name EGFr-PT-02010-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/548/ctl_0_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/548/ctl_1_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/548/ctl_2_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/548/ctl_3_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/548/ctl_4_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/548/ctl_5_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/548/ctl_6_
ctl formula name EGFr-PT-02010-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/548/ctl_7_
ctl formula name EGFr-PT-02010-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/548/ctl_8_
ctl formula name EGFr-PT-02010-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/548/ctl_9_
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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r492-smll-171636265900001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EGFr-PT-02010.tgz
mv EGFr-PT-02010 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 ;