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.r517-tall-167987243600228.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 itstools
Input is EisenbergMcGuire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680822525975

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-06 23:08:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-06 23:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:08:47] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-04-06 23:08:47] [INFO ] Transformed 196 places.
[2023-04-06 23:08:47] [INFO ] Transformed 448 transitions.
[2023-04-06 23:08:47] [INFO ] Found NUPN structural information;
[2023-04-06 23:08:47] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 188 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 188 transition count 416
Applied a total of 16 rules in 161 ms. Remains 188 /196 variables (removed 8) and now considering 416/448 (removed 32) transitions.
[2023-04-06 23:08:47] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
// Phase 1: matrix 252 rows 188 cols
[2023-04-06 23:08:48] [INFO ] Computed 13 invariants in 17 ms
[2023-04-06 23:08:48] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-06 23:08:48] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 23:08:48] [INFO ] Invariant cache hit.
[2023-04-06 23:08:48] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-06 23:08:48] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-04-06 23:08:48] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 23:08:48] [INFO ] Invariant cache hit.
[2023-04-06 23:08:48] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 416/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 188/196 places, 416/448 transitions.
Support contains 41 out of 188 places after structural reductions.
[2023-04-06 23:08:48] [INFO ] Flatten gal took : 50 ms
[2023-04-06 23:08:48] [INFO ] Flatten gal took : 24 ms
[2023-04-06 23:08:48] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 40 out of 188 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 30) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-04-06 23:08:49] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 23:08:49] [INFO ] Invariant cache hit.
[2023-04-06 23:08:49] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 23:08:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:08:49] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:08:50] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 23:08:50] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-06 23:08:50] [INFO ] After 291ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 23:08:50] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 5 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 531 ms
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:08:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-04-06 23:08:51] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 0 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2023-04-06 23:08:52] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-04-06 23:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 23:08:52] [INFO ] After 2386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-04-06 23:08:53] [INFO ] After 3425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 304 ms.
Support contains 27 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 186 transition count 414
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 4 place count 186 transition count 367
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 98 place count 139 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 138 transition count 363
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 138 transition count 363
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 124 place count 126 transition count 351
Applied a total of 124 rules in 46 ms. Remains 126 /188 variables (removed 62) and now considering 351/416 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 126/188 places, 351/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 768120 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1}
Probabilistic random walk after 768120 steps, saw 155245 distinct states, run finished after 3002 ms. (steps per millisecond=255 ) properties seen :17
Running SMT prover for 1 properties.
[2023-04-06 23:08:56] [INFO ] Flow matrix only has 187 transitions (discarded 164 similar events)
// Phase 1: matrix 187 rows 126 cols
[2023-04-06 23:08:56] [INFO ] Computed 13 invariants in 4 ms
[2023-04-06 23:08:56] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:08:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-06 23:08:56] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:08:56] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:56] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-04-06 23:08:56] [INFO ] After 20ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-04-06 23:08:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 251 ms
[2023-04-06 23:08:57] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-06 23:08:57] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 351/351 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 126 transition count 344
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 119 transition count 344
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 116 transition count 332
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 116 transition count 332
Applied a total of 20 rules in 27 ms. Remains 116 /126 variables (removed 10) and now considering 332/351 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 116/126 places, 332/351 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 669718 steps, run visited all 1 properties in 1240 ms. (steps per millisecond=540 )
Probabilistic random walk after 669718 steps, saw 135261 distinct states, run finished after 1240 ms. (steps per millisecond=540 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1)||G(!p0))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 8 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 23:08:58] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-06 23:08:58] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 23:08:58] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-04-06 23:08:58] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:08:58] [INFO ] Invariant cache hit.
[2023-04-06 23:08:59] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:08:59] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-04-06 23:08:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:08:59] [INFO ] Invariant cache hit.
[2023-04-06 23:08:59] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 184/188 places, 400/416 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 439 ms :[true, (NOT p0), false, false, (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), (NOT p1), false, false]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 6}]], initial=2, aps=[p0:(AND (EQ s6 1) (EQ s84 1)), p1:(OR (EQ s0 0) (EQ s6 0) (EQ s134 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 240 ms.
Product exploration explored 100000 steps with 0 reset in 179 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 169 ms. Reduced automaton from 10 states, 20 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:09:00] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:00] [INFO ] Invariant cache hit.
[2023-04-06 23:09:00] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:09:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 23:09:00] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:09:01] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:09:01] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:01] [INFO ] After 46ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:09:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:09:01] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:09:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-04-06 23:09:01] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 23:09:01] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 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 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 20 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Finished probabilistic random walk after 728431 steps, run visited all 3 properties in 2573 ms. (steps per millisecond=283 )
Probabilistic random walk after 728431 steps, saw 146957 distinct states, run finished after 2573 ms. (steps per millisecond=283 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1)))
Knowledge based reduction with 8 factoid took 273 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 5674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 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 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 129 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 129 transition count 348
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 117 transition count 336
Applied a total of 142 rules in 27 ms. Remains 117 /188 variables (removed 71) and now considering 336/416 (removed 80) transitions.
[2023-04-06 23:09:04] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
// Phase 1: matrix 172 rows 117 cols
[2023-04-06 23:09:04] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:09:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-04-06 23:09:04] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 23:09:04] [INFO ] Invariant cache hit.
[2023-04-06 23:09:04] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 23:09:04] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-04-06 23:09:04] [INFO ] Redundant transitions in 21 ms returned []
[2023-04-06 23:09:04] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 23:09:04] [INFO ] Invariant cache hit.
[2023-04-06 23:09:05] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 336/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 117/188 places, 336/416 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s40 0))], 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 152 ms.
Product exploration explored 100000 steps with 0 reset in 147 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 246678 steps, run visited all 1 properties in 447 ms. (steps per millisecond=551 )
Probabilistic random walk after 246678 steps, saw 52317 distinct states, run finished after 448 ms. (steps per millisecond=550 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 336/336 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2023-04-06 23:09:06] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 23:09:06] [INFO ] Invariant cache hit.
[2023-04-06 23:09:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-04-06 23:09:06] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 23:09:06] [INFO ] Invariant cache hit.
[2023-04-06 23:09:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 23:09:06] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-04-06 23:09:06] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 23:09:06] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 23:09:06] [INFO ] Invariant cache hit.
[2023-04-06 23:09:06] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 ms. Remains : 117/117 places, 336/336 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 246678 steps, run visited all 1 properties in 448 ms. (steps per millisecond=550 )
Probabilistic random walk after 246678 steps, saw 52317 distinct states, run finished after 449 ms. (steps per millisecond=549 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Built C files in :
/tmp/ltsmin8931613190134084099
[2023-04-06 23:09:07] [INFO ] Computing symmetric may disable matrix : 336 transitions.
[2023-04-06 23:09:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:09:07] [INFO ] Computing symmetric may enable matrix : 336 transitions.
[2023-04-06 23:09:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:09:07] [INFO ] Computing Do-Not-Accords matrix : 336 transitions.
[2023-04-06 23:09:07] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:09:07] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8931613190134084099
Running compilation step : cd /tmp/ltsmin8931613190134084099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 713 ms.
Running link step : cd /tmp/ltsmin8931613190134084099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8931613190134084099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6744788608575046494.hoa' '--buchi-type=spotba'
LTSmin run took 857 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-03 finished in 5018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X((G((p3 U p4))&&p2))))'
Support contains 9 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 9 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 23:09:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-06 23:09:09] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 23:09:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-04-06 23:09:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:09] [INFO ] Invariant cache hit.
[2023-04-06 23:09:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:09] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-04-06 23:09:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:09] [INFO ] Invariant cache hit.
[2023-04-06 23:09:10] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 1117 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p4), (NOT p4), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (NOT p4), (AND (NOT p1) p0), (AND p0 (NOT p1) (NOT p4)), (AND p0 (NOT p1) (NOT p4))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p4) p3), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) p2 p4) (AND (NOT p0) p2 p3)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 7}, { cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=2 dest: 8}, { cond=(OR (AND (NOT p1) p2 p4) (AND (NOT p1) p2 p3)), acceptance={} source=2 dest: 10}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=2 dest: 12}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))), acceptance={} source=2 dest: 13}, { cond=(OR (AND p1 p2 p4) (AND p1 p2 p3)), acceptance={} source=2 dest: 15}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=2 dest: 16}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p2 p4) (AND (NOT p1) (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND p1 (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=3 dest: 17}, { cond=(OR (AND p1 (NOT p0) p2 p4) (AND p1 (NOT p0) p2 p3)), acceptance={} source=3 dest: 19}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 5}, { cond=(OR p4 p3), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}, { cond=p1, acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=10 dest: 5}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p0) p3)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=12 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=12 dest: 8}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p3)), acceptance={} source=12 dest: 10}, { cond=(OR p4 p3), acceptance={} source=12 dest: 12}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=12 dest: 13}, { cond=(OR (AND p1 p4) (AND p1 p3)), acceptance={} source=12 dest: 15}, { cond=(AND (NOT p4) p3), acceptance={0} source=12 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=14 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=14 dest: 17}, { cond=(AND p1 (NOT p0) (NOT p4) p3), acceptance={} source=14 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=15 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=15 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=15 dest: 17}, { cond=(OR (AND p1 (NOT p0) p4) (AND p1 (NOT p0) p3)), acceptance={} source=15 dest: 19}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=16 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=16 dest: 2}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=16 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=16 dest: 9}, { cond=(AND (NOT p4) p3), acceptance={} source=16 dest: 11}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=16 dest: 14}, { cond=(AND (NOT p4) p3), acceptance={0} source=16 dest: 16}], [{ cond=(AND (NOT p1) p0), acceptance={} source=17 dest: 4}, { cond=(AND p1 p0), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=18 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=18 dest: 5}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=18 dest: 17}, { cond=(AND p1 p0 (NOT p4) p3), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=19 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=19 dest: 5}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p3)), acceptance={} source=19 dest: 6}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=19 dest: 17}, { cond=(OR (AND p1 p0 p4) (AND p1 p0 p3)), acceptance={} source=19 dest: 19}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s15 1) (EQ s124 1)), p0:(AND (EQ s13 1) (EQ s147 1)), p2:(AND (EQ s3 1) (EQ s15 1) (EQ s124 1)), p4:(AND (EQ s0 1) (EQ s6 1) (EQ s12...], 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, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-04 finished in 1622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (G(!p0) U (X(F(p2))&&p1))))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 13 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 23:09:11] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:11] [INFO ] Invariant cache hit.
[2023-04-06 23:09:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-04-06 23:09:11] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:11] [INFO ] Invariant cache hit.
[2023-04-06 23:09:11] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:11] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-04-06 23:09:11] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:11] [INFO ] Invariant cache hit.
[2023-04-06 23:09:11] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s5 1) (EQ s129 1)), p0:(AND (EQ s0 1) (EQ s5 1) (EQ s129 1)), p2:(AND (EQ s11 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 140 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) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 128 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 11 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 571 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true, false, false, (AND (NOT p0) p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 9) 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 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 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-06 23:09:13] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:13] [INFO ] Invariant cache hit.
[2023-04-06 23:09:13] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 23:09:13] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 4 ms returned sat
[2023-04-06 23:09:13] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-04-06 23:09:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 23:09:14] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 23:09:14] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-04-06 23:09:14] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:14] [INFO ] After 69ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-04-06 23:09:14] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-04-06 23:09:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 23:09:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-04-06 23:09:14] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2023-04-06 23:09:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:09:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-04-06 23:09:14] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-06 23:09:14] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 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 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 15 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) 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 4) seen :0
Finished probabilistic random walk after 286415 steps, run visited all 4 properties in 1382 ms. (steps per millisecond=207 )
Probabilistic random walk after 286415 steps, saw 59455 distinct states, run finished after 1383 ms. (steps per millisecond=207 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p1 (NOT p2))), (F p0), (F p2)]
Property proved to be false thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 14 ms. Reduced automaton from 11 states, 35 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-05 finished in 5138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 8 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 23:09:16] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:16] [INFO ] Invariant cache hit.
[2023-04-06 23:09:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-06 23:09:16] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:16] [INFO ] Invariant cache hit.
[2023-04-06 23:09:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:16] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-04-06 23:09:16] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:16] [INFO ] Invariant cache hit.
[2023-04-06 23:09:16] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4 reset in 155 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 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 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 117 transition count 333
Applied a total of 142 rules in 25 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
[2023-04-06 23:09:17] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 23:09:17] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 23:09:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-04-06 23:09:17] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 23:09:17] [INFO ] Invariant cache hit.
[2023-04-06 23:09:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:17] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-04-06 23:09:17] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-06 23:09:17] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 23:09:17] [INFO ] Invariant cache hit.
[2023-04-06 23:09:17] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 333/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 117/188 places, 333/416 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s84 1)), p1:(AND (EQ s6 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(p1 U p2))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 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 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 130 transition count 352
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 130 transition count 352
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 140 place count 118 transition count 340
Applied a total of 140 rules in 20 ms. Remains 118 /188 variables (removed 70) and now considering 340/416 (removed 76) transitions.
[2023-04-06 23:09:17] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
// Phase 1: matrix 176 rows 118 cols
[2023-04-06 23:09:17] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 23:09:17] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-06 23:09:17] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2023-04-06 23:09:17] [INFO ] Invariant cache hit.
[2023-04-06 23:09:17] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-04-06 23:09:17] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-04-06 23:09:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-06 23:09:17] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2023-04-06 23:09:17] [INFO ] Invariant cache hit.
[2023-04-06 23:09:18] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/188 places, 340/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 118/188 places, 340/416 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s21 1)), p2:(AND (EQ s0 1) (EQ s41 1)), p0:(AND (EQ s10 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-08 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (!p1&&F(p2)))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 185 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 185 transition count 404
Applied a total of 6 rules in 4 ms. Remains 185 /188 variables (removed 3) and now considering 404/416 (removed 12) transitions.
[2023-04-06 23:09:18] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2023-04-06 23:09:18] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 23:09:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-04-06 23:09:18] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2023-04-06 23:09:18] [INFO ] Invariant cache hit.
[2023-04-06 23:09:18] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 23:09:18] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-04-06 23:09:18] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2023-04-06 23:09:18] [INFO ] Invariant cache hit.
[2023-04-06 23:09:18] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 404/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 185/188 places, 404/416 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s92 1)), p2:(OR (AND (EQ s2 1) (EQ s11 1) (EQ s136 1)) (AND (EQ s2 1) (EQ s52 1))), p0:(AND (EQ s2 1) (EQ s11 1) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-09 finished in 751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 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 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 117 transition count 333
Applied a total of 142 rules in 20 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 23:09:19] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 23:09:19] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 23:09:19] [INFO ] Invariant cache hit.
[2023-04-06 23:09:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:19] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-04-06 23:09:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 23:09:19] [INFO ] Invariant cache hit.
[2023-04-06 23:09:19] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 333/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 117/188 places, 333/416 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(p1)))) U G(!p2)))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 6 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-06 23:09:19] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 23:09:19] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-04-06 23:09:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:19] [INFO ] Invariant cache hit.
[2023-04-06 23:09:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:20] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-04-06 23:09:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:20] [INFO ] Invariant cache hit.
[2023-04-06 23:09:20] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 367 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p0)), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s17 1)), p0:(AND (EQ s9 1) (EQ s153 1)), p1:(AND (EQ s15 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5191 steps with 0 reset in 10 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 4 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 23:09:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:20] [INFO ] Invariant cache hit.
[2023-04-06 23:09:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-04-06 23:09:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:20] [INFO ] Invariant cache hit.
[2023-04-06 23:09:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 23:09:20] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-04-06 23:09:20] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 23:09:20] [INFO ] Invariant cache hit.
[2023-04-06 23:09:21] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s2 0) (EQ s137 0)), p0:(EQ s57 0)], 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 254 ms.
Product exploration explored 100000 steps with 50000 reset in 236 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), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-14 finished in 1121 ms.
All properties solved by simple procedures.
Total runtime 34233 ms.

BK_STOP 1680822562616

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EisenbergMcGuire-PT-04, 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 r517-tall-167987243600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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