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-167987246200068.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 Anderson-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246200068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 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 2.1M 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 Anderson-PT-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680871221553

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=Anderson-PT-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 12:40:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 12:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 12:40:23] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-04-07 12:40:23] [INFO ] Transformed 889 places.
[2023-04-07 12:40:23] [INFO ] Transformed 4152 transitions.
[2023-04-07 12:40:23] [INFO ] Found NUPN structural information;
[2023-04-07 12:40:23] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 244 places :
Symmetric choice reduction at 0 with 244 rule applications. Total rules 244 place count 645 transition count 1400
Iterating global reduction 0 with 244 rules applied. Total rules applied 488 place count 645 transition count 1400
Applied a total of 488 rules in 204 ms. Remains 645 /889 variables (removed 244) and now considering 1400/4152 (removed 2752) transitions.
// Phase 1: matrix 1400 rows 645 cols
[2023-04-07 12:40:24] [INFO ] Computed 27 invariants in 73 ms
[2023-04-07 12:40:25] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2023-04-07 12:40:25] [INFO ] Invariant cache hit.
[2023-04-07 12:40:26] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:40:28] [INFO ] Implicit Places using invariants and state equation in 3258 ms returned []
Implicit Place search using SMT with State Equation took 4579 ms to find 0 implicit places.
[2023-04-07 12:40:28] [INFO ] Invariant cache hit.
[2023-04-07 12:40:29] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 645/889 places, 1400/4152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5859 ms. Remains : 645/889 places, 1400/4152 transitions.
Support contains 41 out of 645 places after structural reductions.
[2023-04-07 12:40:30] [INFO ] Flatten gal took : 239 ms
[2023-04-07 12:40:30] [INFO ] Flatten gal took : 156 ms
[2023-04-07 12:40:31] [INFO ] Input system was already deterministic with 1400 transitions.
Support contains 39 out of 645 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 25) seen :6
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 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) 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 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 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 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
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 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 18) 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 18) 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 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 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-04-07 12:40:31] [INFO ] Invariant cache hit.
[2023-04-07 12:40:32] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 12:40:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-04-07 12:40:32] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 22 ms returned sat
[2023-04-07 12:40:35] [INFO ] After 2981ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2023-04-07 12:40:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:40:38] [INFO ] After 2266ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :2 sat :16
[2023-04-07 12:40:41] [INFO ] After 5586ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 1983 ms.
[2023-04-07 12:40:43] [INFO ] After 11134ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 148 ms.
Support contains 26 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 507 transition count 1174
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 507 transition count 1174
Applied a total of 276 rules in 116 ms. Remains 507 /645 variables (removed 138) and now considering 1174/1400 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 507/645 places, 1174/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) 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 13) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1174 rows 507 cols
[2023-04-07 12:40:44] [INFO ] Computed 27 invariants in 18 ms
[2023-04-07 12:40:44] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-07 12:40:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-04-07 12:40:44] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 16 ms returned sat
[2023-04-07 12:40:46] [INFO ] After 1663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-04-07 12:40:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:40:47] [INFO ] After 1276ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-04-07 12:40:49] [INFO ] After 2699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1081 ms.
[2023-04-07 12:40:50] [INFO ] After 5772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 142 ms.
Support contains 21 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1174/1174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 504 transition count 1105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 504 transition count 1105
Applied a total of 6 rules in 41 ms. Remains 504 /507 variables (removed 3) and now considering 1105/1174 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 504/507 places, 1105/1174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) 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 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :4
Running SMT prover for 4 properties.
// Phase 1: matrix 1105 rows 504 cols
[2023-04-07 12:40:51] [INFO ] Computed 27 invariants in 16 ms
[2023-04-07 12:40:51] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 12:40:51] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 20 ms returned sat
[2023-04-07 12:40:52] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 12:40:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 12:40:52] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 21 ms returned sat
[2023-04-07 12:40:53] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 12:40:53] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:40:53] [INFO ] After 628ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 12:40:54] [INFO ] After 1054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 353 ms.
[2023-04-07 12:40:54] [INFO ] After 2316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1105/1105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 497 transition count 944
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 497 transition count 944
Applied a total of 14 rules in 33 ms. Remains 497 /504 variables (removed 7) and now considering 944/1105 (removed 161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 497/504 places, 944/1105 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 177966 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177966 steps, saw 145146 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 944 rows 497 cols
[2023-04-07 12:40:58] [INFO ] Computed 27 invariants in 8 ms
[2023-04-07 12:40:58] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-04-07 12:40:58] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 37 ms returned sat
[2023-04-07 12:40:59] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 12:40:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2023-04-07 12:40:59] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 35 ms returned sat
[2023-04-07 12:41:00] [INFO ] After 894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 12:41:00] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:01] [INFO ] After 899ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 12:41:01] [INFO ] After 1348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-04-07 12:41:01] [INFO ] After 2803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 15 ms.
Support contains 8 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 944/944 transitions.
Applied a total of 0 rules in 22 ms. Remains 497 /497 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 497/497 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 944/944 transitions.
Applied a total of 0 rules in 37 ms. Remains 497 /497 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2023-04-07 12:41:02] [INFO ] Invariant cache hit.
[2023-04-07 12:41:02] [INFO ] Implicit Places using invariants in 579 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 581 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/497 places, 944/944 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 496 transition count 804
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 356 transition count 804
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 284 place count 356 transition count 800
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 288 place count 352 transition count 800
Applied a total of 288 rules in 55 ms. Remains 352 /496 variables (removed 144) and now considering 800/944 (removed 144) transitions.
// Phase 1: matrix 800 rows 352 cols
[2023-04-07 12:41:02] [INFO ] Computed 26 invariants in 9 ms
[2023-04-07 12:41:02] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-07 12:41:02] [INFO ] Invariant cache hit.
[2023-04-07 12:41:03] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:04] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 352/497 places, 800/944 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2153 ms. Remains : 352/497 places, 800/944 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 425758 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 425758 steps, saw 332048 distinct states, run finished after 3005 ms. (steps per millisecond=141 ) properties seen :2
Running SMT prover for 2 properties.
[2023-04-07 12:41:07] [INFO ] Invariant cache hit.
[2023-04-07 12:41:07] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-04-07 12:41:07] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 12:41:07] [INFO ] After 269ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 12:41:07] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:07] [INFO ] After 59ms SMT Verify possible using 132 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:41:07] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:41:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 12:41:07] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 12:41:08] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 12:41:08] [INFO ] After 158ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 12:41:08] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-04-07 12:41:08] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 800/800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 350 transition count 754
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 350 transition count 754
Applied a total of 4 rules in 17 ms. Remains 350 /352 variables (removed 2) and now considering 754/800 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 350/352 places, 754/800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 423494 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423494 steps, saw 332954 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 754 rows 350 cols
[2023-04-07 12:41:11] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 12:41:11] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-04-07 12:41:11] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 32 ms returned sat
[2023-04-07 12:41:12] [INFO ] After 311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 12:41:12] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:12] [INFO ] After 52ms SMT Verify possible using 132 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:41:12] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 12:41:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 12:41:12] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 12:41:12] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 12:41:12] [INFO ] After 158ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 12:41:12] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-07 12:41:13] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 754/754 transitions.
Applied a total of 0 rules in 12 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 350/350 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 754/754 transitions.
Applied a total of 0 rules in 12 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-04-07 12:41:13] [INFO ] Invariant cache hit.
[2023-04-07 12:41:13] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-04-07 12:41:13] [INFO ] Invariant cache hit.
[2023-04-07 12:41:13] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:14] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-04-07 12:41:14] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 12:41:14] [INFO ] Invariant cache hit.
[2023-04-07 12:41:14] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1827 ms. Remains : 350/350 places, 754/754 transitions.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 350 transition count 610
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 206 transition count 610
Applied a total of 288 rules in 15 ms. Remains 206 /350 variables (removed 144) and now considering 610/754 (removed 144) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 610 rows 206 cols
[2023-04-07 12:41:14] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 12:41:14] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-07 12:41:14] [INFO ] [Real]Absence check using 15 positive and 11 generalized place invariants in 7 ms returned sat
[2023-04-07 12:41:15] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 12:41:15] [INFO ] After 246ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 12:41:15] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-04-07 12:41:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 12:41:15] [INFO ] [Nat]Absence check using 15 positive and 11 generalized place invariants in 6 ms returned sat
[2023-04-07 12:41:15] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 12:41:15] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-07 12:41:15] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-12-LTLFireability-13 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' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 282 place count 495 transition count 898
Iterating global reduction 0 with 18 rules applied. Total rules applied 300 place count 495 transition count 898
Applied a total of 300 rules in 59 ms. Remains 495 /645 variables (removed 150) and now considering 898/1400 (removed 502) transitions.
// Phase 1: matrix 898 rows 495 cols
[2023-04-07 12:41:16] [INFO ] Computed 27 invariants in 8 ms
[2023-04-07 12:41:16] [INFO ] Implicit Places using invariants in 611 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 613 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/645 places, 898/1400 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 494 transition count 756
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 352 transition count 756
Applied a total of 284 rules in 35 ms. Remains 352 /494 variables (removed 142) and now considering 756/898 (removed 142) transitions.
// Phase 1: matrix 756 rows 352 cols
[2023-04-07 12:41:16] [INFO ] Computed 26 invariants in 18 ms
[2023-04-07 12:41:17] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-04-07 12:41:17] [INFO ] Invariant cache hit.
[2023-04-07 12:41:17] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:18] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1685 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/645 places, 756/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2394 ms. Remains : 352/645 places, 756/1400 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 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s41 0)), p1:(OR (NEQ s32 1) (NEQ s42 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 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 921184 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{1=1}
Probabilistic random walk after 921184 steps, saw 702254 distinct states, run finished after 3002 ms. (steps per millisecond=306 ) properties seen :1
Running SMT prover for 1 properties.
[2023-04-07 12:41:22] [INFO ] Invariant cache hit.
[2023-04-07 12:41:22] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 12:41:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 12:41:22] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 31 ms returned sat
[2023-04-07 12:41:22] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 6743 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)||X(G(p1))))'
Support contains 3 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 627 transition count 1008
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 627 transition count 1008
Applied a total of 36 rules in 25 ms. Remains 627 /645 variables (removed 18) and now considering 1008/1400 (removed 392) transitions.
// Phase 1: matrix 1008 rows 627 cols
[2023-04-07 12:41:22] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 12:41:23] [INFO ] Implicit Places using invariants in 676 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 677 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 626/645 places, 1008/1400 transitions.
Applied a total of 0 rules in 11 ms. Remains 626 /626 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 714 ms. Remains : 626/645 places, 1008/1400 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s137 1), p1:(AND (EQ s33 1) (EQ s39 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 14 reset in 207 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-01 finished in 1098 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))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 37 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 12:41:23] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 12:41:24] [INFO ] Implicit Places using invariants in 760 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 765 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 31 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 12:41:24] [INFO ] Computed 26 invariants in 6 ms
[2023-04-07 12:41:25] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-04-07 12:41:25] [INFO ] Invariant cache hit.
[2023-04-07 12:41:25] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:26] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2562 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 43 ms :[true, p0]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s19 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 2817 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(p0) U p1)))&&(F(p0) U G(p2))))'
Support contains 5 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 627 transition count 1008
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 627 transition count 1008
Applied a total of 36 rules in 44 ms. Remains 627 /645 variables (removed 18) and now considering 1008/1400 (removed 392) transitions.
// Phase 1: matrix 1008 rows 627 cols
[2023-04-07 12:41:26] [INFO ] Computed 27 invariants in 13 ms
[2023-04-07 12:41:27] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-04-07 12:41:27] [INFO ] Invariant cache hit.
[2023-04-07 12:41:27] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:29] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 2958 ms to find 0 implicit places.
[2023-04-07 12:41:29] [INFO ] Invariant cache hit.
[2023-04-07 12:41:30] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 627/645 places, 1008/1400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3834 ms. Remains : 627/645 places, 1008/1400 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p2), true]
Running random walk in product with property : Anderson-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s502 1)), p0:(AND (EQ s29 1) (EQ s48 1)), p1:(EQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 278 steps with 0 reset with depth 279 and stack size 279 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-05 finished in 4336 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 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 51 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 12:41:31] [INFO ] Computed 27 invariants in 5 ms
[2023-04-07 12:41:31] [INFO ] Implicit Places using invariants in 594 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 596 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 32 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 12:41:31] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 12:41:31] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-04-07 12:41:31] [INFO ] Invariant cache hit.
[2023-04-07 12:41:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:32] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2011 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s46 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 148 ms.
Stack based approach found an accepted trace after 177 steps with 0 reset with depth 178 and stack size 178 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-06 finished in 2208 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((X(X(X(G(p1)))) U (!p2&&X(X(X(G(p1)))))))||p0)))'
Support contains 4 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 627 transition count 1030
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 627 transition count 1030
Applied a total of 36 rules in 26 ms. Remains 627 /645 variables (removed 18) and now considering 1030/1400 (removed 370) transitions.
// Phase 1: matrix 1030 rows 627 cols
[2023-04-07 12:41:33] [INFO ] Computed 27 invariants in 11 ms
[2023-04-07 12:41:33] [INFO ] Implicit Places using invariants in 572 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 592 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 626/645 places, 1030/1400 transitions.
Applied a total of 0 rules in 10 ms. Remains 626 /626 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 630 ms. Remains : 626/645 places, 1030/1400 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (NEQ s21 1) (NEQ s44 1)), p2:(AND (EQ s21 1) (EQ s44 1)), p1:(AND (EQ s30 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Product exploration explored 100000 steps with 50000 reset in 625 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 43 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-07 finished in 2215 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 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 626 transition count 1007
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 626 transition count 1007
Applied a total of 38 rules in 20 ms. Remains 626 /645 variables (removed 19) and now considering 1007/1400 (removed 393) transitions.
// Phase 1: matrix 1007 rows 626 cols
[2023-04-07 12:41:35] [INFO ] Computed 27 invariants in 7 ms
[2023-04-07 12:41:35] [INFO ] Implicit Places using invariants in 578 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 579 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 625/645 places, 1007/1400 transitions.
Applied a total of 0 rules in 10 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 610 ms. Remains : 625/645 places, 1007/1400 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s20 1) (EQ s48 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 814 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||(p1 U p2))))'
Support contains 6 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 628 transition count 1053
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 628 transition count 1053
Applied a total of 34 rules in 22 ms. Remains 628 /645 variables (removed 17) and now considering 1053/1400 (removed 347) transitions.
// Phase 1: matrix 1053 rows 628 cols
[2023-04-07 12:41:36] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 12:41:36] [INFO ] Implicit Places using invariants in 561 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 575 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 627/645 places, 1053/1400 transitions.
Applied a total of 0 rules in 21 ms. Remains 627 /627 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 618 ms. Remains : 627/645 places, 1053/1400 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s14 1) (EQ s42 1)), p1:(OR (NOT (AND (EQ s14 1) (EQ s42 1))) (AND (EQ s24 1) (EQ s37 1))), p0:(AND (EQ s13 1) (EQ s39 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][false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 163 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 915 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(F(p1)))))'
Support contains 4 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 645 transition count 1269
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 514 transition count 1269
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 282 place count 494 transition count 853
Iterating global reduction 0 with 20 rules applied. Total rules applied 302 place count 494 transition count 853
Applied a total of 302 rules in 38 ms. Remains 494 /645 variables (removed 151) and now considering 853/1400 (removed 547) transitions.
// Phase 1: matrix 853 rows 494 cols
[2023-04-07 12:41:37] [INFO ] Computed 27 invariants in 6 ms
[2023-04-07 12:41:37] [INFO ] Implicit Places using invariants in 649 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 665 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 853/1400 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 493 transition count 733
Reduce places removed 120 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 373 transition count 721
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 361 transition count 721
Applied a total of 264 rules in 23 ms. Remains 361 /493 variables (removed 132) and now considering 721/853 (removed 132) transitions.
// Phase 1: matrix 721 rows 361 cols
[2023-04-07 12:41:37] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 12:41:38] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-04-07 12:41:38] [INFO ] Invariant cache hit.
[2023-04-07 12:41:38] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:39] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/645 places, 721/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2066 ms. Remains : 361/645 places, 721/1400 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s201 1)), p1:(AND (EQ s34 1) (EQ s155 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 38 reset in 162 ms.
Stack based approach found an accepted trace after 249 steps with 0 reset with depth 250 and stack size 250 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 2318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G(F(X(p0))) U !p0))))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 31 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 12:41:39] [INFO ] Computed 27 invariants in 6 ms
[2023-04-07 12:41:40] [INFO ] Implicit Places using invariants in 571 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 585 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 11 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 12:41:40] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 12:41:40] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-04-07 12:41:40] [INFO ] Invariant cache hit.
[2023-04-07 12:41:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:41] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2162 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), false]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 1) (EQ s45 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 159 ms.
Stack based approach found an accepted trace after 165 steps with 0 reset with depth 166 and stack size 166 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 2487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 34 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 12:41:41] [INFO ] Computed 27 invariants in 5 ms
[2023-04-07 12:41:42] [INFO ] Implicit Places using invariants in 550 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 34 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 12:41:42] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 12:41:42] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-04-07 12:41:42] [INFO ] Invariant cache hit.
[2023-04-07 12:41:43] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:41:44] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2136 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 181 steps with 0 reset with depth 182 and stack size 182 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-15 finished in 2382 ms.
All properties solved by simple procedures.
Total runtime 80805 ms.
ITS solved all properties within timeout

BK_STOP 1680871305202

--------------------
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

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="Anderson-PT-12"
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 Anderson-PT-12, 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-167987246200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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