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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 927K 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-09-LTLFireability-00
FORMULA_NAME Anderson-PT-09-LTLFireability-01
FORMULA_NAME Anderson-PT-09-LTLFireability-02
FORMULA_NAME Anderson-PT-09-LTLFireability-03
FORMULA_NAME Anderson-PT-09-LTLFireability-04
FORMULA_NAME Anderson-PT-09-LTLFireability-05
FORMULA_NAME Anderson-PT-09-LTLFireability-06
FORMULA_NAME Anderson-PT-09-LTLFireability-07
FORMULA_NAME Anderson-PT-09-LTLFireability-08
FORMULA_NAME Anderson-PT-09-LTLFireability-09
FORMULA_NAME Anderson-PT-09-LTLFireability-10
FORMULA_NAME Anderson-PT-09-LTLFireability-11
FORMULA_NAME Anderson-PT-09-LTLFireability-12
FORMULA_NAME Anderson-PT-09-LTLFireability-13
FORMULA_NAME Anderson-PT-09-LTLFireability-14
FORMULA_NAME Anderson-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680863659345

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-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 10:34:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 10:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 10:34:23] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2023-04-07 10:34:23] [INFO ] Transformed 505 places.
[2023-04-07 10:34:23] [INFO ] Transformed 1845 transitions.
[2023-04-07 10:34:23] [INFO ] Found NUPN structural information;
[2023-04-07 10:34:23] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Support contains 47 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 384 transition count 908
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 384 transition count 908
Applied a total of 242 rules in 134 ms. Remains 384 /505 variables (removed 121) and now considering 908/1845 (removed 937) transitions.
// Phase 1: matrix 908 rows 384 cols
[2023-04-07 10:34:24] [INFO ] Computed 21 invariants in 57 ms
[2023-04-07 10:34:25] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2023-04-07 10:34:25] [INFO ] Invariant cache hit.
[2023-04-07 10:34:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:34:26] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 3012 ms to find 0 implicit places.
[2023-04-07 10:34:26] [INFO ] Invariant cache hit.
[2023-04-07 10:34:30] [INFO ] Dead Transitions using invariants and state equation in 3289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/505 places, 908/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6449 ms. Remains : 384/505 places, 908/1845 transitions.
Support contains 47 out of 384 places after structural reductions.
[2023-04-07 10:34:31] [INFO ] Flatten gal took : 240 ms
[2023-04-07 10:34:31] [INFO ] Flatten gal took : 121 ms
[2023-04-07 10:34:31] [INFO ] Input system was already deterministic with 908 transitions.
Support contains 46 out of 384 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=13 ) properties (out of 35) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) 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 28) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) 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 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) 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 24) 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 24) 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 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-04-07 10:34:32] [INFO ] Invariant cache hit.
[2023-04-07 10:34:33] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-04-07 10:34:33] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 30 ms returned sat
[2023-04-07 10:34:34] [INFO ] After 2096ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-04-07 10:34:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 103 ms returned sat
[2023-04-07 10:34:36] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 99 ms returned sat
[2023-04-07 10:34:40] [INFO ] After 3531ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-04-07 10:34:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:34:42] [INFO ] After 2284ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :2 sat :17
[2023-04-07 10:34:45] [INFO ] After 5240ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 2254 ms.
[2023-04-07 10:34:48] [INFO ] After 13299ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 4 properties in 207 ms.
Support contains 24 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 70 Pre rules applied. Total rules applied 0 place count 384 transition count 838
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 0 with 140 rules applied. Total rules applied 140 place count 314 transition count 838
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 150 place count 304 transition count 668
Iterating global reduction 0 with 10 rules applied. Total rules applied 160 place count 304 transition count 668
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 164 place count 302 transition count 666
Applied a total of 164 rules in 134 ms. Remains 302 /384 variables (removed 82) and now considering 666/908 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 302/384 places, 666/908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 666 rows 302 cols
[2023-04-07 10:34:49] [INFO ] Computed 21 invariants in 23 ms
[2023-04-07 10:34:50] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2023-04-07 10:34:50] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-07 10:34:50] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 10:34:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 10:34:51] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 22 ms returned sat
[2023-04-07 10:34:52] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 10:34:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:34:52] [INFO ] After 622ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 10:34:53] [INFO ] After 1475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 672 ms.
[2023-04-07 10:34:54] [INFO ] After 3463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 52 ms.
Support contains 17 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 666/666 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 298 transition count 598
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 298 transition count 598
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 297 transition count 597
Applied a total of 10 rules in 43 ms. Remains 297 /302 variables (removed 5) and now considering 597/666 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 297/302 places, 597/666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 597 rows 297 cols
[2023-04-07 10:34:55] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 10:34:55] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 10:34:55] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 42 ms returned sat
[2023-04-07 10:34:55] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 10:34:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-04-07 10:34:55] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 21 ms returned sat
[2023-04-07 10:34:57] [INFO ] After 1178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 10:34:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:34:57] [INFO ] After 393ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 10:34:57] [INFO ] Deduced a trap composed of 84 places in 228 ms of which 3 ms to minimize.
[2023-04-07 10:34:58] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 4 ms to minimize.
[2023-04-07 10:34:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2023-04-07 10:34:58] [INFO ] After 1314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-04-07 10:34:58] [INFO ] After 2937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 11 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 597/597 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 294 transition count 546
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 294 transition count 546
Applied a total of 6 rules in 72 ms. Remains 294 /297 variables (removed 3) and now considering 546/597 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 294/297 places, 546/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 571620 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 571620 steps, saw 391654 distinct states, run finished after 3002 ms. (steps per millisecond=190 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 546 rows 294 cols
[2023-04-07 10:35:02] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 10:35:02] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-07 10:35:02] [INFO ] [Real]Absence check using 11 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 10:35:02] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:35:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-04-07 10:35:02] [INFO ] [Nat]Absence check using 11 positive and 10 generalized place invariants in 30 ms returned sat
[2023-04-07 10:35:02] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:02] [INFO ] After 90ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:02] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-07 10:35:03] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 546/546 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 291 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 291 transition count 495
Applied a total of 6 rules in 38 ms. Remains 291 /294 variables (removed 3) and now considering 495/546 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 291/294 places, 495/546 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1017937 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1017937 steps, saw 698592 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 495 rows 291 cols
[2023-04-07 10:35:06] [INFO ] Computed 21 invariants in 10 ms
[2023-04-07 10:35:06] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 10:35:06] [INFO ] [Real]Absence check using 12 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 10:35:06] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:35:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 10:35:06] [INFO ] [Nat]Absence check using 12 positive and 9 generalized place invariants in 24 ms returned sat
[2023-04-07 10:35:06] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:06] [INFO ] After 116ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:06] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 10:35:06] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 10 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 291/291 places, 495/495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 495/495 transitions.
Applied a total of 0 rules in 12 ms. Remains 291 /291 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2023-04-07 10:35:06] [INFO ] Invariant cache hit.
[2023-04-07 10:35:07] [INFO ] Implicit Places using invariants in 580 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/291 places, 495/495 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 290 transition count 415
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 210 transition count 415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 210 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 209 transition count 414
Applied a total of 162 rules in 29 ms. Remains 209 /290 variables (removed 81) and now considering 414/495 (removed 81) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 10:35:07] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:35:07] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-04-07 10:35:07] [INFO ] Invariant cache hit.
[2023-04-07 10:35:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:08] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/291 places, 414/495 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1577 ms. Remains : 209/291 places, 414/495 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1064113 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1064113 steps, saw 701448 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 10:35:11] [INFO ] Invariant cache hit.
[2023-04-07 10:35:11] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 10:35:11] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 10:35:11] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:35:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 10:35:11] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 10:35:12] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:12] [INFO ] After 68ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:12] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 10:35:12] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 209/209 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 10:35:12] [INFO ] Invariant cache hit.
[2023-04-07 10:35:12] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-07 10:35:12] [INFO ] Invariant cache hit.
[2023-04-07 10:35:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:13] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2023-04-07 10:35:13] [INFO ] Redundant transitions in 27 ms returned []
[2023-04-07 10:35:13] [INFO ] Invariant cache hit.
[2023-04-07 10:35:13] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1617 ms. Remains : 209/209 places, 414/414 transitions.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 209 transition count 333
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 128 transition count 333
Applied a total of 162 rules in 31 ms. Remains 128 /209 variables (removed 81) and now considering 333/414 (removed 81) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 333 rows 128 cols
[2023-04-07 10:35:13] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:35:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 10:35:13] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 11 ms returned sat
[2023-04-07 10:35:13] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:35:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 10:35:14] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 10:35:14] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:14] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 10:35:14] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA Anderson-PT-09-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Anderson-PT-09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Anderson-PT-09-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (F((F(p3)&&p2))&&p1))))'
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 47 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 10:35:14] [INFO ] Computed 21 invariants in 9 ms
[2023-04-07 10:35:15] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-04-07 10:35:15] [INFO ] Invariant cache hit.
[2023-04-07 10:35:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:16] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-04-07 10:35:16] [INFO ] Invariant cache hit.
[2023-04-07 10:35:17] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/384 places, 583/908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2637 ms. Remains : 363/384 places, 583/908 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 713 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s303 1)), p0:(AND (EQ s21 1) (EQ s37 1)), p2:(AND (EQ s10 1) (EQ s35 1)), p3:(AND (EQ s0 1) (EQ s303 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Anderson-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLFireability-00 finished in 3447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 166 place count 290 transition count 494
Iterating global reduction 0 with 22 rules applied. Total rules applied 188 place count 290 transition count 494
Applied a total of 188 rules in 149 ms. Remains 290 /384 variables (removed 94) and now considering 494/908 (removed 414) transitions.
// Phase 1: matrix 494 rows 290 cols
[2023-04-07 10:35:18] [INFO ] Computed 21 invariants in 16 ms
[2023-04-07 10:35:18] [INFO ] Implicit Places using invariants in 659 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 661 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 494/908 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 51 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 10:35:19] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:35:19] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-04-07 10:35:19] [INFO ] Invariant cache hit.
[2023-04-07 10:35:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:19] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/384 places, 414/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1787 ms. Remains : 209/384 places, 414/908 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 358 ms.
Product exploration explored 100000 steps with 0 reset in 423 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16360 steps, run visited all 1 properties in 47 ms. (steps per millisecond=348 )
Probabilistic random walk after 16360 steps, saw 12736 distinct states, run finished after 48 ms. (steps per millisecond=340 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[p0]
Stuttering acceptance computed with spot in 68 ms :[p0]
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 40 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 10:35:21] [INFO ] Invariant cache hit.
[2023-04-07 10:35:21] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-04-07 10:35:21] [INFO ] Invariant cache hit.
[2023-04-07 10:35:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:22] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2023-04-07 10:35:22] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 10:35:22] [INFO ] Invariant cache hit.
[2023-04-07 10:35:22] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 209/209 places, 414/414 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16360 steps, run visited all 1 properties in 51 ms. (steps per millisecond=320 )
Probabilistic random walk after 16360 steps, saw 12736 distinct states, run finished after 67 ms. (steps per millisecond=244 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0]
Stuttering acceptance computed with spot in 78 ms :[p0]
Stuttering acceptance computed with spot in 64 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 414/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 209 /209 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-04-07 10:35:23] [INFO ] Invariant cache hit.
[2023-04-07 10:35:24] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 10:35:24] [INFO ] Invariant cache hit.
[2023-04-07 10:35:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:25] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2023-04-07 10:35:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 10:35:25] [INFO ] Invariant cache hit.
[2023-04-07 10:35:25] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2060 ms. Remains : 209/209 places, 414/414 transitions.
Treatment of property Anderson-PT-09-LTLFireability-02 finished in 7877 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) U X(p1)))'
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 364 transition count 600
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 364 transition count 600
Applied a total of 40 rules in 8 ms. Remains 364 /384 variables (removed 20) and now considering 600/908 (removed 308) transitions.
// Phase 1: matrix 600 rows 364 cols
[2023-04-07 10:35:26] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 10:35:26] [INFO ] Implicit Places using invariants in 583 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 591 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 363/384 places, 600/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 605 ms. Remains : 363/384 places, 600/908 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NOT (AND (EQ s24 1) (EQ s29 1))) (AND (EQ s10 1) (EQ s31 1))), p1:(AND (EQ s16 1) (EQ s33 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 138 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 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 191 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 600 rows 363 cols
[2023-04-07 10:35:28] [INFO ] Computed 20 invariants in 8 ms
[2023-04-07 10:35:28] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-07 10:35:28] [INFO ] [Real]Absence check using 11 positive and 9 generalized place invariants in 19 ms returned sat
[2023-04-07 10:35:28] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:35:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 124 ms returned sat
[2023-04-07 10:35:28] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 99 ms returned sat
[2023-04-07 10:35:29] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:29] [INFO ] After 150ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:35:29] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 10:35:29] [INFO ] After 1026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 600/600 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 363 transition count 521
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 284 transition count 521
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 158 place count 284 transition count 449
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 302 place count 212 transition count 449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 211 transition count 432
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 211 transition count 432
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 211 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 308 place count 209 transition count 430
Applied a total of 308 rules in 40 ms. Remains 209 /363 variables (removed 154) and now considering 430/600 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 209/363 places, 430/600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 40429 steps, run visited all 1 properties in 99 ms. (steps per millisecond=408 )
Probabilistic random walk after 40429 steps, saw 29758 distinct states, run finished after 112 ms. (steps per millisecond=360 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 319 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-03 finished in 4078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&(p2 U p0)&&F(p3)))))'
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 292 transition count 528
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 292 transition count 528
Applied a total of 184 rules in 53 ms. Remains 292 /384 variables (removed 92) and now considering 528/908 (removed 380) transitions.
// Phase 1: matrix 528 rows 292 cols
[2023-04-07 10:35:30] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 10:35:31] [INFO ] Implicit Places using invariants in 1174 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1186 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/384 places, 528/908 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 291 transition count 450
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 213 transition count 450
Applied a total of 156 rules in 10 ms. Remains 213 /291 variables (removed 78) and now considering 450/528 (removed 78) transitions.
// Phase 1: matrix 450 rows 213 cols
[2023-04-07 10:35:31] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:35:33] [INFO ] Implicit Places using invariants in 2164 ms returned []
[2023-04-07 10:35:33] [INFO ] Invariant cache hit.
[2023-04-07 10:35:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:34] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 213/384 places, 450/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4030 ms. Remains : 213/384 places, 450/908 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s22 0) (EQ s30 0) (AND (EQ s11 1) (EQ s30 1))), p0:(AND (EQ s21 1) (EQ s28 1)), p2:(AND (EQ s23 1) (EQ s38 1)), p3:(AND (EQ s22 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 1 ms.
FORMULA Anderson-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-04 finished in 4568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 362 transition count 566
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 362 transition count 566
Applied a total of 44 rules in 19 ms. Remains 362 /384 variables (removed 22) and now considering 566/908 (removed 342) transitions.
// Phase 1: matrix 566 rows 362 cols
[2023-04-07 10:35:34] [INFO ] Computed 21 invariants in 5 ms
[2023-04-07 10:35:35] [INFO ] Implicit Places using invariants in 515 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 518 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/384 places, 566/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 541 ms. Remains : 361/384 places, 566/908 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Anderson-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s143 1)), p1:(AND (EQ s15 1) (EQ s31 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 165 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-05 finished in 1073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 567
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 567
Applied a total of 42 rules in 14 ms. Remains 363 /384 variables (removed 21) and now considering 567/908 (removed 341) transitions.
// Phase 1: matrix 567 rows 363 cols
[2023-04-07 10:35:35] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 10:35:36] [INFO ] Implicit Places using invariants in 798 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 817 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 567/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 837 ms. Remains : 362/384 places, 567/908 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s46 1) (EQ s22 0) (EQ s29 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Product exploration explored 100000 steps with 0 reset in 203 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 129806 steps, run visited all 1 properties in 536 ms. (steps per millisecond=242 )
Probabilistic random walk after 129806 steps, saw 94362 distinct states, run finished after 549 ms. (steps per millisecond=236 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-06 finished in 2468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((!p0&&X(!p0))) U (p1 U p2)))))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 17 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 10:35:38] [INFO ] Computed 21 invariants in 10 ms
[2023-04-07 10:35:38] [INFO ] Implicit Places using invariants in 532 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 533 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 568 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s21 1) (EQ s28 1)), p1:(OR (AND (EQ s21 1) (EQ s28 1)) (AND (EQ s14 1) (EQ s32 1))), p0:(AND (EQ s14 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22179 reset in 397 ms.
Product exploration explored 100000 steps with 22217 reset in 358 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 391 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 651 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 583 rows 362 cols
[2023-04-07 10:35:41] [INFO ] Computed 20 invariants in 14 ms
[2023-04-07 10:35:41] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p2), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 22 factoid took 1251 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 403 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2))]
[2023-04-07 10:35:43] [INFO ] Invariant cache hit.
[2023-04-07 10:35:43] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F p2), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 22 factoid took 1458 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-07 finished in 7159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 291 transition count 511
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 291 transition count 511
Applied a total of 186 rules in 18 ms. Remains 291 /384 variables (removed 93) and now considering 511/908 (removed 397) transitions.
// Phase 1: matrix 511 rows 291 cols
[2023-04-07 10:35:45] [INFO ] Computed 21 invariants in 7 ms
[2023-04-07 10:35:45] [INFO ] Implicit Places using invariants in 509 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 513 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/384 places, 511/908 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 290 transition count 432
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 211 transition count 432
Applied a total of 158 rules in 13 ms. Remains 211 /290 variables (removed 79) and now considering 432/511 (removed 79) transitions.
// Phase 1: matrix 432 rows 211 cols
[2023-04-07 10:35:45] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:35:55] [INFO ] Implicit Places using invariants in 9554 ms returned []
[2023-04-07 10:35:55] [INFO ] Invariant cache hit.
[2023-04-07 10:35:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:56] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 10270 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 211/384 places, 432/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10815 ms. Remains : 211/384 places, 432/908 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s21 1) (EQ s91 1))) (NOT (AND (EQ s20 1) (EQ s100 1)))), p2:(AND (EQ s20 1) (EQ s100 1)), p0:(OR (NEQ s10 1) (NEQ s31 1)), p1:(OR (N...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Product exploration explored 100000 steps with 0 reset in 164 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 p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 124 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
Finished Best-First random walk after 1309 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=436 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 (NOT p2) p0 p1), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 221 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 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 211 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-04-07 10:35:57] [INFO ] Invariant cache hit.
[2023-04-07 10:35:57] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-04-07 10:35:58] [INFO ] Invariant cache hit.
[2023-04-07 10:35:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:35:58] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-04-07 10:35:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 10:35:58] [INFO ] Invariant cache hit.
[2023-04-07 10:35:58] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1214 ms. Remains : 211/211 places, 432/432 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND 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 154 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Finished Best-First random walk after 1617 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=231 )
Parikh walk visited 0 properties in 0 ms.
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 : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 238 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 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 432/432 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-04-07 10:36:00] [INFO ] Invariant cache hit.
[2023-04-07 10:36:00] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-04-07 10:36:00] [INFO ] Invariant cache hit.
[2023-04-07 10:36:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:36:01] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2023-04-07 10:36:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 10:36:01] [INFO ] Invariant cache hit.
[2023-04-07 10:36:01] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1266 ms. Remains : 211/211 places, 432/432 transitions.
Treatment of property Anderson-PT-09-LTLFireability-08 finished in 16068 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 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 167 place count 289 transition count 477
Iterating global reduction 0 with 23 rules applied. Total rules applied 190 place count 289 transition count 477
Applied a total of 190 rules in 40 ms. Remains 289 /384 variables (removed 95) and now considering 477/908 (removed 431) transitions.
// Phase 1: matrix 477 rows 289 cols
[2023-04-07 10:36:01] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 10:36:01] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-04-07 10:36:01] [INFO ] Invariant cache hit.
[2023-04-07 10:36:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:36:03] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2023-04-07 10:36:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 10:36:03] [INFO ] Invariant cache hit.
[2023-04-07 10:36:03] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 477/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2341 ms. Remains : 289/384 places, 477/908 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-09 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:(OR (EQ s0 0) (EQ s270 0))], 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 30 reset in 157 ms.
Product exploration explored 100000 steps with 26 reset in 174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4228 steps, including 1 resets, run visited all 1 properties in 21 ms. (steps per millisecond=201 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 6 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 10:36:04] [INFO ] Invariant cache hit.
[2023-04-07 10:36:05] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-04-07 10:36:05] [INFO ] Invariant cache hit.
[2023-04-07 10:36:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:36:05] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-04-07 10:36:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:36:06] [INFO ] Invariant cache hit.
[2023-04-07 10:36:06] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 289/289 places, 477/477 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3563 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=395 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26 reset in 207 ms.
Product exploration explored 100000 steps with 26 reset in 214 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 477/477 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2023-04-07 10:36:07] [INFO ] Invariant cache hit.
[2023-04-07 10:36:08] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-04-07 10:36:08] [INFO ] Invariant cache hit.
[2023-04-07 10:36:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:36:09] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2023-04-07 10:36:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:36:09] [INFO ] Invariant cache hit.
[2023-04-07 10:36:09] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2277 ms. Remains : 289/289 places, 477/477 transitions.
Treatment of property Anderson-PT-09-LTLFireability-09 finished in 8432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 384 transition count 837
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 313 transition count 837
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 163 place count 292 transition count 496
Iterating global reduction 0 with 21 rules applied. Total rules applied 184 place count 292 transition count 496
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 186 place count 291 transition count 495
Applied a total of 186 rules in 24 ms. Remains 291 /384 variables (removed 93) and now considering 495/908 (removed 413) transitions.
// Phase 1: matrix 495 rows 291 cols
[2023-04-07 10:36:09] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 10:36:10] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-04-07 10:36:10] [INFO ] Invariant cache hit.
[2023-04-07 10:36:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:36:11] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2023-04-07 10:36:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:36:11] [INFO ] Invariant cache hit.
[2023-04-07 10:36:11] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/384 places, 495/908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1721 ms. Remains : 291/384 places, 495/908 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (AND (EQ s21 1) (EQ s35 1)) (AND (EQ s0 1) (EQ s286 1)))) (EQ s91 1)), p0:(AND (EQ s21 1) (EQ s35 1) (EQ s91 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 184 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-11 finished in 2089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||((p1 U p0) U !p1)))))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 9 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 10:36:12] [INFO ] Computed 21 invariants in 3 ms
[2023-04-07 10:36:12] [INFO ] Implicit Places using invariants in 548 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 558 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 570 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s29 1)), p1:(AND (EQ s24 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-13 finished in 1368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 363 transition count 583
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 363 transition count 583
Applied a total of 42 rules in 8 ms. Remains 363 /384 variables (removed 21) and now considering 583/908 (removed 325) transitions.
// Phase 1: matrix 583 rows 363 cols
[2023-04-07 10:36:13] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 10:36:13] [INFO ] Implicit Places using invariants in 548 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 570 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/384 places, 583/908 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 362/384 places, 583/908 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s20 1) (NEQ s31 1) (AND (EQ s25 1) (EQ s34 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLFireability-14 finished in 1461 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 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 908/908 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 384 transition count 836
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 312 transition count 836
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 166 place count 290 transition count 494
Iterating global reduction 0 with 22 rules applied. Total rules applied 188 place count 290 transition count 494
Applied a total of 188 rules in 15 ms. Remains 290 /384 variables (removed 94) and now considering 494/908 (removed 414) transitions.
// Phase 1: matrix 494 rows 290 cols
[2023-04-07 10:36:14] [INFO ] Computed 21 invariants in 8 ms
[2023-04-07 10:36:15] [INFO ] Implicit Places using invariants in 607 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 624 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/384 places, 494/908 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 18 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
// Phase 1: matrix 414 rows 209 cols
[2023-04-07 10:36:15] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:36:15] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-04-07 10:36:15] [INFO ] Invariant cache hit.
[2023-04-07 10:36:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:36:16] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/384 places, 414/908 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1368 ms. Remains : 209/384 places, 414/908 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-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 s25 1) (EQ s33 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 138 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA Anderson-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLFireability-15 finished in 1643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
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((F(p1)||p0)))&&(!p2 U (p3||G(!p2)))))'
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)))'
[2023-04-07 10:36:17] [INFO ] Flatten gal took : 131 ms
[2023-04-07 10:36:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 10:36:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 384 places, 908 transitions and 3484 arcs took 24 ms.
Total runtime 114256 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1407/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1407/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1407/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-09-LTLFireability-02
Could not compute solution for formula : Anderson-PT-09-LTLFireability-08
Could not compute solution for formula : Anderson-PT-09-LTLFireability-09

BK_STOP 1680863779644

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-09-LTLFireability-02
ltl formula formula --ltl=/tmp/1407/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 384 places, 908 transitions and 3484 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.020 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Anderson-PT-09-LTLFireability-08
ltl formula formula --ltl=/tmp/1407/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 384 places, 908 transitions and 3484 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.010 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Anderson-PT-09-LTLFireability-09
ltl formula formula --ltl=/tmp/1407/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 384 places, 908 transitions and 3484 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1407/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-09"
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-09, 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-167987246100044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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