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.r113-smll-171624274300131.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 greatspnxred
Input is DLCround-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274300131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 13 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 200K 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 DLCround-PT-04a-LTLCardinality-00
FORMULA_NAME DLCround-PT-04a-LTLCardinality-01
FORMULA_NAME DLCround-PT-04a-LTLCardinality-02
FORMULA_NAME DLCround-PT-04a-LTLCardinality-03
FORMULA_NAME DLCround-PT-04a-LTLCardinality-04
FORMULA_NAME DLCround-PT-04a-LTLCardinality-05
FORMULA_NAME DLCround-PT-04a-LTLCardinality-06
FORMULA_NAME DLCround-PT-04a-LTLCardinality-07
FORMULA_NAME DLCround-PT-04a-LTLCardinality-08
FORMULA_NAME DLCround-PT-04a-LTLCardinality-09
FORMULA_NAME DLCround-PT-04a-LTLCardinality-10
FORMULA_NAME DLCround-PT-04a-LTLCardinality-11
FORMULA_NAME DLCround-PT-04a-LTLCardinality-12
FORMULA_NAME DLCround-PT-04a-LTLCardinality-13
FORMULA_NAME DLCround-PT-04a-LTLCardinality-14
FORMULA_NAME DLCround-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716343339104

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:02:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 02:02:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:02:21] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-22 02:02:21] [INFO ] Transformed 139 places.
[2024-05-22 02:02:21] [INFO ] Transformed 823 transitions.
[2024-05-22 02:02:21] [INFO ] Found NUPN structural information;
[2024-05-22 02:02:21] [INFO ] Parsed PT model containing 139 places and 823 transitions and 3074 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 91 transitions
Reduce redundant transitions removed 91 transitions.
FORMULA DLCround-PT-04a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 732/732 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 614
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 614
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 124 transition count 610
Drop transitions (Redundant composition of simpler transitions.) removed 184 transitions
Redundant transition composition rules discarded 184 transitions
Iterating global reduction 1 with 184 rules applied. Total rules applied 218 place count 124 transition count 426
Applied a total of 218 rules in 104 ms. Remains 124 /139 variables (removed 15) and now considering 426/732 (removed 306) transitions.
[2024-05-22 02:02:21] [INFO ] Flow matrix only has 103 transitions (discarded 323 similar events)
// Phase 1: matrix 103 rows 124 cols
[2024-05-22 02:02:21] [INFO ] Computed 69 invariants in 18 ms
[2024-05-22 02:02:22] [INFO ] Implicit Places using invariants in 904 ms returned [64, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 94, 96, 97, 98, 99, 100, 101, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 115, 116, 117, 118, 119, 120, 122]
Discarding 51 places :
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Implicit Place search using SMT only with invariants took 982 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/139 places, 184/732 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 51 place count 73 transition count 133
Applied a total of 51 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 133/184 (removed 51) transitions.
[2024-05-22 02:02:22] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
// Phase 1: matrix 103 rows 73 cols
[2024-05-22 02:02:22] [INFO ] Computed 18 invariants in 3 ms
[2024-05-22 02:02:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 02:02:22] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:02:22] [INFO ] Invariant cache hit.
[2024-05-22 02:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:02:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/139 places, 133/732 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1347 ms. Remains : 73/139 places, 133/732 transitions.
Support contains 19 out of 73 places after structural reductions.
[2024-05-22 02:02:23] [INFO ] Flatten gal took : 52 ms
[2024-05-22 02:02:23] [INFO ] Flatten gal took : 18 ms
[2024-05-22 02:02:23] [INFO ] Input system was already deterministic with 133 transitions.
RANDOM walk for 40000 steps (8 resets) in 1647 ms. (24 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
[2024-05-22 02:02:24] [INFO ] Flow matrix only has 103 transitions (discarded 30 similar events)
[2024-05-22 02:02:24] [INFO ] Invariant cache hit.
[2024-05-22 02:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/34 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/73 variables, 8/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 102/175 variables, 73/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/176 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 92 constraints, problems are : Problem set: 1 solved, 5 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 34/176 variables, and 10 constraints, problems are : Problem set: 6 solved, 0 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 10/18 constraints, State Equation: 0/73 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
FORMULA DLCround-PT-04a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 1 stable transitions
Graph (complete) has 150 edges and 73 vertex of which 64 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
FORMULA DLCround-PT-04a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X(F(p0))))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 133/133 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 133
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 62 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 62 transition count 127
Applied a total of 14 rules in 9 ms. Remains 62 /73 variables (removed 11) and now considering 127/133 (removed 6) transitions.
[2024-05-22 02:02:24] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
// Phase 1: matrix 100 rows 62 cols
[2024-05-22 02:02:24] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 02:02:24] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 02:02:24] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:25] [INFO ] Invariant cache hit.
[2024-05-22 02:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:02:25] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 02:02:25] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:25] [INFO ] Invariant cache hit.
[2024-05-22 02:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/161 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 73 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4223 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/161 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 126/198 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/162 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 7463ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 7469ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 127/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7697 ms. Remains : 62/73 places, 127/133 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04a-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 448 ms.
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 136 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/62 stabilizing places and 1/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-04a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04a-LTLCardinality-01 finished in 8816 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' '!(X(F(p0)))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 133/133 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 133
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 62 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 62 transition count 127
Applied a total of 14 rules in 6 ms. Remains 62 /73 variables (removed 11) and now considering 127/133 (removed 6) transitions.
[2024-05-22 02:02:33] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:33] [INFO ] Invariant cache hit.
[2024-05-22 02:02:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 02:02:33] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:33] [INFO ] Invariant cache hit.
[2024-05-22 02:02:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:02:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 02:02:33] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:33] [INFO ] Invariant cache hit.
[2024-05-22 02:02:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/161 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 73 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3566 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 99/161 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 126/198 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 1/162 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3246 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 6846ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6850ms
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 127/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6989 ms. Remains : 62/73 places, 127/133 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04a-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLCardinality-05 finished in 7094 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' '!(X(G(p0)))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 133/133 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 133
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 61 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 61 transition count 127
Applied a total of 15 rules in 4 ms. Remains 61 /73 variables (removed 12) and now considering 127/133 (removed 6) transitions.
[2024-05-22 02:02:40] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
// Phase 1: matrix 100 rows 61 cols
[2024-05-22 02:02:40] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:02:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 02:02:40] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:40] [INFO ] Invariant cache hit.
[2024-05-22 02:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:02:40] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 02:02:40] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:40] [INFO ] Invariant cache hit.
[2024-05-22 02:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 99/160 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 71 constraints, problems are : Problem set: 0 solved, 126 unsolved in 2927 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 99/160 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 126/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 197 constraints, problems are : Problem set: 0 solved, 126 unsolved in 2855 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 5829ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 5833ms
Starting structural reductions in LTL mode, iteration 1 : 61/73 places, 127/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5948 ms. Remains : 61/73 places, 127/133 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04a-LTLCardinality-12 finished in 6052 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' '!(X(X(F(p0))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 133/133 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 133
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 61 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 61 transition count 127
Applied a total of 15 rules in 4 ms. Remains 61 /73 variables (removed 12) and now considering 127/133 (removed 6) transitions.
[2024-05-22 02:02:46] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:46] [INFO ] Invariant cache hit.
[2024-05-22 02:02:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:02:46] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:46] [INFO ] Invariant cache hit.
[2024-05-22 02:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:02:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 02:02:46] [INFO ] Flow matrix only has 100 transitions (discarded 27 similar events)
[2024-05-22 02:02:46] [INFO ] Invariant cache hit.
[2024-05-22 02:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 99/160 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 71 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 99/160 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 126/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 197 constraints, problems are : Problem set: 0 solved, 126 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 5962ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 5964ms
Starting structural reductions in LTL mode, iteration 1 : 61/73 places, 127/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6070 ms. Remains : 61/73 places, 127/133 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04a-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 151 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-04a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04a-LTLCardinality-15 finished in 6597 ms.
All properties solved by simple procedures.
Total runtime 32473 ms.
ITS solved all properties within timeout

BK_STOP 1716343373408

--------------------
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="DLCround-PT-04a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DLCround-PT-04a, 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 r113-smll-171624274300131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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