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-171679079500050.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079500050
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717218058237

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
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:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:00:59] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-01 05:00:59] [INFO ] Transformed 385 places.
[2024-06-01 05:00:59] [INFO ] Transformed 59 transitions.
[2024-06-01 05:00:59] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 51 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
Applied a total of 2 rules in 13 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2024-06-01 05:00:59] [INFO ] Computed 3 invariants in 10 ms
[2024-06-01 05:00:59] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-01 05:00:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 84 constraints, problems are : Problem set: 5 solved, 53 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 53/137 constraints. Problems are: Problem set: 7 solved, 51 unsolved
[2024-06-01 05:01:01] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 7 ms to minimize.
[2024-06-01 05:01:01] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 139 constraints, problems are : Problem set: 7 solved, 51 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 53/58 constraints, Known Traps: 2/2 constraints]
After SMT, in 2609ms problems are : Problem set: 7 solved, 51 unsolved
Search for dead transitions found 7 dead transitions in 2622ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 52/59 transitions.
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 51
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 2 rules in 3 ms. Remains 52 /54 variables (removed 2) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 52 cols
[2024-06-01 05:01:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:01:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 05:01:02] [INFO ] Invariant cache hit.
[2024-06-01 05:01:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 05:01:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/56 places, 51/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2999 ms. Remains : 52/56 places, 51/59 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 47 out of 48 places after structural reductions.
[2024-06-01 05:01:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:01:02] [INFO ] Flatten gal took : 20 ms
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:02] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:01:02] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 45 out of 48 places (down from 47) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 60 to 57
RANDOM walk for 40000 steps (8584 resets) in 2055 ms. (19 steps per ms) remains 16/57 properties
BEST_FIRST walk for 4001 steps (373 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (210 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (322 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (212 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (205 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 19 ms. (200 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (208 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (207 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (343 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (353 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (369 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (198 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (200 resets) in 37 ms. (105 steps per ms) remains 12/15 properties
BEST_FIRST walk for 4003 steps (198 resets) in 12 ms. (307 steps per ms) remains 12/12 properties
// Phase 1: matrix 51 rows 48 cols
[2024-06-01 05:01:03] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 05:01:03] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/34 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/40 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 46/86 variables, 40/43 constraints. Problems are: Problem set: 4 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 19/62 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 8 (OVERLAPS) 13/99 variables, 8/70 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 5/75 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/75 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 75 constraints, problems are : Problem set: 6 solved, 6 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/36 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 40/76 variables, 36/39 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 13/52 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/53 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/53 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 23/99 variables, 12/65 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 11/76 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 5/81 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/81 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/99 variables, 0/81 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 81 constraints, problems are : Problem set: 6 solved, 6 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 6 solved, 6 unsolved
Parikh walk visited 3 properties in 6968 ms.
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 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 46 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 43 transition count 43
Applied a total of 10 rules in 13 ms. Remains 43 /48 variables (removed 5) and now considering 43/51 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 43/48 places, 43/51 transitions.
RANDOM walk for 40000 steps (8651 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3768 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1937 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3739 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1426 steps, run visited all 3 properties in 15 ms. (steps per millisecond=95 )
Probabilistic random walk after 1426 steps, saw 659 distinct states, run finished after 23 ms. (steps per millisecond=62 ) properties seen :3
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
[2024-06-01 05:01:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 11 ms
FORMULA RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 5 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 5 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 48
Applied a total of 7 rules in 2 ms. Remains 44 /48 variables (removed 4) and now considering 48/51 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/48 places, 48/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 43/48 places, 45/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 47/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 45 transition count 49
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 45 transition count 49
Applied a total of 5 rules in 1 ms. Remains 45 /48 variables (removed 3) and now considering 49/51 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 49/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/48 places, 47/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 44 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 44 transition count 46
Applied a total of 7 rules in 4 ms. Remains 44 /48 variables (removed 4) and now considering 46/51 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 44/48 places, 46/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 46 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 50
Applied a total of 3 rules in 2 ms. Remains 46 /48 variables (removed 2) and now considering 50/51 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/48 places, 50/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 43/48 places, 45/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 45/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 46 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 50
Applied a total of 3 rules in 2 ms. Remains 46 /48 variables (removed 2) and now considering 50/51 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/48 places, 50/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/48 places, 44/51 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:01:11] [INFO ] Input system was already deterministic with 44 transitions.
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:11] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:01:11] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 05:01:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 51 transitions and 199 arcs took 1 ms.
Total runtime 12095 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-CTLFireability-2024-01
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-02
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-03
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-04
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-06
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-07
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-08
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-09
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-10
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-11
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-12
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-13
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-14
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-15

BK_STOP 1717218071845

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/528/ctl_0_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/528/ctl_1_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/528/ctl_2_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/528/ctl_3_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/528/ctl_4_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/528/ctl_5_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/528/ctl_6_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/528/ctl_7_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/528/ctl_8_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/528/ctl_9_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/528/ctl_10_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/528/ctl_11_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/528/ctl_12_
ctl formula name RingSingleMessageInMbox-PT-d0m160-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/528/ctl_13_
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="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 RingSingleMessageInMbox-PT-d0m160, 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 r524-tall-171679079500050"
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 [ "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 ;