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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K 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.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 107K 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-10-LTLCardinality-00
FORMULA_NAME MedleyA-PT-10-LTLCardinality-01
FORMULA_NAME MedleyA-PT-10-LTLCardinality-02
FORMULA_NAME MedleyA-PT-10-LTLCardinality-03
FORMULA_NAME MedleyA-PT-10-LTLCardinality-04
FORMULA_NAME MedleyA-PT-10-LTLCardinality-05
FORMULA_NAME MedleyA-PT-10-LTLCardinality-06
FORMULA_NAME MedleyA-PT-10-LTLCardinality-07
FORMULA_NAME MedleyA-PT-10-LTLCardinality-08
FORMULA_NAME MedleyA-PT-10-LTLCardinality-09
FORMULA_NAME MedleyA-PT-10-LTLCardinality-10
FORMULA_NAME MedleyA-PT-10-LTLCardinality-11
FORMULA_NAME MedleyA-PT-10-LTLCardinality-12
FORMULA_NAME MedleyA-PT-10-LTLCardinality-13
FORMULA_NAME MedleyA-PT-10-LTLCardinality-14
FORMULA_NAME MedleyA-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362224780

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-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:03:47] [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:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:03:47] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-02 21:03:47] [INFO ] Transformed 149 places.
[2024-06-02 21:03:47] [INFO ] Transformed 340 transitions.
[2024-06-02 21:03:47] [INFO ] Found NUPN structural information;
[2024-06-02 21:03:47] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 113 transition count 302
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 113 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 113 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 111 transition count 291
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 111 transition count 291
Applied a total of 75 rules in 118 ms. Remains 111 /149 variables (removed 38) and now considering 291/340 (removed 49) transitions.
// Phase 1: matrix 291 rows 111 cols
[2024-06-02 21:03:48] [INFO ] Computed 10 invariants in 18 ms
[2024-06-02 21:03:48] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-02 21:03:48] [INFO ] Invariant cache hit.
[2024-06-02 21:03:48] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-06-02 21:03:48] [INFO ] Invariant cache hit.
[2024-06-02 21:03:49] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 64 transitions.
Found 64 dead transitions using SMT.
Drop transitions removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/149 places, 227/340 transitions.
Applied a total of 0 rules in 14 ms. Remains 111 /111 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1076 ms. Remains : 111/149 places, 227/340 transitions.
Support contains 36 out of 111 places after structural reductions.
[2024-06-02 21:03:49] [INFO ] Flatten gal took : 77 ms
[2024-06-02 21:03:49] [INFO ] Flatten gal took : 35 ms
[2024-06-02 21:03:49] [INFO ] Input system was already deterministic with 227 transitions.
Incomplete random walk after 10000 steps, including 444 resets, run finished after 730 ms. (steps per millisecond=13 ) properties (out of 23) seen :15
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 227 rows 111 cols
[2024-06-02 21:03:51] [INFO ] Computed 10 invariants in 13 ms
[2024-06-02 21:03:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:03:51] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:03:51] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 21:03:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-02 21:03:51] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-02 21:03:51] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 21:03:51] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 7 ms to minimize.
[2024-06-02 21:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-06-02 21:03:51] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-06-02 21:03:52] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 4 properties in 33 ms.
Support contains 9 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 110 transition count 213
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 98 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 97 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 97 transition count 208
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 34 place count 95 transition count 208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 43 place count 86 transition count 196
Iterating global reduction 3 with 9 rules applied. Total rules applied 52 place count 86 transition count 196
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 52 place count 86 transition count 194
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 56 place count 84 transition count 194
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 80 transition count 185
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 80 transition count 185
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 63 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 63 transition count 168
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 60 transition count 163
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 60 transition count 163
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 120 place count 52 transition count 222
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 182 place count 52 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 186 place count 50 transition count 183
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 50 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 190 place count 48 transition count 181
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 48 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 194 place count 46 transition count 182
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 46 transition count 182
Applied a total of 195 rules in 129 ms. Remains 46 /111 variables (removed 65) and now considering 182/227 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 46/111 places, 182/227 transitions.
Finished random walk after 5263 steps, including 923 resets, run visited all 4 properties in 52 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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)||G(p1))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 109 transition count 214
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 98 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 97 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 27 place count 97 transition count 208
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 33 place count 94 transition count 208
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 44 place count 83 transition count 194
Iterating global reduction 3 with 11 rules applied. Total rules applied 55 place count 83 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 55 place count 83 transition count 192
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 59 place count 81 transition count 192
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 77 transition count 183
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 77 transition count 183
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 99 place count 60 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 60 transition count 165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 57 transition count 160
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 57 transition count 160
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 126 place count 48 transition count 214
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 172 place count 48 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
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 176 place count 46 transition count 191
Applied a total of 176 rules in 56 ms. Remains 46 /111 variables (removed 65) and now considering 191/227 (removed 36) transitions.
// Phase 1: matrix 191 rows 46 cols
[2024-06-02 21:03:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:03:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:03:52] [INFO ] Invariant cache hit.
[2024-06-02 21:03:52] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-02 21:03:52] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 21:03:52] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 21:03:52] [INFO ] Invariant cache hit.
[2024-06-02 21:03:53] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/111 places, 191/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 46/111 places, 191/227 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 291 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s28 0) (EQ s3 1)), p1:(AND (EQ s43 0) (EQ s14 1))], nbAcceptance=2, 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-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-00 finished in 874 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(p0)))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 91 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 91 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 17 ms. Remains 88 /111 variables (removed 23) and now considering 182/227 (removed 45) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 21:03:53] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:03:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:03:53] [INFO ] Invariant cache hit.
[2024-06-02 21:03:53] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 21:03:53] [INFO ] Invariant cache hit.
[2024-06-02 21:03:53] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 88/111 places, 182/227 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s39 1) (EQ s18 0) (EQ s70 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 350 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 39 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-01 finished in 1273 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(p0) U (p1 U (G(p2) U p3))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 109 transition count 216
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 23 place count 100 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 98 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 25 place count 98 transition count 209
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 95 transition count 209
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 44 place count 82 transition count 192
Iterating global reduction 3 with 13 rules applied. Total rules applied 57 place count 82 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 57 place count 82 transition count 190
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 61 place count 80 transition count 190
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 65 place count 76 transition count 180
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 76 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 75 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 75 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 74 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 74 transition count 175
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 105 place count 57 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 109 place count 57 transition count 156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 112 place count 54 transition count 151
Iterating global reduction 4 with 3 rules applied. Total rules applied 115 place count 54 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
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 125 place count 49 transition count 175
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 139 place count 49 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 47 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 46 transition count 183
Applied a total of 144 rules in 85 ms. Remains 46 /111 variables (removed 65) and now considering 183/227 (removed 44) transitions.
// Phase 1: matrix 183 rows 46 cols
[2024-06-02 21:03:54] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:03:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:03:54] [INFO ] Invariant cache hit.
[2024-06-02 21:03:54] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:03:55] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 21:03:55] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 21:03:55] [INFO ] Invariant cache hit.
[2024-06-02 21:03:55] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/111 places, 183/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 46/111 places, 183/227 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), true, (NOT p0), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p3) (NOT p0) p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s23 1), p0:(OR (EQ s44 0) (EQ s42 1) (NOT (OR (EQ s25 0) (EQ s37 1)))), p2:(AND (EQ s23 1) (OR (EQ s44 0) (EQ s42 1))), p1:(OR (EQ s25 0) (EQ s37 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-03 finished in 884 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 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 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.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 109 transition count 214
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 98 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 97 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 97 transition count 210
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 29 place count 96 transition count 210
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 41 place count 84 transition count 195
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 84 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 53 place count 84 transition count 193
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 57 place count 82 transition count 193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 61 place count 78 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 78 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 77 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 77 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 76 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 76 transition count 177
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 101 place count 59 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 105 place count 59 transition count 158
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 55 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 55 transition count 150
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 127 place count 48 transition count 187
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 155 place count 48 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 46 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 45 transition count 181
Applied a total of 160 rules in 96 ms. Remains 45 /111 variables (removed 66) and now considering 181/227 (removed 46) transitions.
// Phase 1: matrix 181 rows 45 cols
[2024-06-02 21:03:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:03:56] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-02 21:03:56] [INFO ] Invariant cache hit.
[2024-06-02 21:03:56] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 21:03:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-06-02 21:03:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:03:56] [INFO ] Invariant cache hit.
[2024-06-02 21:03:56] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/111 places, 181/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 45/111 places, 181/227 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-06 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:(OR (EQ s4 0) (EQ s43 1)), p1:(AND (EQ s14 0) (EQ s36 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 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-06 finished in 1178 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((G(p0)||F(p1)))))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 91 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 91 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 9 ms. Remains 88 /111 variables (removed 23) and now considering 182/227 (removed 45) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 21:03:56] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:03:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:03:56] [INFO ] Invariant cache hit.
[2024-06-02 21:03:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 21:03:57] [INFO ] Invariant cache hit.
[2024-06-02 21:03:57] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 88/111 places, 182/227 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s26 1), p1:(AND (NEQ s26 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-07 finished in 565 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) U p2) U X(p0)))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 91 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 91 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 9 ms. Remains 88 /111 variables (removed 23) and now considering 182/227 (removed 45) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 21:03:57] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:03:57] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:03:57] [INFO ] Invariant cache hit.
[2024-06-02 21:03:57] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-06-02 21:03:57] [INFO ] Invariant cache hit.
[2024-06-02 21:03:57] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 88/111 places, 182/227 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND p2 p1 (NOT p0)), true, (NOT p2), p1]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s39 0) (EQ s20 1)), p1:(OR (EQ s9 0) (EQ s45 1)), p0:(OR (EQ s68 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 350 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-08 finished in 1201 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((X(X(p1))||p0)))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 96 transition count 208
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 96 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 96 transition count 206
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 90 transition count 189
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 90 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 88 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 88 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 87 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 87 transition count 181
Applied a total of 50 rules in 6 ms. Remains 87 /111 variables (removed 24) and now considering 181/227 (removed 46) transitions.
// Phase 1: matrix 181 rows 87 cols
[2024-06-02 21:03:58] [INFO ] Computed 10 invariants in 12 ms
[2024-06-02 21:03:58] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:03:58] [INFO ] Invariant cache hit.
[2024-06-02 21:03:58] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 21:03:58] [INFO ] Invariant cache hit.
[2024-06-02 21:03:58] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/111 places, 181/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 87/111 places, 181/227 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s40 1)), p1:(AND (EQ s40 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 38 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-10 finished in 578 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 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 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.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 109 transition count 213
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 97 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 97 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 93 transition count 207
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 45 place count 83 transition count 194
Iterating global reduction 2 with 10 rules applied. Total rules applied 55 place count 83 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 55 place count 83 transition count 192
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 81 transition count 192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 76 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 76 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 75 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 75 transition count 176
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 100 place count 60 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 60 transition count 158
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 56 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 56 transition count 150
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 128 place count 48 transition count 187
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 156 place count 48 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
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 160 place count 46 transition count 180
Applied a total of 160 rules in 32 ms. Remains 46 /111 variables (removed 65) and now considering 180/227 (removed 47) transitions.
// Phase 1: matrix 180 rows 46 cols
[2024-06-02 21:03:59] [INFO ] Computed 9 invariants in 6 ms
[2024-06-02 21:03:59] [INFO ] Implicit Places using invariants in 78 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/111 places, 180/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 45/111 places, 180/227 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-11 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:(OR (EQ s32 0) (EQ s17 1)), p1:(OR (EQ s19 0) (EQ s27 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 12310 reset in 345 ms.
Product exploration explored 100000 steps with 12317 reset in 400 ms.
Computed a total of 11 stabilizing places and 104 stable transitions
Computed a total of 11 stabilizing places and 104 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 6481 steps, including 793 resets, run visited all 2 properties in 72 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 45 cols
[2024-06-02 21:04:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:04:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:04:01] [INFO ] Invariant cache hit.
[2024-06-02 21:04:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-02 21:04:01] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 21:04:01] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:04:01] [INFO ] Invariant cache hit.
[2024-06-02 21:04:01] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 45/45 places, 180/180 transitions.
Computed a total of 11 stabilizing places and 104 stable transitions
Computed a total of 11 stabilizing places and 104 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1234 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 300 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:04:01] [INFO ] Invariant cache hit.
[2024-06-02 21:04:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:04:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 21:04:01] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:04:01] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:04:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-02 21:04:01] [INFO ] After 23ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:04:01] [INFO ] After 39ms 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 21:04:01] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12314 reset in 262 ms.
Product exploration explored 100000 steps with 12346 reset in 494 ms.
Built C files in :
/tmp/ltsmin5731750446174423220
[2024-06-02 21:04:03] [INFO ] Computing symmetric may disable matrix : 180 transitions.
[2024-06-02 21:04:03] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:03] [INFO ] Computing symmetric may enable matrix : 180 transitions.
[2024-06-02 21:04:03] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:03] [INFO ] Computing Do-Not-Accords matrix : 180 transitions.
[2024-06-02 21:04:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:03] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5731750446174423220
Running compilation step : cd /tmp/ltsmin5731750446174423220;'/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 1018 ms.
Running link step : cd /tmp/ltsmin5731750446174423220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5731750446174423220;'/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/stateBased12381022662549496203.hoa' '--buchi-type=spotba'
LTSmin run took 371 ms.
FORMULA MedleyA-PT-10-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLCardinality-11 finished in 5715 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((X(p1)||p0))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 100 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 100 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 100 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 97 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 97 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 96 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 96 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 95 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 95 transition count 196
Applied a total of 33 rules in 5 ms. Remains 95 /111 variables (removed 16) and now considering 196/227 (removed 31) transitions.
// Phase 1: matrix 196 rows 95 cols
[2024-06-02 21:04:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:04:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:04:04] [INFO ] Invariant cache hit.
[2024-06-02 21:04:05] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 21:04:05] [INFO ] Invariant cache hit.
[2024-06-02 21:04:05] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/111 places, 196/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 95/111 places, 196/227 transitions.
Stuttering acceptance computed with spot in 134 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-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s72 1)), p1:(AND (EQ s70 0) (EQ s6 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 374 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-12 finished in 935 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 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 109 transition count 212
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 96 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 29 place count 96 transition count 207
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 93 transition count 207
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 47 place count 81 transition count 191
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 81 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 81 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 80 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 76 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 76 transition count 181
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 103 place count 58 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 58 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 54 transition count 153
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 54 transition count 153
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 131 place count 46 transition count 194
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 161 place count 46 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 163 place count 45 transition count 175
Applied a total of 163 rules in 34 ms. Remains 45 /111 variables (removed 66) and now considering 175/227 (removed 52) transitions.
// Phase 1: matrix 175 rows 45 cols
[2024-06-02 21:04:05] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:04:05] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:04:05] [INFO ] Invariant cache hit.
[2024-06-02 21:04:05] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:04:06] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 21:04:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:04:06] [INFO ] Invariant cache hit.
[2024-06-02 21:04:06] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/111 places, 175/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 45/111 places, 175/227 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14032 reset in 292 ms.
Product exploration explored 100000 steps with 14019 reset in 308 ms.
Computed a total of 6 stabilizing places and 68 stable transitions
Computed a total of 6 stabilizing places and 68 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1408 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 320 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41329 steps, run visited all 1 properties in 117 ms. (steps per millisecond=353 )
Probabilistic random walk after 41329 steps, saw 10126 distinct states, run finished after 117 ms. (steps per millisecond=353 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 21:04:07] [INFO ] Invariant cache hit.
[2024-06-02 21:04:07] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 21:04:07] [INFO ] Invariant cache hit.
[2024-06-02 21:04:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:04:07] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-06-02 21:04:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:04:07] [INFO ] Invariant cache hit.
[2024-06-02 21:04:07] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 45/45 places, 175/175 transitions.
Computed a total of 6 stabilizing places and 68 stable transitions
Computed a total of 6 stabilizing places and 68 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 3709 steps, including 519 resets, run visited all 1 properties in 12 ms. (steps per millisecond=309 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13982 reset in 280 ms.
Product exploration explored 100000 steps with 14058 reset in 301 ms.
Built C files in :
/tmp/ltsmin12745564145065459625
[2024-06-02 21:04:08] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2024-06-02 21:04:08] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:08] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2024-06-02 21:04:08] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:08] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
[2024-06-02 21:04:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:08] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12745564145065459625
Running compilation step : cd /tmp/ltsmin12745564145065459625;'/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 636 ms.
Running link step : cd /tmp/ltsmin12745564145065459625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12745564145065459625;'/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/stateBased13475446865477607212.hoa' '--buchi-type=spotba'
LTSmin run took 669 ms.
FORMULA MedleyA-PT-10-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLCardinality-14 finished in 4409 ms.
All properties solved by simple procedures.
Total runtime 22512 ms.

BK_STOP 1717362251447

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

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