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-171734926300022.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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 75K 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-05-LTLCardinality-00
FORMULA_NAME MedleyA-PT-05-LTLCardinality-01
FORMULA_NAME MedleyA-PT-05-LTLCardinality-02
FORMULA_NAME MedleyA-PT-05-LTLCardinality-03
FORMULA_NAME MedleyA-PT-05-LTLCardinality-04
FORMULA_NAME MedleyA-PT-05-LTLCardinality-05
FORMULA_NAME MedleyA-PT-05-LTLCardinality-06
FORMULA_NAME MedleyA-PT-05-LTLCardinality-07
FORMULA_NAME MedleyA-PT-05-LTLCardinality-08
FORMULA_NAME MedleyA-PT-05-LTLCardinality-09
FORMULA_NAME MedleyA-PT-05-LTLCardinality-10
FORMULA_NAME MedleyA-PT-05-LTLCardinality-11
FORMULA_NAME MedleyA-PT-05-LTLCardinality-12
FORMULA_NAME MedleyA-PT-05-LTLCardinality-13
FORMULA_NAME MedleyA-PT-05-LTLCardinality-14
FORMULA_NAME MedleyA-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717361681698

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-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 20:54:44] [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 20:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:44] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 20:54:44] [INFO ] Transformed 115 places.
[2024-06-02 20:54:44] [INFO ] Transformed 257 transitions.
[2024-06-02 20:54:44] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:44] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 230
Applied a total of 24 rules in 142 ms. Remains 103 /115 variables (removed 12) and now considering 230/254 (removed 24) transitions.
[2024-06-02 20:54:45] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
// Phase 1: matrix 229 rows 103 cols
[2024-06-02 20:54:45] [INFO ] Computed 20 invariants in 19 ms
[2024-06-02 20:54:45] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-02 20:54:45] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
[2024-06-02 20:54:45] [INFO ] Invariant cache hit.
[2024-06-02 20:54:45] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:54:45] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-06-02 20:54:45] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
[2024-06-02 20:54:45] [INFO ] Invariant cache hit.
[2024-06-02 20:54:46] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/115 places, 230/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1065 ms. Remains : 103/115 places, 230/254 transitions.
Support contains 28 out of 103 places after structural reductions.
[2024-06-02 20:54:46] [INFO ] Flatten gal took : 71 ms
[2024-06-02 20:54:46] [INFO ] Flatten gal took : 32 ms
[2024-06-02 20:54:46] [INFO ] Input system was already deterministic with 230 transitions.
Incomplete random walk after 10000 steps, including 755 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 20:54:47] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
[2024-06-02 20:54:47] [INFO ] Invariant cache hit.
[2024-06-02 20:54:47] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 20:54:47] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:54:47] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 20:54:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-02 20:54:47] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:47] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 20:54:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:54:48] [INFO ] After 110ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 20:54:48] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-06-02 20:54:48] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 29 ms.
Support contains 10 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 414 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 102 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 101 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 10 place count 96 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 15 place count 96 transition count 216
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 88 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 88 transition count 271
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 60 place count 88 transition count 244
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 71 place count 88 transition count 236
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 85 place count 77 transition count 233
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 77 transition count 232
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 77 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 76 transition count 251
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 76 transition count 251
Applied a total of 90 rules in 131 ms. Remains 76 /103 variables (removed 27) and now considering 251/230 (removed -21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 76/103 places, 251/230 transitions.
Incomplete random walk after 10000 steps, including 1024 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 251 rows 76 cols
[2024-06-02 20:54:49] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 20:54:49] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 20:54:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 20:54:49] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:54:49] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 20:54:49] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-02 20:54:49] [INFO ] After 103ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 20:54:49] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-06-02 20:54:49] [INFO ] After 458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 10 ms.
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 251/251 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 250
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 0 with 2 rules applied. Total rules applied 4 place count 74 transition count 260
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 74 transition count 291
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 13 place count 72 transition count 286
Applied a total of 13 rules in 39 ms. Remains 72 /76 variables (removed 4) and now considering 286/251 (removed -35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 72/76 places, 286/251 transitions.
Incomplete random walk after 10000 steps, including 1021 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 766477 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 766477 steps, saw 141143 distinct states, run finished after 3004 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 72 cols
[2024-06-02 20:54:52] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 20:54:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:54:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 20:54:52] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:53] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:54:53] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-02 20:54:53] [INFO ] After 70ms SMT Verify possible using 160 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:54:53] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-06-02 20:54:53] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 2 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 286/286 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 317
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 70 transition count 312
Applied a total of 9 rules in 22 ms. Remains 70 /72 variables (removed 2) and now considering 312/286 (removed -26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 70/72 places, 312/286 transitions.
Incomplete random walk after 10000 steps, including 1024 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1358217 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :{}
Probabilistic random walk after 1358217 steps, saw 244177 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 312 rows 70 cols
[2024-06-02 20:54:56] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 20:54:56] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:54:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 20:54:56] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:56] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:56] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-02 20:54:56] [INFO ] After 49ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:56] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-06-02 20:54:56] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 312/312 transitions.
Applied a total of 0 rules in 10 ms. Remains 70 /70 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 70/70 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 312/312 transitions.
Applied a total of 0 rules in 9 ms. Remains 70 /70 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-02 20:54:56] [INFO ] Invariant cache hit.
[2024-06-02 20:54:56] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 20:54:56] [INFO ] Invariant cache hit.
[2024-06-02 20:54:57] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-02 20:54:57] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-06-02 20:54:57] [INFO ] Redundant transitions in 62 ms returned []
[2024-06-02 20:54:57] [INFO ] Invariant cache hit.
[2024-06-02 20:54:57] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 972 ms. Remains : 70/70 places, 312/312 transitions.
Graph (trivial) has 32 edges and 70 vertex of which 5 / 70 are part of one of the 2 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 363 edges and 67 vertex of which 57 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 57 transition count 274
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 57 transition count 258
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 57 transition count 256
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 70 place count 55 transition count 238
Free-agglomeration rule (complex) applied 5 times with reduction of 19 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 55 transition count 249
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 104 place count 50 transition count 225
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 132 place count 50 transition count 225
Applied a total of 132 rules in 41 ms. Remains 50 /70 variables (removed 20) and now considering 225/312 (removed 87) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 50 cols
[2024-06-02 20:54:57] [INFO ] Computed 13 invariants in 2 ms
[2024-06-02 20:54:57] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:54:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:54:57] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-02 20:54:57] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:54:57] [INFO ] After 23ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:57] [INFO ] After 49ms 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 20:54:57] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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)||G(p1)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 101 transition count 228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 9 place count 95 transition count 216
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 95 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 86 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 86 transition count 289
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 60 place count 86 transition count 266
Applied a total of 60 rules in 43 ms. Remains 86 /103 variables (removed 17) and now considering 266/230 (removed -36) transitions.
[2024-06-02 20:54:58] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
// Phase 1: matrix 265 rows 86 cols
[2024-06-02 20:54:58] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:54:58] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-02 20:54:58] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 20:54:58] [INFO ] Invariant cache hit.
[2024-06-02 20:54:58] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 20:54:58] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-02 20:54:58] [INFO ] Redundant transitions in 67 ms returned []
[2024-06-02 20:54:58] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 20:54:58] [INFO ] Invariant cache hit.
[2024-06-02 20:54:59] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/103 places, 266/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 86/103 places, 266/230 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 259 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s29 1), p1:(OR (EQ s4 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 363 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Computed a total of 11 stabilizing places and 132 stable transitions
Computed a total of 11 stabilizing places and 132 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 407 steps, including 34 resets, run visited all 3 properties in 4 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 266/266 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-02 20:55:00] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 20:55:00] [INFO ] Invariant cache hit.
[2024-06-02 20:55:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 20:55:00] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 20:55:00] [INFO ] Invariant cache hit.
[2024-06-02 20:55:00] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 20:55:01] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-02 20:55:01] [INFO ] Redundant transitions in 53 ms returned []
[2024-06-02 20:55:01] [INFO ] Flow matrix only has 265 transitions (discarded 1 similar events)
[2024-06-02 20:55:01] [INFO ] Invariant cache hit.
[2024-06-02 20:55:01] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 684 ms. Remains : 86/86 places, 266/266 transitions.
Computed a total of 11 stabilizing places and 132 stable transitions
Computed a total of 11 stabilizing places and 132 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 9581 steps, including 865 resets, run visited all 3 properties in 44 ms. (steps per millisecond=217 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-00 finished in 4066 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(p0))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 218
Applied a total of 12 rules in 5 ms. Remains 97 /103 variables (removed 6) and now considering 218/230 (removed 12) transitions.
[2024-06-02 20:55:02] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 20:55:02] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 20:55:02] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:02] [INFO ] Invariant cache hit.
[2024-06-02 20:55:02] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:02] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 20:55:02] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 20:55:02] [INFO ] Invariant cache hit.
[2024-06-02 20:55:02] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/103 places, 218/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 97/103 places, 218/230 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s57 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-02 finished in 567 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(F((G(F(p1))||p0))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 220
Applied a total of 10 rules in 10 ms. Remains 98 /103 variables (removed 5) and now considering 220/230 (removed 10) transitions.
[2024-06-02 20:55:02] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 20:55:02] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:02] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:55:02] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 20:55:02] [INFO ] Invariant cache hit.
[2024-06-02 20:55:03] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:03] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-06-02 20:55:03] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 20:55:03] [INFO ] Invariant cache hit.
[2024-06-02 20:55:03] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/103 places, 220/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 98/103 places, 220/230 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s73 0) (EQ s81 1) (EQ s48 0) (EQ s4 1)), p1:(OR (EQ s13 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 755 ms.
Product exploration explored 100000 steps with 50000 reset in 697 ms.
Computed a total of 12 stabilizing places and 84 stable transitions
Graph (complete) has 495 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 12 stabilizing places and 84 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-05-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-05-LTLCardinality-03 finished in 2078 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((X(G(p1))&&p0)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 220
Applied a total of 10 rules in 4 ms. Remains 98 /103 variables (removed 5) and now considering 220/230 (removed 10) transitions.
[2024-06-02 20:55:04] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 20:55:04] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:05] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 20:55:05] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 20:55:05] [INFO ] Invariant cache hit.
[2024-06-02 20:55:05] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:05] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-02 20:55:05] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 20:55:05] [INFO ] Invariant cache hit.
[2024-06-02 20:55:05] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/103 places, 220/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 98/103 places, 220/230 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (EQ s80 0) (EQ s91 1)) (OR (EQ s91 0) (EQ s75 1))), p1:(OR (AND (EQ s18 0) (EQ s4 1)) (AND (EQ s75 0) (EQ s91 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-04 finished in 794 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((F((X(F(X(p0))) U p1))&&X(G(p0)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 227
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 9 place count 94 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 94 transition count 215
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 86 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 86 transition count 259
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 47 place count 86 transition count 247
Applied a total of 47 rules in 29 ms. Remains 86 /103 variables (removed 17) and now considering 247/230 (removed -17) transitions.
[2024-06-02 20:55:05] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
// Phase 1: matrix 246 rows 86 cols
[2024-06-02 20:55:05] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:55:05] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 20:55:05] [INFO ] Invariant cache hit.
[2024-06-02 20:55:05] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:55:06] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 20:55:06] [INFO ] Redundant transitions in 47 ms returned []
[2024-06-02 20:55:06] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 20:55:06] [INFO ] Invariant cache hit.
[2024-06-02 20:55:06] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/103 places, 247/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 539 ms. Remains : 86/103 places, 247/230 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s16 0) (EQ s56 1)), p0:(OR (EQ s68 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Computed a total of 10 stabilizing places and 117 stable transitions
Computed a total of 10 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 951 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 132 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 121 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 20:55:07] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 20:55:07] [INFO ] Invariant cache hit.
[2024-06-02 20:55:07] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:55:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-02 20:55:07] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:55:07] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:55:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:55:07] [INFO ] After 27ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:55:07] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-06-02 20:55:07] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 247/247 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 245
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 18 place count 86 transition count 417
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 50 place count 70 transition count 401
Drop transitions removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 2 with 163 rules applied. Total rules applied 213 place count 70 transition count 238
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 70 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 69 transition count 257
Applied a total of 215 rules in 32 ms. Remains 69 /86 variables (removed 17) and now considering 257/247 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 69/86 places, 257/247 transitions.
Incomplete random walk after 10000 steps, including 1060 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:55:07] [INFO ] Flow matrix only has 241 transitions (discarded 16 similar events)
// Phase 1: matrix 241 rows 69 cols
[2024-06-02 20:55:07] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:55:07] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:55:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 20:55:07] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:07] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:55:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 20:55:07] [INFO ] After 17ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 20:55:07] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 20:55:07] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 257/257 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 69/69 places, 257/257 transitions.
Incomplete random walk after 10000 steps, including 1072 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 237364 steps, run visited all 1 properties in 833 ms. (steps per millisecond=284 )
Probabilistic random walk after 237364 steps, saw 44352 distinct states, run finished after 834 ms. (steps per millisecond=284 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p1)]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 247/247 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2024-06-02 20:55:08] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
// Phase 1: matrix 246 rows 86 cols
[2024-06-02 20:55:08] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 20:55:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:55:09] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 20:55:09] [INFO ] Invariant cache hit.
[2024-06-02 20:55:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:55:09] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-02 20:55:09] [INFO ] Redundant transitions in 44 ms returned []
[2024-06-02 20:55:09] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 20:55:09] [INFO ] Invariant cache hit.
[2024-06-02 20:55:09] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 86/86 places, 247/247 transitions.
Computed a total of 10 stabilizing places and 117 stable transitions
Computed a total of 10 stabilizing places and 117 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 949 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 20:55:09] [INFO ] Flow matrix only has 246 transitions (discarded 1 similar events)
[2024-06-02 20:55:09] [INFO ] Invariant cache hit.
[2024-06-02 20:55:09] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:55:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 20:55:09] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:55:10] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:55:10] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:55:10] [INFO ] After 26ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:55:10] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-06-02 20:55:10] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 247/247 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 245
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 18 place count 86 transition count 417
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 50 place count 70 transition count 401
Drop transitions removed 163 transitions
Redundant transition composition rules discarded 163 transitions
Iterating global reduction 2 with 163 rules applied. Total rules applied 213 place count 70 transition count 238
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 70 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 69 transition count 257
Applied a total of 215 rules in 34 ms. Remains 69 /86 variables (removed 17) and now considering 257/247 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 69/86 places, 257/247 transitions.
Incomplete random walk after 10000 steps, including 1051 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 237364 steps, run visited all 2 properties in 595 ms. (steps per millisecond=398 )
Probabilistic random walk after 237364 steps, saw 44352 distinct states, run finished after 595 ms. (steps per millisecond=398 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 77 ms.
Product exploration explored 100000 steps with 7 reset in 89 ms.
Built C files in :
/tmp/ltsmin8621593640749606589
[2024-06-02 20:55:11] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2024-06-02 20:55:11] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:11] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2024-06-02 20:55:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:11] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2024-06-02 20:55:11] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:55:11] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8621593640749606589
Running compilation step : cd /tmp/ltsmin8621593640749606589;'/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 977 ms.
Running link step : cd /tmp/ltsmin8621593640749606589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8621593640749606589;'/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/stateBased11320460109587821628.hoa' '--buchi-type=spotba'
LTSmin run took 889 ms.
FORMULA MedleyA-PT-05-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-05-LTLCardinality-07 finished in 7990 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(((F(G(p1))||G(p2))&&p0)))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 222
Applied a total of 8 rules in 4 ms. Remains 99 /103 variables (removed 4) and now considering 222/230 (removed 8) transitions.
[2024-06-02 20:55:13] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 20:55:13] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:55:13] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:55:13] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 20:55:13] [INFO ] Invariant cache hit.
[2024-06-02 20:55:13] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 222/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 99/103 places, 222/230 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s63 0) (EQ s79 1)), p2:(OR (EQ s39 0) (EQ s48 1)), p1:(OR (EQ s3 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-09 finished in 671 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(X((p0&&X(p1)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 222
Applied a total of 8 rules in 3 ms. Remains 99 /103 variables (removed 4) and now considering 222/230 (removed 8) transitions.
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 20:55:14] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:55:14] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-02 20:55:14] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 20:55:14] [INFO ] Invariant cache hit.
[2024-06-02 20:55:14] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/103 places, 222/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 99/103 places, 222/230 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(OR (EQ s93 0) (EQ s76 1)), p0:(OR (EQ s81 0) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-13 finished in 654 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' '!((p0 U (p1&&X(G(!p0)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 230/230 transitions.
Graph (complete) has 516 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 227
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 8 place count 95 transition count 217
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 95 transition count 217
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 87 transition count 269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 87 transition count 265
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 42 place count 87 transition count 256
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 3 with 2 rules applied. Total rules applied 44 place count 86 transition count 255
Applied a total of 44 rules in 30 ms. Remains 86 /103 variables (removed 17) and now considering 255/230 (removed -25) transitions.
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
// Phase 1: matrix 254 rows 86 cols
[2024-06-02 20:55:15] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 20:55:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 20:55:15] [INFO ] Invariant cache hit.
[2024-06-02 20:55:15] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 20:55:15] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-06-02 20:55:15] [INFO ] Redundant transitions in 40 ms returned []
[2024-06-02 20:55:15] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 20:55:15] [INFO ] Invariant cache hit.
[2024-06-02 20:55:15] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/103 places, 255/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 86/103 places, 255/230 transitions.
Stuttering acceptance computed with spot in 229 ms :[p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(OR (EQ s54 0) (EQ s44 1)), p1:(OR (EQ s83 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLCardinality-15 finished in 757 ms.
All properties solved by simple procedures.
Total runtime 31330 ms.

BK_STOP 1717361717046

--------------------
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-05"
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-05, 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-171734926300022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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