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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-LTLFireability-00
FORMULA_NAME MedleyA-PT-18-LTLFireability-01
FORMULA_NAME MedleyA-PT-18-LTLFireability-02
FORMULA_NAME MedleyA-PT-18-LTLFireability-03
FORMULA_NAME MedleyA-PT-18-LTLFireability-04
FORMULA_NAME MedleyA-PT-18-LTLFireability-05
FORMULA_NAME MedleyA-PT-18-LTLFireability-06
FORMULA_NAME MedleyA-PT-18-LTLFireability-07
FORMULA_NAME MedleyA-PT-18-LTLFireability-08
FORMULA_NAME MedleyA-PT-18-LTLFireability-09
FORMULA_NAME MedleyA-PT-18-LTLFireability-10
FORMULA_NAME MedleyA-PT-18-LTLFireability-11
FORMULA_NAME MedleyA-PT-18-LTLFireability-12
FORMULA_NAME MedleyA-PT-18-LTLFireability-13
FORMULA_NAME MedleyA-PT-18-LTLFireability-14
FORMULA_NAME MedleyA-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717363334669

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:22:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:22:17] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-02 21:22:17] [INFO ] Transformed 252 places.
[2024-06-02 21:22:17] [INFO ] Transformed 543 transitions.
[2024-06-02 21:22:17] [INFO ] Found NUPN structural information;
[2024-06-02 21:22:17] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 212 transition count 475
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 212 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 211 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 211 transition count 474
Applied a total of 82 rules in 71 ms. Remains 211 /252 variables (removed 41) and now considering 474/541 (removed 67) transitions.
// Phase 1: matrix 474 rows 211 cols
[2024-06-02 21:22:18] [INFO ] Computed 7 invariants in 33 ms
[2024-06-02 21:22:18] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-02 21:22:18] [INFO ] Invariant cache hit.
[2024-06-02 21:22:18] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-06-02 21:22:18] [INFO ] Invariant cache hit.
[2024-06-02 21:22:19] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/252 places, 474/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1270 ms. Remains : 211/252 places, 474/541 transitions.
Support contains 54 out of 211 places after structural reductions.
[2024-06-02 21:22:19] [INFO ] Flatten gal took : 125 ms
[2024-06-02 21:22:19] [INFO ] Flatten gal took : 79 ms
[2024-06-02 21:22:20] [INFO ] Input system was already deterministic with 474 transitions.
Incomplete random walk after 10000 steps, including 383 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 34) seen :5
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2024-06-02 21:22:21] [INFO ] Invariant cache hit.
[2024-06-02 21:22:21] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2024-06-02 21:22:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:22:26] [INFO ] After 3845ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :24
[2024-06-02 21:22:26] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 7 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1039 ms
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2024-06-02 21:22:29] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 1 ms to minimize.
[2024-06-02 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1133 ms
[2024-06-02 21:22:29] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2024-06-02 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-02 21:22:29] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 1 ms to minimize.
[2024-06-02 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-06-02 21:22:31] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 1 ms to minimize.
[2024-06-02 21:22:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-06-02 21:22:31] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2024-06-02 21:22:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-06-02 21:22:32] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2024-06-02 21:22:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-06-02 21:22:32] [INFO ] After 10194ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :24
Attempting to minimize the solution found.
Minimization took 1360 ms.
[2024-06-02 21:22:33] [INFO ] After 11979ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :24
Fused 29 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 556 ms.
Support contains 45 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 474/474 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 211 transition count 439
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 74 place count 176 transition count 435
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 174 transition count 432
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 82 place count 171 transition count 432
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 82 place count 171 transition count 425
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 96 place count 164 transition count 425
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 103 place count 157 transition count 414
Iterating global reduction 4 with 7 rules applied. Total rules applied 110 place count 157 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 110 place count 157 transition count 413
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 156 transition count 413
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 158 place count 133 transition count 390
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 130 transition count 384
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 130 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 129 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 129 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 170 place count 127 transition count 386
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 182 place count 127 transition count 374
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 186 place count 123 transition count 370
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 123 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 194 place count 121 transition count 368
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 120 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 120 transition count 364
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 117 transition count 403
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 117 transition count 389
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 230 place count 103 transition count 389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 103 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 102 transition count 391
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 102 transition count 391
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 235 place count 101 transition count 389
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 101 transition count 389
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 237 place count 100 transition count 387
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 100 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 99 transition count 386
Applied a total of 239 rules in 220 ms. Remains 99 /211 variables (removed 112) and now considering 386/474 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 99/211 places, 386/474 transitions.
Incomplete random walk after 10000 steps, including 826 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 463381 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{0=1, 2=1, 3=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1, 13=1, 17=1, 18=1, 19=1, 20=1, 22=1, 23=1}
Probabilistic random walk after 463381 steps, saw 75385 distinct states, run finished after 3002 ms. (steps per millisecond=154 ) properties seen :16
Running SMT prover for 8 properties.
[2024-06-02 21:22:38] [INFO ] Flow matrix only has 368 transitions (discarded 18 similar events)
// Phase 1: matrix 368 rows 99 cols
[2024-06-02 21:22:38] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:22:38] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:22:38] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 21:22:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 21:22:39] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 21:22:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 21:22:39] [INFO ] After 238ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-06-02 21:22:39] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2024-06-02 21:22:39] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2024-06-02 21:22:39] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:22:39] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:22:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 410 ms
[2024-06-02 21:22:40] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2024-06-02 21:22:40] [INFO ] After 1080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 333 ms.
[2024-06-02 21:22:40] [INFO ] After 1909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 84 ms.
Support contains 20 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 386/386 transitions.
Graph (trivial) has 56 edges and 99 vertex of which 4 / 99 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 380
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 5 place count 95 transition count 375
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 90 transition count 375
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 86 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 86 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 84 transition count 365
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 37 place count 79 transition count 382
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 79 transition count 354
Free-agglomeration rule applied 12 times with reduction of 6 identical transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 79 transition count 336
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 111 place count 67 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 66 transition count 320
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 66 transition count 313
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 66 transition count 329
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 127 place count 64 transition count 326
Applied a total of 127 rules in 95 ms. Remains 64 /99 variables (removed 35) and now considering 326/386 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 64/99 places, 326/386 transitions.
Incomplete random walk after 10000 steps, including 1120 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 292 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 369 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 300 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Finished probabilistic random walk after 497222 steps, run visited all 8 properties in 1454 ms. (steps per millisecond=341 )
Probabilistic random walk after 497222 steps, saw 100239 distinct states, run finished after 1455 ms. (steps per millisecond=341 ) properties seen :8
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-18-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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) U (p0&&G(p1)))||(F(p3)&&p2))))'
Support contains 7 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 207 edges and 211 vertex of which 13 / 211 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 200 transition count 421
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 158 transition count 417
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 156 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 155 transition count 416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 93 place count 155 transition count 405
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 115 place count 144 transition count 405
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 126 place count 133 transition count 386
Iterating global reduction 4 with 11 rules applied. Total rules applied 137 place count 133 transition count 386
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 191 place count 106 transition count 359
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 197 place count 106 transition count 353
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 203 place count 100 transition count 317
Iterating global reduction 5 with 6 rules applied. Total rules applied 209 place count 100 transition count 317
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 96 transition count 305
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 96 transition count 305
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 245 place count 82 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 249 place count 82 transition count 365
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 253 place count 80 transition count 395
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 265 place count 80 transition count 383
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 269 place count 78 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 77 transition count 380
Applied a total of 270 rules in 112 ms. Remains 77 /211 variables (removed 134) and now considering 380/474 (removed 94) transitions.
[2024-06-02 21:22:43] [INFO ] Flow matrix only has 356 transitions (discarded 24 similar events)
// Phase 1: matrix 356 rows 77 cols
[2024-06-02 21:22:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:22:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 21:22:44] [INFO ] Flow matrix only has 356 transitions (discarded 24 similar events)
[2024-06-02 21:22:44] [INFO ] Invariant cache hit.
[2024-06-02 21:22:44] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-02 21:22:44] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2024-06-02 21:22:44] [INFO ] Redundant transitions in 33 ms returned []
[2024-06-02 21:22:44] [INFO ] Flow matrix only has 356 transitions (discarded 24 similar events)
[2024-06-02 21:22:44] [INFO ] Invariant cache hit.
[2024-06-02 21:22:44] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/211 places, 380/474 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 801 ms. Remains : 77/211 places, 380/474 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 403 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s70 1), p2:(AND (EQ s11 1) (EQ s23 1) (EQ s27 1) (EQ s41 1) (EQ s76 1)), p1:(EQ s53 1), p3:(AND (EQ s11 1) (EQ s23 1) (EQ s27 1) (EQ s41 1) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-02 finished in 1292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 9 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 201 transition count 458
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 201 transition count 458
Applied a total of 20 rules in 7 ms. Remains 201 /211 variables (removed 10) and now considering 458/474 (removed 16) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-02 21:22:45] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:22:45] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 21:22:45] [INFO ] Invariant cache hit.
[2024-06-02 21:22:45] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-06-02 21:22:45] [INFO ] Invariant cache hit.
[2024-06-02 21:22:45] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/211 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 875 ms. Remains : 201/211 places, 458/474 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-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: 2}]], initial=1, aps=[p0:(AND (OR (NEQ s18 1) (NEQ s33 1) (NEQ s52 1) (NEQ s59 1) (NEQ s198 1)) (OR (EQ s14 0) (EQ s51 0) (EQ s188 0) (EQ s197 0)))], 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][false, false, false]]
Product exploration explored 100000 steps with 3836 reset in 330 ms.
Product exploration explored 100000 steps with 3833 reset in 342 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1132040 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1132040 steps, saw 197299 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:22:49] [INFO ] Invariant cache hit.
[2024-06-02 21:22:49] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:22:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 21:22:50] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-06-02 21:22:51] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 282 ms.
[2024-06-02 21:22:51] [INFO ] After 1562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 458/458 transitions.
Graph (trivial) has 179 edges and 201 vertex of which 8 / 201 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 195 transition count 408
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 153 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 151 transition count 404
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 151 transition count 394
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 141 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 139 transition count 390
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 139 transition count 390
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 175 place count 109 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 178 place count 109 transition count 357
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 184 place count 103 transition count 321
Iterating global reduction 4 with 6 rules applied. Total rules applied 190 place count 103 transition count 321
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 100 transition count 313
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 100 transition count 313
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 220 place count 88 transition count 374
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 229 place count 88 transition count 365
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 238 place count 88 transition count 356
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 85 transition count 353
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 85 transition count 353
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 248 place count 83 transition count 351
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 249 place count 82 transition count 347
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 82 transition count 347
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 251 place count 81 transition count 345
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 81 transition count 345
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 256 place count 79 transition count 361
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 278 place count 79 transition count 339
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 342 place count 57 transition count 297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 343 place count 56 transition count 296
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 56 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 345 place count 56 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 55 transition count 314
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 373 place count 55 transition count 288
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 375 place count 55 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 377 place count 53 transition count 286
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 387 place count 53 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 389 place count 52 transition count 291
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 393 place count 52 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 395 place count 52 transition count 303
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 401 place count 50 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 402 place count 49 transition count 298
Applied a total of 402 rules in 140 ms. Remains 49 /201 variables (removed 152) and now considering 298/458 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 49/201 places, 298/458 transitions.
Finished random walk after 213 steps, including 28 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-04 finished in 6823 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) U (G(p1)&&X(p2))) U (G((X(p0) U (G(p1)&&X(p2))))||(p2&&(X(p0) U (G(p1)&&X(p2)))))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 459
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 459
Applied a total of 18 rules in 7 ms. Remains 202 /211 variables (removed 9) and now considering 459/474 (removed 15) transitions.
// Phase 1: matrix 459 rows 202 cols
[2024-06-02 21:22:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:22:51] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 21:22:51] [INFO ] Invariant cache hit.
[2024-06-02 21:22:52] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-06-02 21:22:52] [INFO ] Invariant cache hit.
[2024-06-02 21:22:52] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 459/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 839 ms. Remains : 202/211 places, 459/474 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(NEQ s115 1), p1:(EQ s19 1), p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-05 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(!p0)||F(p1))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 201 transition count 458
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 201 transition count 458
Applied a total of 20 rules in 7 ms. Remains 201 /211 variables (removed 10) and now considering 458/474 (removed 16) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-02 21:22:53] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:22:53] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 21:22:53] [INFO ] Invariant cache hit.
[2024-06-02 21:22:53] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-06-02 21:22:53] [INFO ] Invariant cache hit.
[2024-06-02 21:22:53] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/211 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 781 ms. Remains : 201/211 places, 458/474 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (NEQ s32 1) (NEQ s46 1) (NEQ s130 1) (NEQ s197 1)), p0:(EQ s102 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 451 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 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-18-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-06 finished in 1755 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&&X(X(X(F(p1))))))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 459
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 459
Applied a total of 18 rules in 5 ms. Remains 202 /211 variables (removed 9) and now considering 459/474 (removed 15) transitions.
// Phase 1: matrix 459 rows 202 cols
[2024-06-02 21:22:54] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:22:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 21:22:54] [INFO ] Invariant cache hit.
[2024-06-02 21:22:55] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-06-02 21:22:55] [INFO ] Invariant cache hit.
[2024-06-02 21:22:55] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 459/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 202/211 places, 459/474 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s200 1), p1:(NEQ s177 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-07 finished in 1137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 222 edges and 211 vertex of which 13 / 211 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 200 transition count 419
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 156 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 154 transition count 415
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 95 place count 154 transition count 405
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 115 place count 144 transition count 405
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 125 place count 134 transition count 387
Iterating global reduction 3 with 10 rules applied. Total rules applied 135 place count 134 transition count 387
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 195 place count 104 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 201 place count 104 transition count 351
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 207 place count 98 transition count 315
Iterating global reduction 4 with 6 rules applied. Total rules applied 213 place count 98 transition count 315
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 217 place count 94 transition count 303
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 94 transition count 303
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 251 place count 79 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 255 place count 79 transition count 363
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 77 transition count 393
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 285 place count 77 transition count 367
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 293 place count 73 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 294 place count 72 transition count 362
Applied a total of 294 rules in 81 ms. Remains 72 /211 variables (removed 139) and now considering 362/474 (removed 112) transitions.
[2024-06-02 21:22:55] [INFO ] Flow matrix only has 338 transitions (discarded 24 similar events)
// Phase 1: matrix 338 rows 72 cols
[2024-06-02 21:22:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:22:56] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:22:56] [INFO ] Flow matrix only has 338 transitions (discarded 24 similar events)
[2024-06-02 21:22:56] [INFO ] Invariant cache hit.
[2024-06-02 21:22:56] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-06-02 21:22:56] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-02 21:22:56] [INFO ] Redundant transitions in 7 ms returned []
[2024-06-02 21:22:56] [INFO ] Flow matrix only has 338 transitions (discarded 24 similar events)
[2024-06-02 21:22:56] [INFO ] Invariant cache hit.
[2024-06-02 21:22:56] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/211 places, 362/474 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 72/211 places, 362/474 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-08 finished in 961 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 12 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 201 transition count 458
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 201 transition count 458
Applied a total of 20 rules in 4 ms. Remains 201 /211 variables (removed 10) and now considering 458/474 (removed 16) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-02 21:22:56] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:22:56] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 21:22:56] [INFO ] Invariant cache hit.
[2024-06-02 21:22:57] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-06-02 21:22:57] [INFO ] Invariant cache hit.
[2024-06-02 21:22:57] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/211 places, 458/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 889 ms. Remains : 201/211 places, 458/474 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-09 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 (AND (EQ s13 1) (EQ s33 1) (EQ s41 1) (EQ s70 1) (EQ s198 1)) (AND (EQ s8 1) (EQ s156 1)) (AND (EQ s18 1) (EQ s26 1) (EQ s40 1) (EQ s63 1) (EQ s200...], 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]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-09 finished in 989 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 G(p1))||G(F(p2))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 216 edges and 211 vertex of which 13 / 211 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 200 transition count 421
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 158 transition count 417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 156 transition count 417
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 91 place count 156 transition count 408
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 109 place count 147 transition count 408
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 119 place count 137 transition count 391
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 137 transition count 391
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 189 place count 107 transition count 361
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 195 place count 107 transition count 355
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 201 place count 101 transition count 319
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 101 transition count 319
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 210 place count 98 transition count 311
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 98 transition count 311
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 243 place count 83 transition count 379
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 246 place count 83 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 82 transition count 391
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 270 place count 82 transition count 369
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 278 place count 78 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 77 transition count 364
Applied a total of 279 rules in 68 ms. Remains 77 /211 variables (removed 134) and now considering 364/474 (removed 110) transitions.
[2024-06-02 21:22:57] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
// Phase 1: matrix 344 rows 77 cols
[2024-06-02 21:22:57] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:22:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:22:58] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 21:22:58] [INFO ] Invariant cache hit.
[2024-06-02 21:22:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 21:22:58] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-02 21:22:58] [INFO ] Redundant transitions in 29 ms returned []
[2024-06-02 21:22:58] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 21:22:58] [INFO ] Invariant cache hit.
[2024-06-02 21:22:58] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/211 places, 364/474 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 678 ms. Remains : 77/211 places, 364/474 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s8 1), p1:(AND (EQ s5 1) (EQ s51 1)), p2:(OR (EQ s5 0) (EQ s47 0) (EQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 16548 reset in 298 ms.
Product exploration explored 100000 steps with 16591 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 323 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1720 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 466406 steps, run visited all 1 properties in 1085 ms. (steps per millisecond=429 )
Probabilistic random walk after 466406 steps, saw 99706 distinct states, run finished after 1085 ms. (steps per millisecond=429 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 23 factoid took 413 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 364/364 transitions.
Applied a total of 0 rules in 8 ms. Remains 77 /77 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2024-06-02 21:23:01] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 21:23:01] [INFO ] Invariant cache hit.
[2024-06-02 21:23:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 21:23:01] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 21:23:01] [INFO ] Invariant cache hit.
[2024-06-02 21:23:01] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 21:23:01] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 21:23:01] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 21:23:01] [INFO ] Flow matrix only has 344 transitions (discarded 20 similar events)
[2024-06-02 21:23:01] [INFO ] Invariant cache hit.
[2024-06-02 21:23:02] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 614 ms. Remains : 77/77 places, 364/364 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1715 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 466406 steps, run visited all 1 properties in 1109 ms. (steps per millisecond=420 )
Probabilistic random walk after 466406 steps, saw 99706 distinct states, run finished after 1109 ms. (steps per millisecond=420 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16649 reset in 167 ms.
Product exploration explored 100000 steps with 16666 reset in 186 ms.
Built C files in :
/tmp/ltsmin609079569760848531
[2024-06-02 21:23:04] [INFO ] Computing symmetric may disable matrix : 364 transitions.
[2024-06-02 21:23:04] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:23:04] [INFO ] Computing symmetric may enable matrix : 364 transitions.
[2024-06-02 21:23:04] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:23:04] [INFO ] Computing Do-Not-Accords matrix : 364 transitions.
[2024-06-02 21:23:04] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:23:04] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin609079569760848531
Running compilation step : cd /tmp/ltsmin609079569760848531;'/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 1582 ms.
Running link step : cd /tmp/ltsmin609079569760848531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin609079569760848531;'/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/stateBased5583113164008391371.hoa' '--buchi-type=spotba'
LTSmin run took 7479 ms.
FORMULA MedleyA-PT-18-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-18-LTLFireability-10 finished in 15723 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)||X(X(G(p1))))))'
Support contains 5 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 460
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 460
Applied a total of 18 rules in 6 ms. Remains 202 /211 variables (removed 9) and now considering 460/474 (removed 14) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-02 21:23:13] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:23:13] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 21:23:13] [INFO ] Invariant cache hit.
[2024-06-02 21:23:14] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-06-02 21:23:14] [INFO ] Invariant cache hit.
[2024-06-02 21:23:14] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 460/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 202/211 places, 460/474 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s85 1), p1:(AND (EQ s29 1) (EQ s46 1) (EQ s191 1) (EQ s198 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-13 finished in 1089 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||G(p1)||G(F(p2)))))'
Support contains 6 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 202 transition count 460
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 202 transition count 460
Applied a total of 18 rules in 5 ms. Remains 202 /211 variables (removed 9) and now considering 460/474 (removed 14) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-02 21:23:14] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 21:23:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 21:23:14] [INFO ] Invariant cache hit.
[2024-06-02 21:23:15] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-06-02 21:23:15] [INFO ] Invariant cache hit.
[2024-06-02 21:23:15] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 460/474 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 202/211 places, 460/474 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s145 0), p1:(AND (EQ s14 1) (EQ s65 1) (EQ s191 1) (EQ s198 1)), p2:(AND (EQ s145 1) (EQ s60 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-14 finished in 1534 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)))||G(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 474/474 transitions.
Graph (trivial) has 219 edges and 211 vertex of which 9 / 211 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 203 transition count 422
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 159 transition count 418
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 157 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 156 transition count 417
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 97 place count 156 transition count 406
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 119 place count 145 transition count 406
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 130 place count 134 transition count 387
Iterating global reduction 4 with 11 rules applied. Total rules applied 141 place count 134 transition count 387
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 199 place count 105 transition count 358
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 105 transition count 352
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 211 place count 99 transition count 316
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 99 transition count 316
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 221 place count 95 transition count 304
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 95 transition count 304
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 257 place count 79 transition count 388
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 268 place count 79 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 270 place count 78 transition count 392
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 274 place count 78 transition count 388
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 282 place count 74 transition count 384
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 73 transition count 383
Applied a total of 283 rules in 61 ms. Remains 73 /211 variables (removed 138) and now considering 383/474 (removed 91) transitions.
[2024-06-02 21:23:16] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
// Phase 1: matrix 360 rows 73 cols
[2024-06-02 21:23:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:23:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:23:16] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2024-06-02 21:23:16] [INFO ] Invariant cache hit.
[2024-06-02 21:23:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-06-02 21:23:16] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-02 21:23:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 21:23:16] [INFO ] Flow matrix only has 360 transitions (discarded 23 similar events)
[2024-06-02 21:23:16] [INFO ] Invariant cache hit.
[2024-06-02 21:23:16] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/211 places, 383/474 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 73/211 places, 383/474 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (OR (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s48 1), p1:(NEQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-15 finished in 832 ms.
All properties solved by simple procedures.
Total runtime 59557 ms.

BK_STOP 1717363398191

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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-18"
export BK_EXAMINATION="LTLFireability"
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-18, examination is LTLFireability"
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-171734926500088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;