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.r488-tall-171631132700459.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 DiscoveryGPU-PT-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132700459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 02:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 43K 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 DiscoveryGPU-PT-12a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717192935182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:02:16] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-31 22:02:16] [INFO ] Transformed 123 places.
[2024-05-31 22:02:16] [INFO ] Transformed 169 transitions.
[2024-05-31 22:02:16] [INFO ] Found NUPN structural information;
[2024-05-31 22:02:16] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 159
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 106 transition count 152
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 106 transition count 152
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 102 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 102 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 102 transition count 136
Applied a total of 50 rules in 35 ms. Remains 102 /123 variables (removed 21) and now considering 136/169 (removed 33) transitions.
// Phase 1: matrix 136 rows 102 cols
[2024-05-31 22:02:16] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 22:02:16] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-31 22:02:16] [INFO ] Invariant cache hit.
[2024-05-31 22:02:16] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-31 22:02:17] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-31 22:02:17] [INFO ] Invariant cache hit.
[2024-05-31 22:02:17] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/238 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 89/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 193 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3387 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/238 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 89/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 135/328 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 328 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 5860ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 5876ms
Starting structural reductions in LTL mode, iteration 1 : 102/123 places, 136/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6310 ms. Remains : 102/123 places, 136/169 transitions.
Support contains 20 out of 102 places after structural reductions.
[2024-05-31 22:02:23] [INFO ] Flatten gal took : 31 ms
[2024-05-31 22:02:23] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:02:23] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 40000 steps (309 resets) in 969 ms. (41 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (24 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2024-05-31 22:02:23] [INFO ] Invariant cache hit.
[2024-05-31 22:02:23] [INFO ] State equation strengthened by 89 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/33 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/33 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/71 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/98 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 26/124 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/124 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/124 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 35/159 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/159 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/159 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 33/192 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/192 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/192 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/214 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/214 variables, 11/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 14/228 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/228 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 8/236 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/236 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/236 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/238 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/238 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/238 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 7/238 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/102 constraints, ReadFeed: 1/89 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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((X(p1)&&p0))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 92 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 91 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 91 transition count 125
Applied a total of 22 rules in 10 ms. Remains 91 /102 variables (removed 11) and now considering 125/136 (removed 11) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-31 22:02:23] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 22:02:23] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:02:23] [INFO ] Invariant cache hit.
[2024-05-31 22:02:23] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-31 22:02:24] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 125/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 90/102 places, 125/136 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-02
Stuttering criterion allowed to conclude after 9415 steps with 260 reset in 78 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-02 finished in 578 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' '!(F(G(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 308 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 116 edges and 97 vertex of which 84 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Graph (trivial) has 92 edges and 84 vertex of which 48 / 84 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 60 transition count 110
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 49 place count 50 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 60 place count 39 transition count 64
Iterating global reduction 2 with 11 rules applied. Total rules applied 71 place count 39 transition count 64
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 28 transition count 42
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 28 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 102 place count 19 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 19 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 120 place count 10 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 129 place count 10 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 9 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 6 transition count 10
Applied a total of 137 rules in 26 ms. Remains 6 /102 variables (removed 96) and now considering 10/136 (removed 126) transitions.
[2024-05-31 22:02:24] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 6 cols
[2024-05-31 22:02:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:02:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-31 22:02:24] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2024-05-31 22:02:24] [INFO ] Invariant cache hit.
[2024-05-31 22:02:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-31 22:02:24] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 22:02:24] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2024-05-31 22:02:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 6 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/102 places, 10/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 6/102 places, 10/136 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-04 finished in 212 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 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 308 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 116 edges and 97 vertex of which 84 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Graph (trivial) has 91 edges and 84 vertex of which 46 / 84 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 61 transition count 109
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 50 place count 50 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 61 place count 39 transition count 64
Iterating global reduction 2 with 11 rules applied. Total rules applied 72 place count 39 transition count 64
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 28 transition count 42
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 28 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 103 place count 19 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 112 place count 19 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 10 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 10 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 9 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 9 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 8 transition count 12
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 8 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 6 transition count 10
Applied a total of 140 rules in 16 ms. Remains 6 /102 variables (removed 96) and now considering 10/136 (removed 126) transitions.
[2024-05-31 22:02:24] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 6 cols
[2024-05-31 22:02:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:02:24] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 22:02:24] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-31 22:02:24] [INFO ] Invariant cache hit.
[2024-05-31 22:02:24] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-31 22:02:24] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-31 22:02:24] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-31 22:02:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/102 places, 10/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 6/102 places, 10/136 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-05 finished in 242 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(p0))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 93 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 18 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2024-05-31 22:02:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:02:24] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:02:24] [INFO ] Invariant cache hit.
[2024-05-31 22:02:25] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-08 finished in 313 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 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 91 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 91 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 90 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 90 transition count 124
Applied a total of 24 rules in 6 ms. Remains 90 /102 variables (removed 12) and now considering 124/136 (removed 12) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-31 22:02:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 22:02:25] [INFO ] Invariant cache hit.
[2024-05-31 22:02:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 203 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 124/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 89/102 places, 124/136 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-09 finished in 300 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 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 93 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 7 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2024-05-31 22:02:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 22:02:25] [INFO ] Invariant cache hit.
[2024-05-31 22:02:25] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 166 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-10
Stuttering criterion allowed to conclude after 213 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-10 finished in 295 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 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 93 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 5 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2024-05-31 22:02:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 22:02:25] [INFO ] Invariant cache hit.
[2024-05-31 22:02:25] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 22:02:25] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 249 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-13 finished in 761 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 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 92 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 91 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 91 transition count 125
Applied a total of 22 rules in 4 ms. Remains 91 /102 variables (removed 11) and now considering 125/136 (removed 11) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-31 22:02:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:02:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:02:26] [INFO ] Invariant cache hit.
[2024-05-31 22:02:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-31 22:02:26] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 125/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 90/102 places, 125/136 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLCardinality-14
Stuttering criterion allowed to conclude after 259 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLCardinality-14 finished in 276 ms.
All properties solved by simple procedures.
Total runtime 10511 ms.
ITS solved all properties within timeout

BK_STOP 1717192946880

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DiscoveryGPU-PT-12a"
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 DiscoveryGPU-PT-12a, 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 r488-tall-171631132700459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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