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

About the Execution of LTSMin+red for RingSingleMessageInMbox-PT-d0m160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
368.695 7084.00 16613.00 66.40 FFTF??TFF?F?T??T 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.r524-tall-171679079500049.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 RingSingleMessageInMbox-PT-d0m160, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079500049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 23:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 23:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717218057189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:00:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:00:58] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 05:00:58] [INFO ] Transformed 385 places.
[2024-06-01 05:00:58] [INFO ] Transformed 59 transitions.
[2024-06-01 05:00:58] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 49 transition count 52
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 49 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 48 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 48 transition count 51
Applied a total of 14 rules in 22 ms. Remains 48 /56 variables (removed 8) and now considering 51/59 (removed 8) transitions.
// Phase 1: matrix 51 rows 48 cols
[2024-06-01 05:00:58] [INFO ] Computed 3 invariants in 8 ms
[2024-06-01 05:00:58] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 05:00:58] [INFO ] Invariant cache hit.
[2024-06-01 05:00:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:00:58] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-01 05:00:58] [INFO ] Invariant cache hit.
[2024-06-01 05:00:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 51/99 variables, 48/51 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 22/73 constraints. Problems are: Problem set: 5 solved, 45 unsolved
[2024-06-01 05:00:59] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 8 ms to minimize.
Problem TDEAD44 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/74 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/74 constraints. Problems are: Problem set: 6 solved, 44 unsolved
[2024-06-01 05:00:59] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/99 variables, 1/75 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 75 constraints, problems are : Problem set: 6 solved, 44 unsolved in 1292 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 6 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 3/45 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 3/48 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 51/99 variables, 48/53 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 22/75 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 44/119 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/119 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/119 constraints. Problems are: Problem set: 6 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 119 constraints, problems are : Problem set: 6 solved, 44 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 44/50 constraints, Known Traps: 2/2 constraints]
After SMT, in 2208ms problems are : Problem set: 6 solved, 44 unsolved
Search for dead transitions found 6 dead transitions in 2219ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 48/56 places, 45/59 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 44 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 1 ms. Remains 44 /48 variables (removed 4) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 44 cols
[2024-06-01 05:01:01] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 05:01:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
[2024-06-01 05:01:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:01:01] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 44/56 places, 45/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2751 ms. Remains : 44/56 places, 45/59 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 3 out of 43 places after structural reductions.
[2024-06-01 05:01:01] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 05:01:01] [INFO ] Flatten gal took : 22 ms
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:01] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:01:01] [INFO ] Input system was already deterministic with 45 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8606 resets) in 1148 ms. (34 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (3733 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3772 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
// Phase 1: matrix 45 rows 43 cols
[2024-06-01 05:01:02] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 05:01:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/59 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (OVERLAPS) 28/87 variables, 17/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 11/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 1 solved, 1 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/21 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/58 variables, 24/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 9/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/87 variables, 18/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 11/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/88 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/88 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 66 constraints, problems are : Problem set: 1 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 45/45 transitions.
Graph (complete) has 111 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 41 transition count 41
Applied a total of 6 rules in 11 ms. Remains 41 /43 variables (removed 2) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 41/43 places, 41/45 transitions.
RANDOM walk for 40000 steps (8700 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3694 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 865811 steps, run visited all 1 properties in 743 ms. (steps per millisecond=1165 )
Probabilistic random walk after 865811 steps, saw 331741 distinct states, run finished after 747 ms. (steps per millisecond=1159 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 45 transitions.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 130 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 44
Applied a total of 2 rules in 5 ms. Remains 42 /43 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 42/43 places, 44/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 44 transitions.
RANDOM walk for 40000 steps (8625 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3606 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 902462 steps, run visited all 1 properties in 697 ms. (steps per millisecond=1294 )
Probabilistic random walk after 902462 steps, saw 347187 distinct states, run finished after 697 ms. (steps per millisecond=1294 ) properties seen :1
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 44
Applied a total of 2 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/43 places, 44/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 44
Applied a total of 2 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/43 places, 44/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 44
Applied a total of 2 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/43 places, 44/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 43/43 places, 45/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 44
Applied a total of 2 rules in 4 ms. Remains 42 /43 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/43 places, 44/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 44
Applied a total of 2 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/43 places, 44/45 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:03] [INFO ] Input system was already deterministic with 44 transitions.
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:03] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:03] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:01:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 45 transitions and 175 arcs took 3 ms.
Total runtime 5703 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 : RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-04
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-05
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-09
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-11
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-13
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-14

BK_STOP 1717218064273

--------------------
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 RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/524/ctl_0_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/524/ctl_1_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/524/ctl_2_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/524/ctl_3_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/524/ctl_4_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/524/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="RingSingleMessageInMbox-PT-d0m160"
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 RingSingleMessageInMbox-PT-d0m160, 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 r524-tall-171679079500049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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