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.r519-tall-167987244800068.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 lolaxred
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 r519-tall-167987244800068
=====================================================================

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

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 02:06:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 02:06:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:06:28] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-04-07 02:06:28] [INFO ] Transformed 889 places.
[2023-04-07 02:06:28] [INFO ] Transformed 4152 transitions.
[2023-04-07 02:06:28] [INFO ] Found NUPN structural information;
[2023-04-07 02:06:28] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 262 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 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 143 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 02:06:28] [INFO ] Computed 27 invariants in 52 ms
[2023-04-07 02:06:29] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-04-07 02:06:29] [INFO ] Invariant cache hit.
[2023-04-07 02:06:30] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:06:31] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
[2023-04-07 02:06:31] [INFO ] Invariant cache hit.
[2023-04-07 02:06:32] [INFO ] Dead Transitions using invariants and state equation in 917 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 3962 ms. Remains : 645/889 places, 1400/4152 transitions.
Support contains 41 out of 645 places after structural reductions.
[2023-04-07 02:06:32] [INFO ] Flatten gal took : 127 ms
[2023-04-07 02:06:33] [INFO ] Flatten gal took : 90 ms
[2023-04-07 02:06:33] [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 464 ms. (steps per millisecond=21 ) properties (out of 25) seen :7
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 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-04-07 02:06:33] [INFO ] Invariant cache hit.
[2023-04-07 02:06:34] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-04-07 02:06:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-04-07 02:06:34] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 25 ms returned sat
[2023-04-07 02:06:37] [INFO ] After 2552ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2023-04-07 02:06:37] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:06:39] [INFO ] After 2041ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :2 sat :14
[2023-04-07 02:06:41] [INFO ] After 4115ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 2434 ms.
[2023-04-07 02:06:43] [INFO ] After 9553ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 2 properties in 73 ms.
Support contains 19 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 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 274 place count 503 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 284 place count 503 transition count 1082
Applied a total of 284 rules in 99 ms. Remains 503 /645 variables (removed 142) and now considering 1082/1400 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 503/645 places, 1082/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) 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 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1082 rows 503 cols
[2023-04-07 02:06:44] [INFO ] Computed 27 invariants in 23 ms
[2023-04-07 02:06:44] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 02:06:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-04-07 02:06:45] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 17 ms returned sat
[2023-04-07 02:06:46] [INFO ] After 1435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 02:06:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:06:47] [INFO ] After 782ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 02:06:48] [INFO ] After 1820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 746 ms.
[2023-04-07 02:06:49] [INFO ] After 4225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 39 ms.
Support contains 12 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 1082/1082 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 499 transition count 990
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 499 transition count 990
Applied a total of 8 rules in 44 ms. Remains 499 /503 variables (removed 4) and now considering 990/1082 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 499/503 places, 990/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) 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 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 990 rows 499 cols
[2023-04-07 02:06:49] [INFO ] Computed 27 invariants in 15 ms
[2023-04-07 02:06:50] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 02:06:50] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 16 ms returned sat
[2023-04-07 02:06:50] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 02:06:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 02:06:50] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 15 ms returned sat
[2023-04-07 02:06:51] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 02:06:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:06:52] [INFO ] After 754ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 02:06:53] [INFO ] After 1312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-04-07 02:06:53] [INFO ] After 2698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 9 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 990/990 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 498 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 498 transition count 967
Applied a total of 2 rules in 35 ms. Remains 498 /499 variables (removed 1) and now considering 967/990 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 498/499 places, 967/990 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 256017 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256017 steps, saw 206212 distinct states, run finished after 3004 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 967 rows 498 cols
[2023-04-07 02:06:56] [INFO ] Computed 27 invariants in 10 ms
[2023-04-07 02:06:57] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 02:06:57] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 16 ms returned sat
[2023-04-07 02:06:57] [INFO ] After 912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 02:06:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 02:06:58] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 16 ms returned sat
[2023-04-07 02:06:58] [INFO ] After 839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 02:06:58] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:06:59] [INFO ] After 740ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 02:07:00] [INFO ] After 1190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 412 ms.
[2023-04-07 02:07:00] [INFO ] After 2656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 35 ms.
Support contains 9 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 967/967 transitions.
Applied a total of 0 rules in 22 ms. Remains 498 /498 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 498/498 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 967/967 transitions.
Applied a total of 0 rules in 23 ms. Remains 498 /498 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2023-04-07 02:07:00] [INFO ] Invariant cache hit.
[2023-04-07 02:07:01] [INFO ] Implicit Places using invariants in 639 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 660 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 497/498 places, 967/967 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 497 transition count 828
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 358 transition count 828
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 283 place count 358 transition count 823
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 288 place count 353 transition count 823
Applied a total of 288 rules in 48 ms. Remains 353 /497 variables (removed 144) and now considering 823/967 (removed 144) transitions.
// Phase 1: matrix 823 rows 353 cols
[2023-04-07 02:07:01] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 02:07:01] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-04-07 02:07:01] [INFO ] Invariant cache hit.
[2023-04-07 02:07:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:03] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 353/498 places, 823/967 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2443 ms. Remains : 353/498 places, 823/967 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 262093 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{1=1}
Probabilistic random walk after 262093 steps, saw 207840 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :1
Running SMT prover for 4 properties.
[2023-04-07 02:07:06] [INFO ] Invariant cache hit.
[2023-04-07 02:07:06] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:06] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 8 ms returned sat
[2023-04-07 02:07:07] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 02:07:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:07] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 8 ms returned sat
[2023-04-07 02:07:07] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 02:07:07] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:08] [INFO ] After 352ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 02:07:08] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-04-07 02:07:08] [INFO ] After 1351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 823/823 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 800
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 800
Applied a total of 2 rules in 16 ms. Remains 352 /353 variables (removed 1) and now considering 800/823 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 352/353 places, 800/823 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 800 rows 352 cols
[2023-04-07 02:07:08] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 02:07:08] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:08] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 02:07:09] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:07:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-04-07 02:07:09] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 02:07:09] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:07:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:10] [INFO ] After 271ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:07:10] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-04-07 02:07:10] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 800/800 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 351 transition count 777
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 777
Applied a total of 2 rules in 21 ms. Remains 351 /352 variables (removed 1) and now considering 777/800 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 351/352 places, 777/800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 366159 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{0=1}
Probabilistic random walk after 366159 steps, saw 289163 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 777 rows 351 cols
[2023-04-07 02:07:13] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 02:07:13] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:13] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:07:13] [INFO ] After 249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 02:07:13] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:14] [INFO ] After 42ms SMT Verify possible using 132 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:07:14] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:07:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:14] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 17 ms returned sat
[2023-04-07 02:07:14] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:07:14] [INFO ] After 194ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:07:14] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-04-07 02:07:14] [INFO ] After 771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 777/777 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 350 transition count 754
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 350 transition count 754
Applied a total of 2 rules in 18 ms. Remains 350 /351 variables (removed 1) and now considering 754/777 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 350/351 places, 754/777 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 446250 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446250 steps, saw 351260 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 754 rows 350 cols
[2023-04-07 02:07:17] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 02:07:17] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:17] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 02:07:18] [INFO ] After 255ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 02:07:18] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:18] [INFO ] After 122ms SMT Verify possible using 132 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:07:18] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:07:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-04-07 02:07:18] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 9 ms returned sat
[2023-04-07 02:07:18] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:07:18] [INFO ] After 209ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:07:19] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-04-07 02:07:19] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 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 10 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 10 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 9 ms. Remains 350 /350 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-04-07 02:07:19] [INFO ] Invariant cache hit.
[2023-04-07 02:07:19] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-04-07 02:07:19] [INFO ] Invariant cache hit.
[2023-04-07 02:07:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:20] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2023-04-07 02:07:20] [INFO ] Redundant transitions in 47 ms returned []
[2023-04-07 02:07:20] [INFO ] Invariant cache hit.
[2023-04-07 02:07:21] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1816 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 02:07:21] [INFO ] Computed 26 invariants in 13 ms
[2023-04-07 02:07:21] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 02:07:21] [INFO ] [Real]Absence check using 15 positive and 11 generalized place invariants in 6 ms returned sat
[2023-04-07 02:07:21] [INFO ] After 182ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 02:07:21] [INFO ] After 229ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:07:21] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:07:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 02:07:21] [INFO ] [Nat]Absence check using 15 positive and 11 generalized place invariants in 7 ms returned sat
[2023-04-07 02:07:21] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:07:21] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-04-07 02:07:21] [INFO ] After 457ms 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 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 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 45 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 02:07:22] [INFO ] Computed 27 invariants in 8 ms
[2023-04-07 02:07:22] [INFO ] Implicit Places using invariants in 550 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 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 18 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 02:07:22] [INFO ] Computed 26 invariants in 12 ms
[2023-04-07 02:07:22] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-04-07 02:07:22] [INFO ] Invariant cache hit.
[2023-04-07 02:07:23] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:24] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1550 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 2166 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 193 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 352 ms.
Product exploration explored 100000 steps with 0 reset in 294 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 190 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 02:07:25] [INFO ] Invariant cache hit.
[2023-04-07 02:07:25] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:07:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-04-07 02:07:25] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 02:07:25] [INFO ] After 85ms 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 3575 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 34 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 02:07:25] [INFO ] Computed 27 invariants in 9 ms
[2023-04-07 02:07:26] [INFO ] Implicit Places using invariants in 764 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 767 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 10 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 812 ms. Remains : 626/645 places, 1008/1400 transitions.
Stuttering acceptance computed with spot in 106 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 11 reset in 223 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 138 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-01 finished in 1159 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 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 41 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 02:07:26] [INFO ] Computed 27 invariants in 17 ms
[2023-04-07 02:07:27] [INFO ] Implicit Places using invariants in 590 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 593 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 15 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 02:07:27] [INFO ] Computed 26 invariants in 11 ms
[2023-04-07 02:07:27] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-04-07 02:07:27] [INFO ] Invariant cache hit.
[2023-04-07 02:07:27] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:28] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1463 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 2113 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 64 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 195 ms.
Entered a terminal (fully accepting) state of product in 10 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 2395 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 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 02:07:29] [INFO ] Computed 27 invariants in 13 ms
[2023-04-07 02:07:29] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-04-07 02:07:29] [INFO ] Invariant cache hit.
[2023-04-07 02:07:30] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:32] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 2882 ms to find 0 implicit places.
[2023-04-07 02:07:32] [INFO ] Invariant cache hit.
[2023-04-07 02:07:32] [INFO ] Dead Transitions using invariants and state equation in 779 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 3688 ms. Remains : 627/645 places, 1008/1400 transitions.
Stuttering acceptance computed with spot in 202 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 225 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-05 finished in 4149 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 38 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 02:07:33] [INFO ] Computed 27 invariants in 16 ms
[2023-04-07 02:07:33] [INFO ] Implicit Places using invariants in 559 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 561 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 13 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 02:07:33] [INFO ] Computed 26 invariants in 8 ms
[2023-04-07 02:07:34] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-04-07 02:07:34] [INFO ] Invariant cache hit.
[2023-04-07 02:07:34] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:35] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1305 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 1917 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 39 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 168 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-06 finished in 2147 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 02:07:35] [INFO ] Computed 27 invariants in 11 ms
[2023-04-07 02:07:36] [INFO ] Implicit Places using invariants in 595 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 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 633 ms. Remains : 626/645 places, 1030/1400 transitions.
Stuttering acceptance computed with spot in 261 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 546 ms.
Product exploration explored 100000 steps with 50000 reset in 528 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 16 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 2016 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 21 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 02:07:37] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 02:07:38] [INFO ] Implicit Places using invariants in 556 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 573 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 9 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 604 ms. Remains : 625/645 places, 1007/1400 transitions.
Stuttering acceptance computed with spot in 76 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 1 ms.
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 699 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 29 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 02:07:38] [INFO ] Computed 27 invariants in 17 ms
[2023-04-07 02:07:38] [INFO ] Implicit Places using invariants in 598 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 599 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 10 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 639 ms. Remains : 627/645 places, 1053/1400 transitions.
Stuttering acceptance computed with spot in 239 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 12 reset in 205 ms.
Stack based approach found an accepted trace after 116 steps with 0 reset with depth 117 and stack size 117 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 1109 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 0 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 39 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 02:07:39] [INFO ] Computed 27 invariants in 10 ms
[2023-04-07 02:07:39] [INFO ] Implicit Places using invariants in 519 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 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 14 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 02:07:39] [INFO ] Computed 26 invariants in 6 ms
[2023-04-07 02:07:40] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-04-07 02:07:40] [INFO ] Invariant cache hit.
[2023-04-07 02:07:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:41] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1289 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 1863 ms. Remains : 361/645 places, 721/1400 transitions.
Stuttering acceptance computed with spot in 77 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 27 reset in 175 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 2141 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 35 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 02:07:41] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 02:07:42] [INFO ] Implicit Places using invariants in 576 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 577 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 12 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 02:07:42] [INFO ] Computed 26 invariants in 6 ms
[2023-04-07 02:07:42] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-04-07 02:07:42] [INFO ] Invariant cache hit.
[2023-04-07 02:07:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:43] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1324 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 1949 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 96 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 161 ms.
Stack based approach found an accepted trace after 96 steps with 0 reset with depth 97 and stack size 97 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 2229 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 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 36 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 02:07:43] [INFO ] Computed 27 invariants in 11 ms
[2023-04-07 02:07:44] [INFO ] Implicit Places using invariants in 545 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 546 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 12 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 02:07:44] [INFO ] Computed 26 invariants in 10 ms
[2023-04-07 02:07:44] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-04-07 02:07:44] [INFO ] Invariant cache hit.
[2023-04-07 02:07:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 02:07:45] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1159 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 1753 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 73 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 154 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 111 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-15 finished in 2002 ms.
All properties solved by simple procedures.
Total runtime 77423 ms.
ITS solved all properties within timeout

BK_STOP 1680833266762

--------------------
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="lolaxred"
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 lolaxred"
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 r519-tall-167987244800068"
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 ;