Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540300620.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Peterson-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K Mar 5 18:23 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 Peterson-PT-4-LTLFireability-00
FORMULA_NAME Peterson-PT-4-LTLFireability-01
FORMULA_NAME Peterson-PT-4-LTLFireability-02
FORMULA_NAME Peterson-PT-4-LTLFireability-03
FORMULA_NAME Peterson-PT-4-LTLFireability-04
FORMULA_NAME Peterson-PT-4-LTLFireability-05
FORMULA_NAME Peterson-PT-4-LTLFireability-06
FORMULA_NAME Peterson-PT-4-LTLFireability-07
FORMULA_NAME Peterson-PT-4-LTLFireability-08
FORMULA_NAME Peterson-PT-4-LTLFireability-09
FORMULA_NAME Peterson-PT-4-LTLFireability-10
FORMULA_NAME Peterson-PT-4-LTLFireability-11
FORMULA_NAME Peterson-PT-4-LTLFireability-12
FORMULA_NAME Peterson-PT-4-LTLFireability-13
FORMULA_NAME Peterson-PT-4-LTLFireability-14
FORMULA_NAME Peterson-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679136581399

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 10:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 10:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:49:45] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-18 10:49:45] [INFO ] Transformed 480 places.
[2023-03-18 10:49:45] [INFO ] Transformed 690 transitions.
[2023-03-18 10:49:45] [INFO ] Found NUPN structural information;
[2023-03-18 10:49:45] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-18 10:49:45] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-4-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 463 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 40 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:49:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 10:49:46] [INFO ] Computed 19 place invariants in 47 ms
[2023-03-18 10:49:46] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-18 10:49:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:49:46] [INFO ] Invariant cache hit.
[2023-03-18 10:49:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:49:47] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
[2023-03-18 10:49:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:49:47] [INFO ] Invariant cache hit.
[2023-03-18 10:49:48] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2117 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 463 out of 480 places after structural reductions.
[2023-03-18 10:49:48] [INFO ] Flatten gal took : 188 ms
[2023-03-18 10:49:48] [INFO ] Flatten gal took : 102 ms
[2023-03-18 10:49:49] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=10 ) properties (out of 40) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 10:49:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:49:50] [INFO ] Invariant cache hit.
[2023-03-18 10:49:51] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 10:49:51] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 10:49:51] [INFO ] After 512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-18 10:49:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:49:52] [INFO ] After 317ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 10:49:52] [INFO ] After 1264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 10:49:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 10:49:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 10:49:53] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 10:49:53] [INFO ] After 423ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 10:49:54] [INFO ] Deduced a trap composed of 21 places in 482 ms of which 18 ms to minimize.
[2023-03-18 10:49:54] [INFO ] Deduced a trap composed of 76 places in 474 ms of which 2 ms to minimize.
[2023-03-18 10:49:55] [INFO ] Deduced a trap composed of 13 places in 384 ms of which 4 ms to minimize.
[2023-03-18 10:49:55] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 3 ms to minimize.
[2023-03-18 10:49:55] [INFO ] Deduced a trap composed of 14 places in 383 ms of which 2 ms to minimize.
[2023-03-18 10:49:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2291 ms
[2023-03-18 10:49:56] [INFO ] Deduced a trap composed of 128 places in 405 ms of which 1 ms to minimize.
[2023-03-18 10:49:56] [INFO ] Deduced a trap composed of 47 places in 356 ms of which 2 ms to minimize.
[2023-03-18 10:49:57] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 1 ms to minimize.
[2023-03-18 10:49:57] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 1 ms to minimize.
[2023-03-18 10:49:57] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 1 ms to minimize.
[2023-03-18 10:49:58] [INFO ] Deduced a trap composed of 91 places in 203 ms of which 1 ms to minimize.
[2023-03-18 10:49:58] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 1 ms to minimize.
[2023-03-18 10:49:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2313 ms
[2023-03-18 10:49:58] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 1 ms to minimize.
[2023-03-18 10:49:59] [INFO ] Deduced a trap composed of 57 places in 328 ms of which 1 ms to minimize.
[2023-03-18 10:49:59] [INFO ] Deduced a trap composed of 58 places in 301 ms of which 1 ms to minimize.
[2023-03-18 10:49:59] [INFO ] Deduced a trap composed of 80 places in 321 ms of which 1 ms to minimize.
[2023-03-18 10:50:00] [INFO ] Deduced a trap composed of 80 places in 322 ms of which 2 ms to minimize.
[2023-03-18 10:50:00] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 1 ms to minimize.
[2023-03-18 10:50:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2242 ms
[2023-03-18 10:50:01] [INFO ] Deduced a trap composed of 91 places in 334 ms of which 1 ms to minimize.
[2023-03-18 10:50:01] [INFO ] Deduced a trap composed of 92 places in 338 ms of which 2 ms to minimize.
[2023-03-18 10:50:01] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2023-03-18 10:50:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1060 ms
[2023-03-18 10:50:02] [INFO ] Deduced a trap composed of 48 places in 352 ms of which 1 ms to minimize.
[2023-03-18 10:50:02] [INFO ] Deduced a trap composed of 44 places in 369 ms of which 1 ms to minimize.
[2023-03-18 10:50:03] [INFO ] Deduced a trap composed of 47 places in 361 ms of which 1 ms to minimize.
[2023-03-18 10:50:03] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 1 ms to minimize.
[2023-03-18 10:50:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1694 ms
[2023-03-18 10:50:03] [INFO ] Deduced a trap composed of 88 places in 327 ms of which 1 ms to minimize.
[2023-03-18 10:50:04] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 1 ms to minimize.
[2023-03-18 10:50:04] [INFO ] Deduced a trap composed of 88 places in 320 ms of which 1 ms to minimize.
[2023-03-18 10:50:05] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 1 ms to minimize.
[2023-03-18 10:50:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1598 ms
[2023-03-18 10:50:05] [INFO ] After 12095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 651 ms.
[2023-03-18 10:50:05] [INFO ] After 13776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 191 place count 480 transition count 499
Reduce places removed 191 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 193 rules applied. Total rules applied 384 place count 289 transition count 497
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 386 place count 287 transition count 497
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 386 place count 287 transition count 397
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 586 place count 187 transition count 397
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 620 place count 170 transition count 380
Applied a total of 620 rules in 133 ms. Remains 170 /480 variables (removed 310) and now considering 380/690 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 170/480 places, 380/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 10:50:06] [INFO ] Flow matrix only has 320 transitions (discarded 60 similar events)
// Phase 1: matrix 320 rows 170 cols
[2023-03-18 10:50:06] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-18 10:50:06] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 10:50:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 10:50:06] [INFO ] After 164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-18 10:50:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:07] [INFO ] After 100ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:07] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 10:50:07] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 10:50:07] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:07] [INFO ] After 148ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:07] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2023-03-18 10:50:07] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2023-03-18 10:50:08] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-18 10:50:08] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2023-03-18 10:50:08] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 9 ms to minimize.
[2023-03-18 10:50:08] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2023-03-18 10:50:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1048 ms
[2023-03-18 10:50:08] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-03-18 10:50:08] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 885 ms
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-18 10:50:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 326 ms
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 551 ms
[2023-03-18 10:50:10] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 3 ms to minimize.
[2023-03-18 10:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-18 10:50:10] [INFO ] After 3159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-18 10:50:10] [INFO ] After 3670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 10 ms.
Support contains 7 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 380/380 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 170 transition count 379
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 379
Applied a total of 2 rules in 23 ms. Remains 169 /170 variables (removed 1) and now considering 379/380 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 169/170 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 542232 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 542232 steps, saw 90803 distinct states, run finished after 3003 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-18 10:50:14] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
// Phase 1: matrix 319 rows 169 cols
[2023-03-18 10:50:14] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-18 10:50:14] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 10:50:14] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 10:50:14] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-18 10:50:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:14] [INFO ] After 102ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:14] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 10:50:14] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 10:50:14] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:14] [INFO ] After 86ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:14] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-18 10:50:14] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 3 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 5 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2023-03-18 10:50:15] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 9 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1304 ms
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 363 ms
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-18 10:50:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 479 ms
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 393 ms
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-18 10:50:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-03-18 10:50:17] [INFO ] After 3012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-18 10:50:17] [INFO ] After 3394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 7 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 379/379 transitions.
Applied a total of 0 rules in 16 ms. Remains 169 /169 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 169/169 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 379/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-18 10:50:17] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-18 10:50:17] [INFO ] Invariant cache hit.
[2023-03-18 10:50:18] [INFO ] Implicit Places using invariants in 262 ms returned [159, 160, 161, 162, 163]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 266 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/169 places, 379/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 300 ms. Remains : 164/169 places, 379/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 413226 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 413226 steps, saw 69323 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-18 10:50:21] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
// Phase 1: matrix 319 rows 164 cols
[2023-03-18 10:50:21] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 10:50:21] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 10:50:21] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-18 10:50:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:22] [INFO ] After 95ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:22] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 10:50:22] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:22] [INFO ] After 88ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:22] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-18 10:50:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-18 10:50:22] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2023-03-18 10:50:22] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-18 10:50:22] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2023-03-18 10:50:22] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-18 10:50:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 577 ms
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1449 ms
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2023-03-18 10:50:24] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-03-18 10:50:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2023-03-18 10:50:25] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2023-03-18 10:50:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 293 ms
[2023-03-18 10:50:25] [INFO ] After 2852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-18 10:50:25] [INFO ] After 3243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 31 ms.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 379/379 transitions.
Applied a total of 0 rules in 14 ms. Remains 164 /164 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 164/164 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 379/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2023-03-18 10:50:25] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-18 10:50:25] [INFO ] Invariant cache hit.
[2023-03-18 10:50:25] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-18 10:50:25] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-18 10:50:25] [INFO ] Invariant cache hit.
[2023-03-18 10:50:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:26] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-18 10:50:26] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 10:50:26] [INFO ] Flow matrix only has 319 transitions (discarded 60 similar events)
[2023-03-18 10:50:26] [INFO ] Invariant cache hit.
[2023-03-18 10:50:26] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1009 ms. Remains : 164/164 places, 379/379 transitions.
Graph (trivial) has 276 edges and 164 vertex of which 97 / 164 are part of one of the 20 SCC in 5 ms
Free SCC test removed 77 places
Drop transitions removed 154 transitions
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 228 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 1 place count 87 transition count 137
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 73 transition count 137
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 0 with 4 rules applied. Total rules applied 33 place count 71 transition count 135
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 53 place count 59 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 30 edges and 59 vertex of which 22 / 59 are part of one of the 4 SCC in 0 ms
Free SCC test removed 18 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 57 place count 41 transition count 143
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (trivial) has 40 edges and 39 vertex of which 8 / 39 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 25 rules applied. Total rules applied 82 place count 35 transition count 121
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 118 place count 35 transition count 85
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 35 transition count 77
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 35 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 33 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 133 place count 33 transition count 75
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 33 transition count 74
Applied a total of 134 rules in 37 ms. Remains 33 /164 variables (removed 131) and now considering 74/379 (removed 305) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 74 rows 33 cols
[2023-03-18 10:50:26] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-18 10:50:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-18 10:50:26] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-18 10:50:26] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:26] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 10:50:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-18 10:50:26] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 10:50:26] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 10:50:26] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA Peterson-PT-4-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 10:50:27] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 10:50:27] [INFO ] Implicit Places using invariants in 224 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 227 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 250 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (EQ s333 1) (EQ s420 1)) (AND (EQ s337 1) (EQ s469 1)) (AND (EQ s345 1) (EQ s417 1)) (AND (EQ s340 1) (EQ s419 1)) (AND (EQ s299 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20454 reset in 792 ms.
Stack based approach found an accepted trace after 92490 steps with 18902 reset with depth 11 and stack size 11 in 642 ms.
FORMULA Peterson-PT-4-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-00 finished in 2093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(G((G(X(p0)) U p1))))&&X(p0)))))'
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 480 transition count 686
Reduce places removed 4 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 1 with 104 rules applied. Total rules applied 108 place count 476 transition count 586
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 208 place count 376 transition count 586
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 208 place count 376 transition count 566
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 248 place count 356 transition count 566
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 280 place count 340 transition count 550
Applied a total of 280 rules in 47 ms. Remains 340 /480 variables (removed 140) and now considering 550/690 (removed 140) transitions.
[2023-03-18 10:50:29] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
// Phase 1: matrix 490 rows 340 cols
[2023-03-18 10:50:29] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 10:50:29] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-18 10:50:29] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-18 10:50:29] [INFO ] Invariant cache hit.
[2023-03-18 10:50:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:30] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2023-03-18 10:50:30] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 10:50:30] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-18 10:50:30] [INFO ] Invariant cache hit.
[2023-03-18 10:50:30] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 340/480 places, 550/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1605 ms. Remains : 340/480 places, 550/690 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s111 1) (EQ s172 1) (EQ s115 1) (EQ s176 1) (EQ s119 1) (EQ s180 1) (EQ s123 1) (EQ s184 1) (EQ s127 1) (EQ s131 1) (EQ s192 1) (EQ s135 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 500 ms.
Stack based approach found an accepted trace after 64 steps with 2 reset with depth 51 and stack size 15 in 17 ms.
FORMULA Peterson-PT-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-01 finished in 2379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 10:50:31] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-18 10:50:31] [INFO ] Implicit Places using invariants in 349 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 366 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1630 ms.
Product exploration explored 100000 steps with 0 reset in 1680 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 101 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 225 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 10:50:36] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 10:50:36] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-18 10:50:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:36] [INFO ] Invariant cache hit.
[2023-03-18 10:50:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:37] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
[2023-03-18 10:50:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:37] [INFO ] Invariant cache hit.
[2023-03-18 10:50:38] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2033 ms. Remains : 475/475 places, 690/690 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 : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 129 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 442 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1536 ms.
Product exploration explored 100000 steps with 0 reset in 1732 ms.
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:43] [INFO ] Invariant cache hit.
[2023-03-18 10:50:43] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-18 10:50:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:43] [INFO ] Invariant cache hit.
[2023-03-18 10:50:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:44] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-03-18 10:50:44] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:44] [INFO ] Invariant cache hit.
[2023-03-18 10:50:45] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1607 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 13728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p1))||p0)) U (F(p2)&&X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:45] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 10:50:45] [INFO ] Computed 19 place invariants in 32 ms
[2023-03-18 10:50:45] [INFO ] Implicit Places using invariants in 349 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 352 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 360 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s101 1) (EQ s103 1) (EQ s102 1) (EQ s106 1) (EQ s107 1) (EQ s104 1) (EQ s105 1) (EQ s111 1) (EQ s108 1) (EQ s114 1) (EQ s115 1) (EQ s112 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6640 reset in 1184 ms.
Stack based approach found an accepted trace after 13998 steps with 918 reset with depth 8 and stack size 8 in 173 ms.
FORMULA Peterson-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-05 finished in 2069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p1)||p0)))) U (G(p2)||X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:47] [INFO ] Invariant cache hit.
[2023-03-18 10:50:47] [INFO ] Implicit Places using invariants in 225 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 235 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-06 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(X(F(p0)))||p1)) U p2))))'
Support contains 225 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:50:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:50:48] [INFO ] Invariant cache hit.
[2023-03-18 10:50:48] [INFO ] Implicit Places using invariants in 232 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 233 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 243 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (EQ s208 1) (EQ s252 1)) (AND (EQ s208 1) (EQ s248 1)) (AND (EQ s208 1) (EQ s250 1)) (AND (EQ s235 1) (EQ s277 1)) (AND (EQ s233 1) (EQ s316 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13378 reset in 782 ms.
Product exploration explored 100000 steps with 13403 reset in 817 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 p2) (NOT p1) (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
[2023-03-18 10:50:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 10:50:51] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-18 10:50:52] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-18 10:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:50:53] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2023-03-18 10:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 10:50:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-18 10:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 10:50:55] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2023-03-18 10:50:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:50:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 40 ms returned sat
[2023-03-18 10:50:56] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 0 ms to minimize.
[2023-03-18 10:50:56] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 1 ms to minimize.
[2023-03-18 10:50:56] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 0 ms to minimize.
[2023-03-18 10:50:57] [INFO ] Deduced a trap composed of 69 places in 475 ms of which 33 ms to minimize.
[2023-03-18 10:50:57] [INFO ] Deduced a trap composed of 57 places in 426 ms of which 1 ms to minimize.
[2023-03-18 10:50:58] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 1 ms to minimize.
[2023-03-18 10:50:58] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 0 ms to minimize.
[2023-03-18 10:50:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2629 ms
[2023-03-18 10:50:58] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 65 ms.
[2023-03-18 10:51:02] [INFO ] Added : 347 causal constraints over 70 iterations in 4484 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-18 10:51:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:03] [INFO ] Invariant cache hit.
[2023-03-18 10:51:05] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-18 10:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:51:06] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2023-03-18 10:51:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 10:51:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 10:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 10:51:09] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2023-03-18 10:51:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:51:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 84 ms returned sat
[2023-03-18 10:51:10] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 1 ms to minimize.
[2023-03-18 10:51:10] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 1 ms to minimize.
[2023-03-18 10:51:10] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-18 10:51:10] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 0 ms to minimize.
[2023-03-18 10:51:11] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 1 ms to minimize.
[2023-03-18 10:51:11] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 1 ms to minimize.
[2023-03-18 10:51:11] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2023-03-18 10:51:11] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 1 ms to minimize.
[2023-03-18 10:51:12] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 1 ms to minimize.
[2023-03-18 10:51:12] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 1 ms to minimize.
[2023-03-18 10:51:12] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2023-03-18 10:51:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2023-03-18 10:51:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3052 ms
[2023-03-18 10:51:12] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 47 ms.
[2023-03-18 10:51:17] [INFO ] Added : 368 causal constraints over 74 iterations in 4471 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:17] [INFO ] Invariant cache hit.
[2023-03-18 10:51:17] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-18 10:51:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:17] [INFO ] Invariant cache hit.
[2023-03-18 10:51:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:51:17] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-18 10:51:17] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:17] [INFO ] Invariant cache hit.
[2023-03-18 10:51:18] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1171 ms. Remains : 475/475 places, 690/690 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 : [(AND (NOT p2) (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Finished random walk after 30 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
[2023-03-18 10:51:19] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:19] [INFO ] Invariant cache hit.
[2023-03-18 10:51:21] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2023-03-18 10:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:51:21] [INFO ] [Real]Absence check using state equation in 930 ms returned sat
[2023-03-18 10:51:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 10:51:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-18 10:51:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 10:51:23] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2023-03-18 10:51:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:51:23] [INFO ] [Nat]Added 116 Read/Feed constraints in 59 ms returned sat
[2023-03-18 10:51:24] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 1 ms to minimize.
[2023-03-18 10:51:24] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 1 ms to minimize.
[2023-03-18 10:51:24] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 1 ms to minimize.
[2023-03-18 10:51:25] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 0 ms to minimize.
[2023-03-18 10:51:25] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 8 ms to minimize.
[2023-03-18 10:51:25] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 0 ms to minimize.
[2023-03-18 10:51:26] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 1 ms to minimize.
[2023-03-18 10:51:26] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2023-03-18 10:51:26] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-18 10:51:26] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 0 ms to minimize.
[2023-03-18 10:51:27] [INFO ] Deduced a trap composed of 96 places in 214 ms of which 1 ms to minimize.
[2023-03-18 10:51:27] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 1 ms to minimize.
[2023-03-18 10:51:27] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2023-03-18 10:51:27] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2023-03-18 10:51:27] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4068 ms
[2023-03-18 10:51:27] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 47 ms.
[2023-03-18 10:51:30] [INFO ] Added : 198 causal constraints over 41 iterations in 2394 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-18 10:51:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:30] [INFO ] Invariant cache hit.
[2023-03-18 10:51:32] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-18 10:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:51:33] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2023-03-18 10:51:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 10:51:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 10:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 10:51:37] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-03-18 10:51:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:51:37] [INFO ] [Nat]Added 116 Read/Feed constraints in 69 ms returned sat
[2023-03-18 10:51:37] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 1 ms to minimize.
[2023-03-18 10:51:37] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 1 ms to minimize.
[2023-03-18 10:51:37] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 1 ms to minimize.
[2023-03-18 10:51:38] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 1 ms to minimize.
[2023-03-18 10:51:38] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 1 ms to minimize.
[2023-03-18 10:51:38] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 0 ms to minimize.
[2023-03-18 10:51:39] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 0 ms to minimize.
[2023-03-18 10:51:39] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 1 ms to minimize.
[2023-03-18 10:51:39] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2023-03-18 10:51:39] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 0 ms to minimize.
[2023-03-18 10:51:40] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2023-03-18 10:51:40] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2023-03-18 10:51:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3144 ms
[2023-03-18 10:51:40] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 46 ms.
[2023-03-18 10:51:44] [INFO ] Added : 368 causal constraints over 74 iterations in 4494 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13425 reset in 645 ms.
Product exploration explored 100000 steps with 13396 reset in 736 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0)]
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 475 transition count 690
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 40 place count 475 transition count 690
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 125 place count 475 transition count 690
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 177 place count 423 transition count 638
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 229 place count 423 transition count 638
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 249 place count 423 transition count 638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 253 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 257 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 257 rules in 123 ms. Remains 419 /475 variables (removed 56) and now considering 634/690 (removed 56) transitions.
[2023-03-18 10:51:47] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 10:51:47] [INFO ] Flow matrix only has 574 transitions (discarded 60 similar events)
// Phase 1: matrix 574 rows 419 cols
[2023-03-18 10:51:47] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 10:51:47] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/475 places, 634/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 962 ms. Remains : 419/475 places, 634/690 transitions.
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 10:51:47] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 10:51:48] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-18 10:51:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:48] [INFO ] Invariant cache hit.
[2023-03-18 10:51:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:51:48] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-18 10:51:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:48] [INFO ] Invariant cache hit.
[2023-03-18 10:51:48] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1120 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-PT-4-LTLFireability-07 finished in 60972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((p1&&X(F(p2)))))))'
Support contains 3 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:49] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 10:51:49] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 10:51:49] [INFO ] Implicit Places using invariants in 644 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 661 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 703 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s328 0), p1:(EQ s89 0), p2:(EQ s387 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 514 ms.
Product exploration explored 100000 steps with 33333 reset in 527 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 p0 p1 p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 8 factoid took 259 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-08 finished in 2248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(X(F(p0)))||F(p2)||p1)))))'
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:51] [INFO ] Invariant cache hit.
[2023-03-18 10:51:51] [INFO ] Implicit Places using invariants in 504 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 514 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 528 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p0:(EQ s64 1), p2:(AND (EQ s293 1) (EQ s422 1)), p1:(OR (AND (EQ s230 1) (EQ s264 1)) (EQ s9 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-09 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U G(p1))||X(F(!p1))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:52] [INFO ] Invariant cache hit.
[2023-03-18 10:51:52] [INFO ] Implicit Places using invariants in 445 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 455 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 486 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, false, (AND p1 (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s345 1) (EQ s417 1)), p0:(AND (EQ s208 1) (EQ s252 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 647 ms.
Product exploration explored 100000 steps with 50000 reset in 656 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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 6 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-10 finished in 2083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(p1 U p2))||(G(p4)&&p3))))'
Support contains 8 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 10:51:54] [INFO ] Invariant cache hit.
[2023-03-18 10:51:54] [INFO ] Implicit Places using invariants in 265 ms returned [467, 469, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 278 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 476 /476 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 290 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (NOT p4), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p4), acceptance={} source=3 dest: 0}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p4))), acceptance={} source=4 dest: 0}, { cond=(OR (AND p0 (NOT p2) p1 (NOT p3)) (AND p0 (NOT p2) p1 (NOT p4))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p3 p4) (AND (NOT p2) (NOT p1) p3 p4)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1 p3 p4), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s231 1) (EQ s276 1)), p1:(AND (EQ s334 1) (EQ s420 1)), p4:(AND (EQ s333 1) (EQ s469 1)), p0:(OR (EQ s229 0) (EQ s467 0)), p3:(AND (EQ s229 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-11 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 398 place count 281 transition count 391
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 25 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
[2023-03-18 10:51:54] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2023-03-18 10:51:54] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 10:51:55] [INFO ] Implicit Places using invariants in 263 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 277 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/480 places, 371/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 156/480 places, 371/690 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s101 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-12 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)&&p1)))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 396 place count 282 transition count 393
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 628 place count 166 transition count 376
Applied a total of 628 rules in 28 ms. Remains 166 /480 variables (removed 314) and now considering 376/690 (removed 314) transitions.
[2023-03-18 10:51:55] [INFO ] Flow matrix only has 316 transitions (discarded 60 similar events)
// Phase 1: matrix 316 rows 166 cols
[2023-03-18 10:51:55] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 10:51:55] [INFO ] Implicit Places using invariants in 278 ms returned [155, 156, 157, 158, 159]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 296 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/480 places, 376/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 332 ms. Remains : 161/480 places, 376/690 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s28 0) (OR (EQ s88 1) (EQ s28 1))), p0:(EQ s64 1), p2:(EQ s61 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-13 finished in 686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 22 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2023-03-18 10:51:56] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2023-03-18 10:51:56] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 10:51:56] [INFO ] Implicit Places using invariants in 188 ms returned [150, 151, 152, 153]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 211 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/480 places, 370/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 156/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-14 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:(AND (EQ s105 1) (EQ s150 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]]
Product exploration explored 100000 steps with 495 reset in 162 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-14 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)&&X((p2 U (p3||G(p2))))))'
Support contains 7 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 10:51:56] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 10:51:56] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 10:51:56] [INFO ] Implicit Places using invariants in 291 ms returned [467, 468, 470, 471]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 307 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 476/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 476 /476 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 476/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2)), true]
Running random walk in product with property : Peterson-PT-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s422 1) (EQ s465 1)), p0:(EQ s11 1), p3:(AND (NOT (AND (EQ s293 1) (EQ s418 1))) (NOT (AND (EQ s230 1) (EQ s467 1))) (EQ s422 1) (EQ s465 1)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Stack based approach found an accepted trace after 167 steps with 0 reset with depth 168 and stack size 168 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-15 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Found a Lengthening insensitive property : Peterson-PT-4-LTLFireability-02
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 336 place count 312 transition count 502
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 376 place count 292 transition count 502
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 408 place count 276 transition count 486
Applied a total of 408 rules in 31 ms. Remains 276 /480 variables (removed 204) and now considering 486/690 (removed 204) transitions.
[2023-03-18 10:51:57] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 276 cols
[2023-03-18 10:51:57] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 10:51:57] [INFO ] Implicit Places using invariants in 199 ms returned [263, 264, 265, 266, 267]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 200 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 271/480 places, 486/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 238 ms. Remains : 271/480 places, 486/690 transitions.
Running random walk in product with property : Peterson-PT-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1510 ms.
Product exploration explored 100000 steps with 0 reset in 1530 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 90 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 286 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-18 10:52:02] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 271 cols
[2023-03-18 10:52:02] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-18 10:52:02] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-18 10:52:02] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 10:52:02] [INFO ] Invariant cache hit.
[2023-03-18 10:52:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:52:02] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-18 10:52:02] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 10:52:02] [INFO ] Invariant cache hit.
[2023-03-18 10:52:03] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1106 ms. Remains : 271/271 places, 486/486 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 : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 88 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1513 ms.
Product exploration explored 100000 steps with 0 reset in 1524 ms.
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-18 10:52:07] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 10:52:07] [INFO ] Invariant cache hit.
[2023-03-18 10:52:07] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-18 10:52:07] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 10:52:07] [INFO ] Invariant cache hit.
[2023-03-18 10:52:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 10:52:07] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-18 10:52:07] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 10:52:07] [INFO ] Invariant cache hit.
[2023-03-18 10:52:08] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 271/271 places, 486/486 transitions.
Treatment of property Peterson-PT-4-LTLFireability-02 finished in 10820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(X(F(p0)))||p1)) U p2))))'
[2023-03-18 10:52:08] [INFO ] Flatten gal took : 47 ms
[2023-03-18 10:52:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-18 10:52:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 5 ms.
Total runtime 143225 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2130/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2130/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7198716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16253268 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023

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="Peterson-PT-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-4, 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 r265-smll-167863540300620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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