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.r521-tall-167987246400220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 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 121K 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-03-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680834529379

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 02:28:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 02:28:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:28:51] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-04-07 02:28:51] [INFO ] Transformed 117 places.
[2023-04-07 02:28:51] [INFO ] Transformed 216 transitions.
[2023-04-07 02:28:51] [INFO ] Found NUPN structural information;
[2023-04-07 02:28:51] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 114 transition count 207
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 114 transition count 207
Applied a total of 6 rules in 22 ms. Remains 114 /117 variables (removed 3) and now considering 207/216 (removed 9) transitions.
[2023-04-07 02:28:51] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
// Phase 1: matrix 144 rows 114 cols
[2023-04-07 02:28:51] [INFO ] Computed 10 invariants in 9 ms
[2023-04-07 02:28:51] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-07 02:28:51] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
[2023-04-07 02:28:51] [INFO ] Invariant cache hit.
[2023-04-07 02:28:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-04-07 02:28:52] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-04-07 02:28:52] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
[2023-04-07 02:28:52] [INFO ] Invariant cache hit.
[2023-04-07 02:28:52] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 207/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 825 ms. Remains : 114/117 places, 207/216 transitions.
Support contains 34 out of 114 places after structural reductions.
[2023-04-07 02:28:52] [INFO ] Flatten gal took : 80 ms
[2023-04-07 02:28:52] [INFO ] Flatten gal took : 15 ms
[2023-04-07 02:28:52] [INFO ] Input system was already deterministic with 207 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 28) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
[2023-04-07 02:28:53] [INFO ] Flow matrix only has 144 transitions (discarded 63 similar events)
[2023-04-07 02:28:53] [INFO ] Invariant cache hit.
[2023-04-07 02:28:53] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-04-07 02:28:53] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-07 02:28:53] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-07 02:28:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-07 02:28:53] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-07 02:28:53] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-04-07 02:28:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-04-07 02:28:53] [INFO ] After 138ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2023-04-07 02:28:53] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 3 ms to minimize.
[2023-04-07 02:28:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 329 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 02:28:54] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2023-04-07 02:28:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-04-07 02:28:55] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-04-07 02:28:55] [INFO ] After 1739ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 16 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 207/207 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 113 transition count 206
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 2 place count 113 transition count 179
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 56 place count 86 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 84 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 84 transition count 173
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 78 transition count 167
Applied a total of 72 rules in 46 ms. Remains 78 /114 variables (removed 36) and now considering 167/207 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 78/114 places, 167/207 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Finished probabilistic random walk after 22052 steps, run visited all 12 properties in 123 ms. (steps per millisecond=179 )
Probabilistic random walk after 22052 steps, saw 5781 distinct states, run finished after 123 ms. (steps per millisecond=179 ) properties seen :12
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(((p1||X(F(p2)))&&p0))))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 201
Applied a total of 4 rules in 8 ms. Remains 112 /114 variables (removed 2) and now considering 201/207 (removed 6) transitions.
[2023-04-07 02:28:56] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2023-04-07 02:28:56] [INFO ] Computed 10 invariants in 4 ms
[2023-04-07 02:28:56] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-07 02:28:56] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-07 02:28:56] [INFO ] Invariant cache hit.
[2023-04-07 02:28:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-04-07 02:28:56] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-04-07 02:28:56] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-07 02:28:56] [INFO ] Invariant cache hit.
[2023-04-07 02:28:56] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/114 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 112/114 places, 201/207 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 260 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s87 1)), p1:(AND (EQ s0 1) (EQ s16 1)), p2:(AND (EQ s8 1) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-01 finished in 923 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(p1)||p0)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 204
Applied a total of 2 rules in 10 ms. Remains 113 /114 variables (removed 1) and now considering 204/207 (removed 3) transitions.
[2023-04-07 02:28:57] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
// Phase 1: matrix 141 rows 113 cols
[2023-04-07 02:28:57] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 02:28:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-04-07 02:28:57] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2023-04-07 02:28:57] [INFO ] Invariant cache hit.
[2023-04-07 02:28:57] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-04-07 02:28:57] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-04-07 02:28:57] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2023-04-07 02:28:57] [INFO ] Invariant cache hit.
[2023-04-07 02:28:57] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 204/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 113/114 places, 204/207 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s0 0) (EQ s33 0)), p0:(OR (EQ s1 0) (EQ s34 0) (AND (EQ s6 1) (EQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Product exploration explored 100000 steps with 50000 reset in 207 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 (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-02 finished in 1112 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(F((X(F((X(p0)&&G(p1)))) U p2)))))'
Support contains 2 out of 114 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 111 transition count 204
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 6 place count 111 transition count 177
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 84 transition count 177
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 81 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 81 transition count 168
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 75 transition count 162
Applied a total of 78 rules in 39 ms. Remains 75 /114 variables (removed 39) and now considering 162/207 (removed 45) transitions.
[2023-04-07 02:28:58] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
// Phase 1: matrix 99 rows 75 cols
[2023-04-07 02:28:58] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 02:28:59] [INFO ] Implicit Places using invariants in 991 ms returned []
[2023-04-07 02:28:59] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2023-04-07 02:28:59] [INFO ] Invariant cache hit.
[2023-04-07 02:28:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:28:59] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-04-07 02:28:59] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 02:28:59] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2023-04-07 02:28:59] [INFO ] Invariant cache hit.
[2023-04-07 02:28:59] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/114 places, 162/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1268 ms. Remains : 75/114 places, 162/207 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6473 reset in 148 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-03 finished in 1546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 198
Applied a total of 6 rules in 6 ms. Remains 111 /114 variables (removed 3) and now considering 198/207 (removed 9) transitions.
[2023-04-07 02:28:59] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2023-04-07 02:28:59] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 02:28:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-04-07 02:28:59] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:28:59] [INFO ] Invariant cache hit.
[2023-04-07 02:29:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:00] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-04-07 02:29:00] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:00] [INFO ] Invariant cache hit.
[2023-04-07 02:29:00] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/114 places, 198/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 111/114 places, 198/207 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s0 1) (NEQ s5 1) (NEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 125 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6009 steps, run visited all 1 properties in 18 ms. (steps per millisecond=333 )
Probabilistic random walk after 6009 steps, saw 2408 distinct states, run finished after 18 ms. (steps per millisecond=333 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-05 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p0)&&F(G(p1)))))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 198
Applied a total of 6 rules in 5 ms. Remains 111 /114 variables (removed 3) and now considering 198/207 (removed 9) transitions.
[2023-04-07 02:29:00] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:00] [INFO ] Invariant cache hit.
[2023-04-07 02:29:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-04-07 02:29:00] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:00] [INFO ] Invariant cache hit.
[2023-04-07 02:29:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:01] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-04-07 02:29:01] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:01] [INFO ] Invariant cache hit.
[2023-04-07 02:29:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/114 places, 198/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 111/114 places, 198/207 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s90 0)), p1:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-06 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' '!((p0 U X(G(p1))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 198
Applied a total of 6 rules in 11 ms. Remains 111 /114 variables (removed 3) and now considering 198/207 (removed 9) transitions.
[2023-04-07 02:29:01] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:01] [INFO ] Invariant cache hit.
[2023-04-07 02:29:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-04-07 02:29:01] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:01] [INFO ] Invariant cache hit.
[2023-04-07 02:29:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:01] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-04-07 02:29:01] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:01] [INFO ] Invariant cache hit.
[2023-04-07 02:29:01] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/114 places, 198/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 111/114 places, 198/207 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1 1) (EQ s7 1) (EQ s73 1)), p0:(AND (EQ s2 1) (EQ s10 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-07 finished in 534 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 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 111 transition count 204
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 111 transition count 174
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 81 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 78 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 72 transition count 159
Applied a total of 84 rules in 19 ms. Remains 72 /114 variables (removed 42) and now considering 159/207 (removed 48) transitions.
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
// Phase 1: matrix 96 rows 72 cols
[2023-04-07 02:29:02] [INFO ] Computed 10 invariants in 0 ms
[2023-04-07 02:29:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-07 02:29:02] [INFO ] Invariant cache hit.
[2023-04-07 02:29:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:02] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-04-07 02:29:02] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-07 02:29:02] [INFO ] Invariant cache hit.
[2023-04-07 02:29:02] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/114 places, 159/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 72/114 places, 159/207 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-08 finished in 421 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 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 111 transition count 204
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 111 transition count 174
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 81 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 78 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 72 transition count 159
Applied a total of 84 rules in 18 ms. Remains 72 /114 variables (removed 42) and now considering 159/207 (removed 48) transitions.
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-07 02:29:02] [INFO ] Invariant cache hit.
[2023-04-07 02:29:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-07 02:29:02] [INFO ] Invariant cache hit.
[2023-04-07 02:29:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:02] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-04-07 02:29:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 96 transitions (discarded 63 similar events)
[2023-04-07 02:29:02] [INFO ] Invariant cache hit.
[2023-04-07 02:29:02] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/114 places, 159/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 376 ms. Remains : 72/114 places, 159/207 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-09 finished in 537 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 X(((p2 U p3)&&p1)))))'
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 198
Applied a total of 6 rules in 4 ms. Remains 111 /114 variables (removed 3) and now considering 198/207 (removed 9) transitions.
[2023-04-07 02:29:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2023-04-07 02:29:02] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 02:29:03] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-04-07 02:29:03] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:03] [INFO ] Invariant cache hit.
[2023-04-07 02:29:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-04-07 02:29:03] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:03] [INFO ] Invariant cache hit.
[2023-04-07 02:29:03] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/114 places, 198/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 111/114 places, 198/207 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=3 dest: 6}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s11 1) (EQ s77 1)), p1:(AND (EQ s0 1) (EQ s5 1) (EQ s77 1)), p3:(AND (EQ s7 1) (EQ s94 1)), p2:(AND (EQ s0 1) (EQ s5 1) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-10 finished in 967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&F(p2)&&p0))))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 198
Applied a total of 6 rules in 5 ms. Remains 111 /114 variables (removed 3) and now considering 198/207 (removed 9) transitions.
[2023-04-07 02:29:03] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:03] [INFO ] Invariant cache hit.
[2023-04-07 02:29:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-04-07 02:29:03] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:03] [INFO ] Invariant cache hit.
[2023-04-07 02:29:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:04] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-04-07 02:29:04] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:04] [INFO ] Invariant cache hit.
[2023-04-07 02:29:04] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/114 places, 198/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 111/114 places, 198/207 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(OR (EQ s1 0) (EQ s7 0) (EQ s80 0)), p2:(OR (EQ s7 0) (EQ s94 0)), p0:(AND (OR (EQ s1 0) (EQ s7 0) (EQ s80 0)) (OR (EQ s8 0) (EQ s56 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 116 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 p2 p0), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 377 steps, run visited all 1 properties in 5 ms. (steps per millisecond=75 )
Probabilistic random walk after 377 steps, saw 283 distinct states, run finished after 5 ms. (steps per millisecond=75 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-04-07 02:29:05] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:05] [INFO ] Invariant cache hit.
[2023-04-07 02:29:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-04-07 02:29:05] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:05] [INFO ] Invariant cache hit.
[2023-04-07 02:29:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:05] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-04-07 02:29:05] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:05] [INFO ] Invariant cache hit.
[2023-04-07 02:29:05] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 111/111 places, 198/198 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 : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 377 steps, run visited all 1 properties in 9 ms. (steps per millisecond=41 )
Probabilistic random walk after 377 steps, saw 283 distinct states, run finished after 9 ms. (steps per millisecond=41 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 198
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 2 place count 111 transition count 228
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 111 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 111 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 109 transition count 226
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 109 transition count 226
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 42 rules in 26 ms. Remains 109 /111 variables (removed 2) and now considering 226/198 (removed -28) transitions.
[2023-04-07 02:29:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 148 transitions (discarded 78 similar events)
// Phase 1: matrix 148 rows 109 cols
[2023-04-07 02:29:07] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 02:29:07] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/111 places, 226/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 109/111 places, 226/198 transitions.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2023-04-07 02:29:07] [INFO ] Computed 10 invariants in 4 ms
[2023-04-07 02:29:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:07] [INFO ] Invariant cache hit.
[2023-04-07 02:29:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:07] [INFO ] Invariant cache hit.
[2023-04-07 02:29:07] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 111/111 places, 198/198 transitions.
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-11 finished in 3802 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 U X(p1)))))'
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 198
Applied a total of 6 rules in 3 ms. Remains 111 /114 variables (removed 3) and now considering 198/207 (removed 9) transitions.
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:07] [INFO ] Invariant cache hit.
[2023-04-07 02:29:07] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:07] [INFO ] Invariant cache hit.
[2023-04-07 02:29:07] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-07 02:29:07] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-04-07 02:29:07] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2023-04-07 02:29:07] [INFO ] Invariant cache hit.
[2023-04-07 02:29:08] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/114 places, 198/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 111/114 places, 198/207 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s67 1), p1:(NEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33315 reset in 152 ms.
Stack based approach found an accepted trace after 80532 steps with 26768 reset with depth 16 and stack size 16 in 120 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-12 finished in 773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&X((F(p1)||G(!p0)))))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 207/207 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 201
Applied a total of 4 rules in 6 ms. Remains 112 /114 variables (removed 2) and now considering 201/207 (removed 6) transitions.
[2023-04-07 02:29:08] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2023-04-07 02:29:08] [INFO ] Computed 10 invariants in 2 ms
[2023-04-07 02:29:08] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-04-07 02:29:08] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-07 02:29:08] [INFO ] Invariant cache hit.
[2023-04-07 02:29:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-04-07 02:29:08] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-04-07 02:29:08] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2023-04-07 02:29:08] [INFO ] Invariant cache hit.
[2023-04-07 02:29:08] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/114 places, 201/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 112/114 places, 201/207 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (EQ s1 1) (EQ s7 1) (EQ s73 1)), p0:(AND (EQ s2 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Stack based approach found an accepted trace after 120 steps with 0 reset with depth 121 and stack size 115 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-15 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&F(p2)&&p0))))'
[2023-04-07 02:29:09] [INFO ] Flatten gal took : 13 ms
[2023-04-07 02:29:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 02:29:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 207 transitions and 864 arcs took 2 ms.
Total runtime 18147 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1091/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-03-LTLFireability-11

BK_STOP 1680834550586

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name EisenbergMcGuire-PT-03-LTLFireability-11
ltl formula formula --ltl=/tmp/1091/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 114 places, 207 transitions and 864 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1091/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1091/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1091/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1091/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-03, 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 r521-tall-167987246400220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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