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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 01:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 01:53 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 32K 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-09a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717192459191

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-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:54:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:54:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:54:20] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-31 21:54:20] [INFO ] Transformed 93 places.
[2024-05-31 21:54:20] [INFO ] Transformed 127 transitions.
[2024-05-31 21:54:20] [INFO ] Found NUPN structural information;
[2024-05-31 21:54:20] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 149 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 4 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 84 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 84 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 81 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 81 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 81 transition count 106
Applied a total of 30 rules in 31 ms. Remains 81 /93 variables (removed 12) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 81 cols
[2024-05-31 21:54:20] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 21:54:20] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-31 21:54:20] [INFO ] Invariant cache hit.
[2024-05-31 21:54:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 21:54:20] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/93 places, 106/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 80/93 places, 106/127 transitions.
Support contains 15 out of 80 places after structural reductions.
[2024-05-31 21:54:21] [INFO ] Flatten gal took : 26 ms
[2024-05-31 21:54:21] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:54:21] [INFO ] Input system was already deterministic with 106 transitions.
RANDOM walk for 8040 steps (79 resets) in 176 ms. (45 steps per ms) remains 0/7 properties
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 202 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 106/106 transitions.
Graph (complete) has 202 edges and 80 vertex of which 78 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 1 places and 0 transitions.
Graph (complete) has 89 edges and 76 vertex of which 69 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Graph (trivial) has 71 edges and 69 vertex of which 32 / 69 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 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 14 rules applied. Total rules applied 15 place count 53 transition count 85
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 42 place count 42 transition count 69
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 37 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 37 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 32 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 32 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 28 transition count 41
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 28 transition count 41
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 24 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 24 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 86 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 20 transition count 32
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 89 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 19 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 19 transition count 31
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 15 transition count 27
Applied a total of 95 rules in 31 ms. Remains 15 /80 variables (removed 65) and now considering 27/106 (removed 79) transitions.
[2024-05-31 21:54:21] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 15 cols
[2024-05-31 21:54:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:54:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 21:54:21] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-31 21:54:21] [INFO ] Invariant cache hit.
[2024-05-31 21:54:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-31 21:54:21] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 21:54:21] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-31 21:54:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 8/35 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/36 variables, and 15 constraints, problems are : Problem set: 0 solved, 15 unsolved in 169 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 8/35 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/36 variables, and 30 constraints, problems are : Problem set: 0 solved, 15 unsolved in 114 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 308ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/80 places, 27/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 15/80 places, 27/106 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-04 finished in 682 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(p0))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 106/106 transitions.
Graph (complete) has 202 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 76 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 69 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 69 transition count 95
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 51 place count 51 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 44 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 44 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 37 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 37 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 30 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 30 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 24 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 24 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 19 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 19 transition count 25
Applied a total of 115 rules in 20 ms. Remains 19 /80 variables (removed 61) and now considering 25/106 (removed 81) transitions.
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 19 cols
[2024-05-31 21:54:22] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:54:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-31 21:54:22] [INFO ] Invariant cache hit.
[2024-05-31 21:54:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-31 21:54:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-31 21:54:22] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-05-31 21:54:22] [INFO ] Invariant cache hit.
[2024-05-31 21:54:22] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/41 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 36 constraints, problems are : Problem set: 0 solved, 24 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/41 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 60 constraints, problems are : Problem set: 0 solved, 24 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/80 places, 25/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 527 ms. Remains : 19/80 places, 25/106 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-06 finished in 583 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((p0||G(p1))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 106/106 transitions.
Graph (complete) has 202 edges and 80 vertex of which 77 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 88 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Graph (trivial) has 74 edges and 69 vertex of which 36 / 69 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 87
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 42 transition count 69
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 37 transition count 59
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 37 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 32 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 32 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 27 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 27 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 22 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 22 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 18 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 18 transition count 29
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 14 transition count 25
Applied a total of 93 rules in 8 ms. Remains 14 /80 variables (removed 66) and now considering 25/106 (removed 81) transitions.
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 18 transitions (discarded 7 similar events)
// Phase 1: matrix 18 rows 14 cols
[2024-05-31 21:54:22] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:54:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 18 transitions (discarded 7 similar events)
[2024-05-31 21:54:22] [INFO ] Invariant cache hit.
[2024-05-31 21:54:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-31 21:54:22] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 18 transitions (discarded 7 similar events)
[2024-05-31 21:54:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 7/31 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 14 unsolved in 101 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 7/31 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 28 constraints, problems are : Problem set: 0 solved, 14 unsolved in 83 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/80 places, 25/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 14/80 places, 25/106 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-07 finished in 298 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(p0))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 106/106 transitions.
Graph (complete) has 202 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 87 edges and 74 vertex of which 64 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 72 edges and 64 vertex of which 36 / 64 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 46 transition count 82
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 37 transition count 64
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 47 place count 30 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 54 place count 30 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 23 transition count 36
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 23 transition count 36
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 16 transition count 22
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 16 transition count 22
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 9 transition count 15
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 5 transition count 10
Applied a total of 103 rules in 11 ms. Remains 5 /80 variables (removed 75) and now considering 10/106 (removed 96) transitions.
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-31 21:54:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 21:54:22] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-31 21:54:22] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2024-05-31 21:54:22] [INFO ] Invariant cache hit.
[2024-05-31 21:54:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-31 21:54:23] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-31 21:54:23] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2024-05-31 21:54:23] [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) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34 ms.
Refiners :[State Equation: 5/5 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) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/80 places, 10/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 5/80 places, 10/106 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-11 finished in 166 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 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 106/106 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 71 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 71 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 68 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 68 transition count 94
Applied a total of 24 rules in 11 ms. Remains 68 /80 variables (removed 12) and now considering 94/106 (removed 12) transitions.
// Phase 1: matrix 94 rows 68 cols
[2024-05-31 21:54:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:54:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 21:54:23] [INFO ] Invariant cache hit.
[2024-05-31 21:54:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 21:54:23] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-31 21:54:23] [INFO ] Invariant cache hit.
[2024-05-31 21:54:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 208 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 2788ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 2790ms
Starting structural reductions in LTL mode, iteration 1 : 68/80 places, 94/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2926 ms. Remains : 68/80 places, 94/106 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 10 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 17 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-09a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-12 finished in 3516 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 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 106/106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 76 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 76 transition count 102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 72 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 69 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 69 transition count 95
Applied a total of 22 rules in 6 ms. Remains 69 /80 variables (removed 11) and now considering 95/106 (removed 11) transitions.
// Phase 1: matrix 95 rows 69 cols
[2024-05-31 21:54:26] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:54:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 21:54:26] [INFO ] Invariant cache hit.
[2024-05-31 21:54:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 21:54:26] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-31 21:54:26] [INFO ] Invariant cache hit.
[2024-05-31 21:54:26] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/164 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 116 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/164 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 94/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 210 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 2739ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 2741ms
Starting structural reductions in LTL mode, iteration 1 : 69/80 places, 95/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2880 ms. Remains : 69/80 places, 95/106 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 187 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 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 15 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-09a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-14 finished in 3211 ms.
All properties solved by simple procedures.
Total runtime 9513 ms.
ITS solved all properties within timeout

BK_STOP 1717192469900

--------------------
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="DiscoveryGPU-PT-09a"
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-09a, 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-171631132600411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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