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.r480-tall-171624189300435.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 DBSingleClientW-PT-d0m04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189300435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d0m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717188767737

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:52:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:52:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:52:49] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-31 20:52:49] [INFO ] Transformed 553 places.
[2024-05-31 20:52:49] [INFO ] Transformed 150 transitions.
[2024-05-31 20:52:49] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 41 place count 79 transition count 99
Iterating global reduction 1 with 23 rules applied. Total rules applied 64 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 79 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 76 place count 68 transition count 87
Iterating global reduction 2 with 11 rules applied. Total rules applied 87 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 66 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 65 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 64 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 64 transition count 75
Applied a total of 100 rules in 47 ms. Remains 64 /109 variables (removed 45) and now considering 75/150 (removed 75) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-31 20:52:49] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 20:52:49] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-31 20:52:49] [INFO ] Invariant cache hit.
[2024-05-31 20:52:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:52:50] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-31 20:52:50] [INFO ] Invariant cache hit.
[2024-05-31 20:52:50] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 3431ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3443ms
Starting structural reductions in LTL mode, iteration 1 : 64/109 places, 75/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3910 ms. Remains : 64/109 places, 75/150 transitions.
Support contains 3 out of 64 places after structural reductions.
[2024-05-31 20:52:53] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:52:53] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:52:53] [INFO ] Input system was already deterministic with 75 transitions.
RANDOM walk for 40000 steps (9184 resets) in 1397 ms. (28 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (3988 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4087 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
[2024-05-31 20:52:54] [INFO ] Invariant cache hit.
[2024-05-31 20:52:54] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/105 variables, 45/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 10/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/137 variables, 18/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 14/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/139 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 1 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/18 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/75 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 8/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/92 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 17/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/107 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/137 variables, 26/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 16/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/139 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/139 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/139 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 92 constraints, problems are : Problem set: 1 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 75/75 transitions.
Graph (complete) has 187 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 59 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 59 transition count 67
Applied a total of 12 rules in 22 ms. Remains 59 /64 variables (removed 5) and now considering 67/75 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 59/64 places, 67/75 transitions.
RANDOM walk for 40000 steps (9222 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4129 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1028 steps, run visited all 1 properties in 12 ms. (steps per millisecond=85 )
Probabilistic random walk after 1028 steps, saw 523 distinct states, run finished after 16 ms. (steps per millisecond=64 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 60 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 58 transition count 64
Applied a total of 14 rules in 14 ms. Remains 58 /64 variables (removed 6) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-31 20:52:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:52:54] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 20:52:54] [INFO ] Invariant cache hit.
[2024-05-31 20:52:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:52:55] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-31 20:52:55] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-31 20:52:55] [INFO ] Invariant cache hit.
[2024-05-31 20:52:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2554ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/64 places, 64/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2837 ms. Remains : 58/64 places, 64/75 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m04-LTLCardinality-01
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d0m04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m04-LTLCardinality-01 finished in 3137 ms.
All properties solved by simple procedures.
Total runtime 8874 ms.
ITS solved all properties within timeout

BK_STOP 1717188778012

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="DBSingleClientW-PT-d0m04"
export BK_EXAMINATION="LTLCardinality"
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 DBSingleClientW-PT-d0m04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189300435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m04.tgz
mv DBSingleClientW-PT-d0m04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;