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.r597-smll-171734926500092.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 gold2023
Input is MedleyA-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 MedleyA-PT-19-LTLCardinality-00
FORMULA_NAME MedleyA-PT-19-LTLCardinality-01
FORMULA_NAME MedleyA-PT-19-LTLCardinality-02
FORMULA_NAME MedleyA-PT-19-LTLCardinality-03
FORMULA_NAME MedleyA-PT-19-LTLCardinality-04
FORMULA_NAME MedleyA-PT-19-LTLCardinality-05
FORMULA_NAME MedleyA-PT-19-LTLCardinality-06
FORMULA_NAME MedleyA-PT-19-LTLCardinality-07
FORMULA_NAME MedleyA-PT-19-LTLCardinality-08
FORMULA_NAME MedleyA-PT-19-LTLCardinality-09
FORMULA_NAME MedleyA-PT-19-LTLCardinality-10
FORMULA_NAME MedleyA-PT-19-LTLCardinality-11
FORMULA_NAME MedleyA-PT-19-LTLCardinality-12
FORMULA_NAME MedleyA-PT-19-LTLCardinality-13
FORMULA_NAME MedleyA-PT-19-LTLCardinality-14
FORMULA_NAME MedleyA-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717363574294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:26:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:26:16] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-02 21:26:16] [INFO ] Transformed 272 places.
[2024-06-02 21:26:17] [INFO ] Transformed 586 transitions.
[2024-06-02 21:26:17] [INFO ] Found NUPN structural information;
[2024-06-02 21:26:17] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 248 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.
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 70 place count 199 transition count 503
Iterating global reduction 1 with 68 rules applied. Total rules applied 138 place count 199 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 198 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 198 transition count 501
Applied a total of 140 rules in 69 ms. Remains 198 /269 variables (removed 71) and now considering 501/583 (removed 82) transitions.
// Phase 1: matrix 501 rows 198 cols
[2024-06-02 21:26:17] [INFO ] Computed 22 invariants in 31 ms
[2024-06-02 21:26:17] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-02 21:26:17] [INFO ] Invariant cache hit.
[2024-06-02 21:26:18] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-06-02 21:26:18] [INFO ] Invariant cache hit.
[2024-06-02 21:26:18] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 120 transitions.
Found 120 dead transitions using SMT.
Drop transitions removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/269 places, 381/583 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1248 ms. Remains : 198/269 places, 381/583 transitions.
Support contains 35 out of 198 places after structural reductions.
[2024-06-02 21:26:18] [INFO ] Flatten gal took : 91 ms
[2024-06-02 21:26:18] [INFO ] Flatten gal took : 48 ms
[2024-06-02 21:26:18] [INFO ] Input system was already deterministic with 381 transitions.
Support contains 33 out of 198 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 20) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 381 rows 198 cols
[2024-06-02 21:26:21] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:26:21] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-06-02 21:26:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 21:26:21] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 8 ms returned sat
[2024-06-02 21:26:22] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2024-06-02 21:26:22] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 8 ms to minimize.
[2024-06-02 21:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-06-02 21:26:22] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:26:22] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:26:22] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-06-02 21:26:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2024-06-02 21:26:23] [INFO ] After 1073ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-06-02 21:26:23] [INFO ] After 1439ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 7 properties in 52 ms.
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 381/381 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 198 transition count 349
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 68 place count 167 transition count 344
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 165 transition count 342
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 163 transition count 342
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 74 place count 163 transition count 332
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 94 place count 153 transition count 332
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 108 place count 139 transition count 314
Iterating global reduction 4 with 14 rules applied. Total rules applied 122 place count 139 transition count 314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 122 place count 139 transition count 312
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 137 transition count 312
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 192 place count 103 transition count 280
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 194 place count 103 transition count 278
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 102 transition count 276
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 102 transition count 276
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 208 place count 96 transition count 316
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 232 place count 96 transition count 292
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 238 place count 96 transition count 286
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 244 place count 90 transition count 286
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 259 place count 90 transition count 403
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 43 rules applied. Total rules applied 302 place count 75 transition count 375
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 303 place count 74 transition count 374
Applied a total of 303 rules in 183 ms. Remains 74 /198 variables (removed 124) and now considering 374/381 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 74/198 places, 374/381 transitions.
Incomplete random walk after 10000 steps, including 1163 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 187 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 74 cols
[2024-06-02 21:26:23] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:26:23] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-02 21:26:23] [INFO ] [Real]Absence check using 13 positive and 8 generalized place invariants in 13 ms returned sat
[2024-06-02 21:26:23] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 21:26:23] [INFO ] State equation strengthened by 187 read => feed constraints.
[2024-06-02 21:26:23] [INFO ] After 37ms SMT Verify possible using 187 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:26:23] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:26:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-02 21:26:23] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-02 21:26:23] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:23] [INFO ] After 46ms SMT Verify possible using 187 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:24] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-02 21:26:24] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 374/374 transitions.
Graph (complete) has 440 edges and 74 vertex of which 72 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 removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 69 transition count 370
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 68 transition count 372
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 68 transition count 388
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 19 place count 67 transition count 379
Applied a total of 19 rules in 33 ms. Remains 67 /74 variables (removed 7) and now considering 379/374 (removed -5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 67/74 places, 379/374 transitions.
Incomplete random walk after 10000 steps, including 1581 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 198 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1414616 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :{}
Probabilistic random walk after 1414616 steps, saw 202436 distinct states, run finished after 3002 ms. (steps per millisecond=471 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 67 cols
[2024-06-02 21:26:27] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:26:27] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-02 21:26:27] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:26:27] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 21:26:27] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-06-02 21:26:27] [INFO ] After 35ms SMT Verify possible using 191 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:26:27] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:26:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-06-02 21:26:27] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:26:27] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:27] [INFO ] After 37ms SMT Verify possible using 191 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:27] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-02 21:26:27] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 379/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 67 /67 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 67/67 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 379/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 67 /67 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2024-06-02 21:26:27] [INFO ] Invariant cache hit.
[2024-06-02 21:26:27] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 21:26:27] [INFO ] Invariant cache hit.
[2024-06-02 21:26:27] [INFO ] State equation strengthened by 191 read => feed constraints.
[2024-06-02 21:26:28] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-06-02 21:26:28] [INFO ] Redundant transitions in 67 ms returned []
[2024-06-02 21:26:28] [INFO ] Invariant cache hit.
[2024-06-02 21:26:28] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 775 ms. Remains : 67/67 places, 379/379 transitions.
Graph (trivial) has 40 edges and 67 vertex of which 6 / 67 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 338 edges and 63 vertex of which 54 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 54 transition count 308
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 48 place count 54 transition count 289
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 54 transition count 287
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 124 place count 52 transition count 215
Free-agglomeration rule (complex) applied 5 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 52 transition count 227
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 166 place count 47 transition count 195
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 178 place count 47 transition count 195
Applied a total of 178 rules in 38 ms. Remains 47 /67 variables (removed 20) and now considering 195/379 (removed 184) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 195 rows 47 cols
[2024-06-02 21:26:28] [INFO ] Computed 14 invariants in 2 ms
[2024-06-02 21:26:28] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:26:28] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:26:28] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:26:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:26:28] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 21:26:28] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:28] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 21:26:28] [INFO ] After 13ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:28] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 21:26:28] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA MedleyA-PT-19-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 23 stable transitions
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 195 transition count 346
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 163 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 160 transition count 340
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 74 place count 160 transition count 330
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 94 place count 150 transition count 330
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 109 place count 135 transition count 311
Iterating global reduction 3 with 15 rules applied. Total rules applied 124 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 124 place count 135 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 133 transition count 309
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 195 place count 98 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 97 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 97 transition count 275
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 207 place count 92 transition count 304
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 227 place count 92 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 91 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 90 transition count 293
Applied a total of 230 rules in 82 ms. Remains 90 /198 variables (removed 108) and now considering 293/381 (removed 88) transitions.
[2024-06-02 21:26:29] [INFO ] Flow matrix only has 292 transitions (discarded 1 similar events)
// Phase 1: matrix 292 rows 90 cols
[2024-06-02 21:26:29] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:26:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:26:29] [INFO ] Flow matrix only has 292 transitions (discarded 1 similar events)
[2024-06-02 21:26:29] [INFO ] Invariant cache hit.
[2024-06-02 21:26:29] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:26:29] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-06-02 21:26:29] [INFO ] Redundant transitions in 48 ms returned []
[2024-06-02 21:26:29] [INFO ] Flow matrix only has 292 transitions (discarded 1 similar events)
[2024-06-02 21:26:29] [INFO ] Invariant cache hit.
[2024-06-02 21:26:29] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/198 places, 293/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 686 ms. Remains : 90/198 places, 293/381 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 198 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-19-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-02 finished in 960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X((X(G(p2)) U G(p2)))||p1)&&p0))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 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 removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 195 transition count 346
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 71 place count 163 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 160 transition count 340
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 74 place count 160 transition count 332
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 90 place count 152 transition count 332
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 104 place count 138 transition count 315
Iterating global reduction 3 with 14 rules applied. Total rules applied 118 place count 138 transition count 315
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 118 place count 138 transition count 313
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 136 transition count 313
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 193 place count 99 transition count 279
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 94 transition count 301
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 221 place count 94 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 93 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 224 place count 92 transition count 292
Applied a total of 224 rules in 72 ms. Remains 92 /198 variables (removed 106) and now considering 292/381 (removed 89) transitions.
[2024-06-02 21:26:29] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 92 cols
[2024-06-02 21:26:29] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:26:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:26:30] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:26:30] [INFO ] Invariant cache hit.
[2024-06-02 21:26:30] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-06-02 21:26:30] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-06-02 21:26:30] [INFO ] Redundant transitions in 52 ms returned []
[2024-06-02 21:26:30] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:26:30] [INFO ] Invariant cache hit.
[2024-06-02 21:26:30] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/198 places, 292/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 92/198 places, 292/381 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s54 0) (EQ s46 1)), p1:(OR (EQ s46 0) (EQ s54 1) (EQ s25 1)), p2:(OR (EQ s46 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-04 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 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 removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 195 transition count 346
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 70 place count 163 transition count 341
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 161 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 160 transition count 340
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 74 place count 160 transition count 330
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 94 place count 150 transition count 330
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 109 place count 135 transition count 311
Iterating global reduction 4 with 15 rules applied. Total rules applied 124 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 124 place count 135 transition count 309
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 133 transition count 309
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 69 rules applied. Total rules applied 197 place count 97 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 96 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 96 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 209 place count 91 transition count 303
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 229 place count 91 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 90 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 89 transition count 292
Applied a total of 232 rules in 58 ms. Remains 89 /198 variables (removed 109) and now considering 292/381 (removed 89) transitions.
[2024-06-02 21:26:30] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 89 cols
[2024-06-02 21:26:30] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 21:26:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:26:30] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:26:30] [INFO ] Invariant cache hit.
[2024-06-02 21:26:30] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:26:31] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 21:26:31] [INFO ] Redundant transitions in 41 ms returned []
[2024-06-02 21:26:31] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:26:31] [INFO ] Invariant cache hit.
[2024-06-02 21:26:31] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/198 places, 292/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 620 ms. Remains : 89/198 places, 292/381 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-05 finished in 716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1||X(p2))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 370
Applied a total of 18 rules in 7 ms. Remains 189 /198 variables (removed 9) and now considering 370/381 (removed 11) transitions.
// Phase 1: matrix 370 rows 189 cols
[2024-06-02 21:26:31] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:26:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:26:31] [INFO ] Invariant cache hit.
[2024-06-02 21:26:31] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-02 21:26:31] [INFO ] Invariant cache hit.
[2024-06-02 21:26:32] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 370/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 626 ms. Remains : 189/198 places, 370/381 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s67 0) (EQ s171 1)), p1:(AND (EQ s171 0) (EQ s67 1) (EQ s66 0) (EQ s61 1)), p2:(OR (EQ s113 0) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 349 ms.
Product exploration explored 100000 steps with 33333 reset in 323 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 169 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-07 finished in 1676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (F(p1)&&G(p2)))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 187 transition count 369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 187 transition count 369
Applied a total of 22 rules in 6 ms. Remains 187 /198 variables (removed 11) and now considering 369/381 (removed 12) transitions.
// Phase 1: matrix 369 rows 187 cols
[2024-06-02 21:26:33] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:26:33] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 21:26:33] [INFO ] Invariant cache hit.
[2024-06-02 21:26:33] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-02 21:26:33] [INFO ] Invariant cache hit.
[2024-06-02 21:26:33] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 369/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 187/198 places, 369/381 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s42 0) (EQ s32 1)), p0:(OR (EQ s14 0) (EQ s162 1)), p1:(OR (EQ s42 0) (EQ s32 1) (EQ s9 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 655 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND p2 p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 175 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 21:26:35] [INFO ] Invariant cache hit.
[2024-06-02 21:26:35] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-06-02 21:26:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 21:26:35] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 9 ms returned sat
[2024-06-02 21:26:35] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-06-02 21:26:36] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2024-06-02 21:26:36] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2024-06-02 21:26:36] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:26:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-06-02 21:26:36] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-06-02 21:26:36] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 369/369 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 187 transition count 337
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 156 transition count 331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 153 transition count 331
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 153 transition count 319
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 141 transition count 319
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 138 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 138 transition count 313
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 169 place count 104 transition count 280
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 104 transition count 278
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 98 transition count 317
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 207 place count 98 transition count 293
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 213 place count 98 transition count 287
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 219 place count 92 transition count 287
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 235 place count 92 transition count 420
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 288 place count 76 transition count 383
Applied a total of 288 rules in 50 ms. Remains 76 /187 variables (removed 111) and now considering 383/369 (removed -14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 76/187 places, 383/369 transitions.
Incomplete random walk after 10000 steps, including 1001 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 76 cols
[2024-06-02 21:26:36] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:26:36] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:26:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-02 21:26:36] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 3 ms returned sat
[2024-06-02 21:26:36] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:36] [INFO ] State equation strengthened by 203 read => feed constraints.
[2024-06-02 21:26:36] [INFO ] After 46ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:26:36] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:26:36] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:26:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 91 ms
[2024-06-02 21:26:36] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-06-02 21:26:36] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND p2 p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X p2)), (G p1), (G (NOT (AND p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (NOT p0)), (F (AND p0 (NOT p2))), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 547 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), true, (AND (NOT p0) p2), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), true, (AND (NOT p0) p2), (NOT p2)]
Support contains 4 out of 187 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 369/369 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 186 transition count 338
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 156 transition count 332
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 153 transition count 332
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 69 place count 153 transition count 319
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 95 place count 140 transition count 319
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 137 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 137 transition count 313
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 164 place count 105 transition count 282
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 176 place count 99 transition count 321
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 200 place count 99 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 98 transition count 296
Applied a total of 201 rules in 39 ms. Remains 98 /187 variables (removed 89) and now considering 296/369 (removed 73) transitions.
[2024-06-02 21:26:37] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 98 cols
[2024-06-02 21:26:37] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 21:26:37] [INFO ] Implicit Places using invariants in 99 ms returned [2, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 103 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/187 places, 296/369 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 96/187 places, 296/369 transitions.
Computed a total of 14 stabilizing places and 146 stable transitions
Graph (complete) has 515 edges and 96 vertex of which 94 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 146 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 9 factoid took 300 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), true, (AND (NOT p0) p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 786 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:26:38] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 96 cols
[2024-06-02 21:26:38] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:26:38] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:26:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-02 21:26:38] [INFO ] [Nat]Absence check using 12 positive and 7 generalized place invariants in 2 ms returned sat
[2024-06-02 21:26:38] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-02 21:26:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-06-02 21:26:38] [INFO ] After 44ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-06-02 21:26:38] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 21:26:38] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 296/296 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 96 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 96 transition count 292
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 292
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 1 with 2 rules applied. Total rules applied 7 place count 94 transition count 291
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 94 transition count 285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 88 transition count 285
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 35 place count 88 transition count 418
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 88 place count 72 transition count 381
Applied a total of 88 rules in 27 ms. Remains 72 /96 variables (removed 24) and now considering 381/296 (removed -85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 72/96 places, 381/296 transitions.
Finished random walk after 7412 steps, including 768 resets, run visited all 1 properties in 35 ms. (steps per millisecond=211 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 10 factoid took 469 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), true, (AND (NOT p0) p2), (NOT p2)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), true, (AND (NOT p0) p2), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), true, (AND (NOT p0) p2), (NOT p2)]
Product exploration explored 100000 steps with 4 reset in 177 ms.
Product exploration explored 100000 steps with 4 reset in 151 ms.
Built C files in :
/tmp/ltsmin526139653931762509
[2024-06-02 21:26:40] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2024-06-02 21:26:40] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:26:40] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2024-06-02 21:26:40] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:26:40] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2024-06-02 21:26:40] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:26:40] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin526139653931762509
Running compilation step : cd /tmp/ltsmin526139653931762509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin526139653931762509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin526139653931762509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5097185524977502385.hoa' '--buchi-type=spotba'
LTSmin run took 784 ms.
FORMULA MedleyA-PT-19-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLCardinality-09 finished in 8993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 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 removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 195 transition count 347
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 164 transition count 341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 161 transition count 341
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 161 transition count 331
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 92 place count 151 transition count 331
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 106 place count 137 transition count 313
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 137 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 120 place count 137 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 136 transition count 312
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 191 place count 100 transition count 279
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 99 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 99 transition count 277
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 94 transition count 306
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 223 place count 94 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 93 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 92 transition count 295
Applied a total of 226 rules in 47 ms. Remains 92 /198 variables (removed 106) and now considering 295/381 (removed 86) transitions.
[2024-06-02 21:26:42] [INFO ] Flow matrix only has 294 transitions (discarded 1 similar events)
// Phase 1: matrix 294 rows 92 cols
[2024-06-02 21:26:42] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 21:26:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:26:42] [INFO ] Flow matrix only has 294 transitions (discarded 1 similar events)
[2024-06-02 21:26:42] [INFO ] Invariant cache hit.
[2024-06-02 21:26:42] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-06-02 21:26:42] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-02 21:26:42] [INFO ] Redundant transitions in 47 ms returned []
[2024-06-02 21:26:42] [INFO ] Flow matrix only has 294 transitions (discarded 1 similar events)
[2024-06-02 21:26:42] [INFO ] Invariant cache hit.
[2024-06-02 21:26:42] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/198 places, 295/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 92/198 places, 295/381 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s41 0), p1:(AND (EQ s26 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-10 finished in 739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(X(p1)))&&F(p0))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 185 transition count 366
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 185 transition count 366
Applied a total of 26 rules in 5 ms. Remains 185 /198 variables (removed 13) and now considering 366/381 (removed 15) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:26:42] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:26:42] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 21:26:42] [INFO ] Invariant cache hit.
[2024-06-02 21:26:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-02 21:26:43] [INFO ] Invariant cache hit.
[2024-06-02 21:26:43] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 366/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 185/198 places, 366/381 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s101 0) (EQ s116 1)), p1:(OR (EQ s38 0) (EQ s105 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 351 ms.
Product exploration explored 100000 steps with 33333 reset in 323 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 650 edges and 185 vertex of which 183 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-13 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p0)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 186 transition count 367
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 186 transition count 367
Applied a total of 24 rules in 3 ms. Remains 186 /198 variables (removed 12) and now considering 367/381 (removed 14) transitions.
// Phase 1: matrix 367 rows 186 cols
[2024-06-02 21:26:44] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:26:44] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 21:26:44] [INFO ] Invariant cache hit.
[2024-06-02 21:26:44] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 21:26:44] [INFO ] Invariant cache hit.
[2024-06-02 21:26:45] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 367/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 186/198 places, 367/381 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s132 0) (EQ s112 1)), p1:(OR (EQ s28 0) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 654 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLCardinality-14 finished in 1240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 381/381 transitions.
Graph (complete) has 685 edges and 198 vertex of which 196 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 removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 195 transition count 348
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 165 transition count 342
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 162 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 161 transition count 341
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 72 place count 161 transition count 330
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 94 place count 150 transition count 330
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 109 place count 135 transition count 311
Iterating global reduction 4 with 15 rules applied. Total rules applied 124 place count 135 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 124 place count 135 transition count 309
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 133 transition count 309
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 65 rules applied. Total rules applied 193 place count 99 transition count 278
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 98 transition count 276
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 98 transition count 276
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 207 place count 92 transition count 316
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 231 place count 92 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 91 transition count 291
Applied a total of 232 rules in 35 ms. Remains 91 /198 variables (removed 107) and now considering 291/381 (removed 90) transitions.
[2024-06-02 21:26:45] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
// Phase 1: matrix 290 rows 91 cols
[2024-06-02 21:26:45] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:26:45] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:26:45] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:26:45] [INFO ] Invariant cache hit.
[2024-06-02 21:26:46] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:26:46] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 21:26:46] [INFO ] Redundant transitions in 40 ms returned []
[2024-06-02 21:26:46] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
[2024-06-02 21:26:46] [INFO ] Invariant cache hit.
[2024-06-02 21:26:46] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/198 places, 291/381 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 580 ms. Remains : 91/198 places, 291/381 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 116 steps with 12 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLCardinality-15 finished in 667 ms.
All properties solved by simple procedures.
Total runtime 29716 ms.

BK_STOP 1717363607617

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is MedleyA-PT-19, 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 r597-smll-171734926500092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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