fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r532-smll-171683811300338
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SmartHome-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
263.539 10409.00 22151.00 296.10 ???F?????????FFF 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.r532-smll-171683811300338.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 SmartHome-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811300338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 04:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 12 04:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 04:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 04:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 25K 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 SmartHome-PT-01-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-01-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-01-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-01-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-01-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-01-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717256307828

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:38:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:38:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:38:31] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-01 15:38:31] [INFO ] Transformed 38 places.
[2024-06-01 15:38:31] [INFO ] Transformed 113 transitions.
[2024-06-01 15:38:31] [INFO ] Found NUPN structural information;
[2024-06-01 15:38:31] [INFO ] Parsed PT model containing 38 places and 113 transitions and 321 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 58 transitions
Reduce redundant transitions removed 58 transitions.
FORMULA SmartHome-PT-01-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 55/55 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 38 transition count 45
Applied a total of 10 rules in 45 ms. Remains 38 /38 variables (removed 0) and now considering 45/55 (removed 10) transitions.
[2024-06-01 15:38:31] [INFO ] Flow matrix only has 34 transitions (discarded 11 similar events)
// Phase 1: matrix 34 rows 38 cols
[2024-06-01 15:38:31] [INFO ] Computed 15 invariants in 12 ms
[2024-06-01 15:38:31] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 15:38:31] [INFO ] Flow matrix only has 34 transitions (discarded 11 similar events)
[2024-06-01 15:38:31] [INFO ] Invariant cache hit.
[2024-06-01 15:38:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 15:38:31] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 15:38:31] [INFO ] Flow matrix only has 34 transitions (discarded 11 similar events)
[2024-06-01 15:38:31] [INFO ] Invariant cache hit.
[2024-06-01 15:38:31] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/37 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 33/71 variables, 38/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1/72 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/72 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 112 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2015 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/37 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 33/71 variables, 38/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 44/155 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (OVERLAPS) 1/72 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (OVERLAPS) 0/72 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 156 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1582 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 3687ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3714ms
Starting structural reductions in LTL mode, iteration 1 : 38/38 places, 45/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4344 ms. Remains : 38/38 places, 45/55 transitions.
Support contains 33 out of 38 places after structural reductions.
[2024-06-01 15:38:36] [INFO ] Flatten gal took : 27 ms
[2024-06-01 15:38:36] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:38:36] [INFO ] Input system was already deterministic with 45 transitions.
Reduction of identical properties reduced properties to check from 67 to 60
RANDOM walk for 40000 steps (8 resets) in 2250 ms. (17 steps per ms) remains 3/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
[2024-06-01 15:38:37] [INFO ] Flow matrix only has 34 transitions (discarded 11 similar events)
[2024-06-01 15:38:37] [INFO ] Invariant cache hit.
[2024-06-01 15:38:37] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem AtomicPropp31 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
After SMT solving in domain Real declared 13/72 variables, and 15 constraints, problems are : Problem set: 3 solved, 0 unsolved in 48 ms.
Refiners :[Domain max(s): 8/38 constraints, Positive P Invariants (semi-flows): 7/14 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/38 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2024-06-01 15:38:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 8 ms
FORMULA SmartHome-PT-01-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 45 transitions.
Computed a total of 20 stabilizing places and 13 stable transitions
Graph (complete) has 102 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 35 transition count 40
Applied a total of 8 rules in 6 ms. Remains 35 /38 variables (removed 3) and now considering 40/45 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 35/38 places, 40/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 42
Applied a total of 6 rules in 3 ms. Remains 35 /38 variables (removed 3) and now considering 42/45 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 35/38 places, 42/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 33 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 33 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 33 transition count 38
Applied a total of 12 rules in 4 ms. Remains 33 /38 variables (removed 5) and now considering 38/45 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 33/38 places, 38/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 45
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 35 transition count 43
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 35 transition count 42
Applied a total of 6 rules in 8 ms. Remains 35 /38 variables (removed 3) and now considering 42/45 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 35/38 places, 42/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 33 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 33 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 33 transition count 38
Applied a total of 12 rules in 4 ms. Remains 33 /38 variables (removed 5) and now considering 38/45 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 33/38 places, 38/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 45
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 33 transition count 41
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 33 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 33 transition count 39
Applied a total of 11 rules in 4 ms. Remains 33 /38 variables (removed 5) and now considering 39/45 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 33/38 places, 39/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Graph (trivial) has 22 edges and 38 vertex of which 4 / 38 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 98 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 33 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 33 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 23 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 23 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 23 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 21 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 21 transition count 20
Applied a total of 35 rules in 38 ms. Remains 21 /38 variables (removed 17) and now considering 20/45 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 21/38 places, 20/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 1 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 45
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 32 transition count 40
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 32 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 32 transition count 38
Applied a total of 13 rules in 3 ms. Remains 32 /38 variables (removed 6) and now considering 38/45 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 32/38 places, 38/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37 transition count 45
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 35 transition count 43
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 35 transition count 42
Applied a total of 6 rules in 3 ms. Remains 35 /38 variables (removed 3) and now considering 42/45 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 35/38 places, 42/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 35 transition count 41
Applied a total of 7 rules in 3 ms. Remains 35 /38 variables (removed 3) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 35/38 places, 41/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Graph (trivial) has 23 edges and 38 vertex of which 4 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 98 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 58 edges and 29 vertex of which 26 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Graph (trivial) has 22 edges and 26 vertex of which 14 / 26 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 19 transition count 34
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 13 edges and 12 vertex of which 2 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Iterating post reduction 1 with 29 rules applied. Total rules applied 41 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 2 transition count 3
Applied a total of 42 rules in 6 ms. Remains 2 /38 variables (removed 36) and now considering 3/45 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 2/38 places, 3/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 1 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 1 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Graph (complete) has 102 edges and 38 vertex of which 37 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 33 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 33 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 19 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 27 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 27 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 26 transition count 28
Applied a total of 28 rules in 12 ms. Remains 26 /38 variables (removed 12) and now considering 28/45 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 26/38 places, 28/45 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:38:37] [INFO ] Input system was already deterministic with 28 transitions.
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:38:37] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 15:38:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 45 transitions and 145 arcs took 5 ms.
Total runtime 7478 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 : SmartHome-PT-01-CTLFireability-2024-00
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-01
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-02
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-04
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-05
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-06
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-07
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-08
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-09
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-10
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2024-11
Could not compute solution for formula : SmartHome-PT-01-CTLFireability-2023-12

BK_STOP 1717256318237

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

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

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