About the Execution of ITS-Tools for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 992.300 | 167309.00 | 212017.00 | 2224.70 | FFFFFFFFFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243600276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is EisenbergMcGuire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1680838555402
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 03:35:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 03:35:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:35:57] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-04-07 03:35:57] [INFO ] Transformed 1090 places.
[2023-04-07 03:35:57] [INFO ] Transformed 5200 transitions.
[2023-04-07 03:35:57] [INFO ] Found NUPN structural information;
[2023-04-07 03:35:57] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 1004 transition count 4340
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 1004 transition count 4340
Applied a total of 172 rules in 188 ms. Remains 1004 /1090 variables (removed 86) and now considering 4340/5200 (removed 860) transitions.
[2023-04-07 03:35:57] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
// Phase 1: matrix 1470 rows 1004 cols
[2023-04-07 03:35:57] [INFO ] Computed 31 invariants in 33 ms
[2023-04-07 03:35:58] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-04-07 03:35:58] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 03:35:58] [INFO ] Invariant cache hit.
[2023-04-07 03:35:59] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 03:36:05] [INFO ] Implicit Places using invariants and state equation in 6447 ms returned []
Implicit Place search using SMT with State Equation took 7460 ms to find 0 implicit places.
[2023-04-07 03:36:05] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 03:36:05] [INFO ] Invariant cache hit.
[2023-04-07 03:36:06] [INFO ] Dead Transitions using invariants and state equation in 1623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1004/1090 places, 4340/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9274 ms. Remains : 1004/1090 places, 4340/5200 transitions.
Support contains 52 out of 1004 places after structural reductions.
[2023-04-07 03:36:07] [INFO ] Flatten gal took : 322 ms
[2023-04-07 03:36:07] [INFO ] Flatten gal took : 169 ms
[2023-04-07 03:36:08] [INFO ] Input system was already deterministic with 4340 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 120406 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{11=1, 12=1, 13=1}
Probabilistic random walk after 120406 steps, saw 97471 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :3
Running SMT prover for 18 properties.
[2023-04-07 03:36:11] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2023-04-07 03:36:11] [INFO ] Invariant cache hit.
[2023-04-07 03:36:12] [INFO ] [Real]Absence check using 21 positive place invariants in 24 ms returned sat
[2023-04-07 03:36:12] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 22 ms returned sat
[2023-04-07 03:36:13] [INFO ] After 1355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 03:36:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned sat
[2023-04-07 03:36:13] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 03:36:15] [INFO ] After 1686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-07 03:36:15] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 03:36:17] [INFO ] After 1932ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-07 03:36:18] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 4 ms to minimize.
[2023-04-07 03:36:18] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2023-04-07 03:36:18] [INFO ] Deduced a trap composed of 3 places in 396 ms of which 1 ms to minimize.
[2023-04-07 03:36:19] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 1 ms to minimize.
[2023-04-07 03:36:19] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 1 ms to minimize.
[2023-04-07 03:36:20] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 0 ms to minimize.
[2023-04-07 03:36:20] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2023-04-07 03:36:20] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2023-04-07 03:36:20] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 1 ms to minimize.
[2023-04-07 03:36:21] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2023-04-07 03:36:21] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-04-07 03:36:21] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2023-04-07 03:36:21] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 0 ms to minimize.
[2023-04-07 03:36:21] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 1 ms to minimize.
[2023-04-07 03:36:22] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 0 ms to minimize.
[2023-04-07 03:36:22] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-04-07 03:36:22] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4739 ms
[2023-04-07 03:36:22] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2023-04-07 03:36:22] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2023-04-07 03:36:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-04-07 03:36:23] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-07 03:36:23] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2023-04-07 03:36:23] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2023-04-07 03:36:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 529 ms
[2023-04-07 03:36:23] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2023-04-07 03:36:23] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-04-07 03:36:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2023-04-07 03:36:24] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 1 ms to minimize.
[2023-04-07 03:36:24] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 0 ms to minimize.
[2023-04-07 03:36:24] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 0 ms to minimize.
[2023-04-07 03:36:24] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-04-07 03:36:24] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2023-04-07 03:36:25] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2023-04-07 03:36:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1226 ms
[2023-04-07 03:36:25] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 0 ms to minimize.
[2023-04-07 03:36:25] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-04-07 03:36:25] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-04-07 03:36:26] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2023-04-07 03:36:26] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2023-04-07 03:36:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1069 ms
[2023-04-07 03:36:26] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 1 ms to minimize.
[2023-04-07 03:36:27] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 0 ms to minimize.
[2023-04-07 03:36:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 647 ms
[2023-04-07 03:36:27] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2023-04-07 03:36:27] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2023-04-07 03:36:27] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-04-07 03:36:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 624 ms
[2023-04-07 03:36:28] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2023-04-07 03:36:28] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-04-07 03:36:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2023-04-07 03:36:29] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2023-04-07 03:36:29] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2023-04-07 03:36:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2023-04-07 03:36:30] [INFO ] After 14626ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
Attempting to minimize the solution found.
Minimization took 1946 ms.
[2023-04-07 03:36:32] [INFO ] After 19013ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1105 ms.
Support contains 37 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1004 transition count 4331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 995 transition count 4331
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 307 Pre rules applied. Total rules applied 18 place count 995 transition count 4024
Deduced a syphon composed of 307 places in 4 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 2 with 614 rules applied. Total rules applied 632 place count 688 transition count 4024
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 812 place count 598 transition count 3934
Applied a total of 812 rules in 444 ms. Remains 598 /1004 variables (removed 406) and now considering 3934/4340 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 598/1004 places, 3934/4340 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 162701 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{5=1, 13=1}
Probabilistic random walk after 162701 steps, saw 114485 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :2
Running SMT prover for 14 properties.
[2023-04-07 03:36:37] [INFO ] Flow matrix only has 1064 transitions (discarded 2870 similar events)
// Phase 1: matrix 1064 rows 598 cols
[2023-04-07 03:36:37] [INFO ] Computed 31 invariants in 7 ms
[2023-04-07 03:36:37] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-07 03:36:37] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:36:38] [INFO ] After 1002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 03:36:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:36:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:36:39] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 03:36:39] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-07 03:36:40] [INFO ] After 803ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 03:36:40] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 0 ms to minimize.
[2023-04-07 03:36:40] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 1 ms to minimize.
[2023-04-07 03:36:40] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2023-04-07 03:36:40] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 1 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-04-07 03:36:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1902 ms
[2023-04-07 03:36:42] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2023-04-07 03:36:42] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 03:36:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-04-07 03:36:42] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-04-07 03:36:42] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 03:36:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-04-07 03:36:43] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 0 ms to minimize.
[2023-04-07 03:36:43] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-04-07 03:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2023-04-07 03:36:43] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2023-04-07 03:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-07 03:36:43] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2023-04-07 03:36:43] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 0 ms to minimize.
[2023-04-07 03:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-04-07 03:36:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-07 03:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 03:36:44] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-04-07 03:36:44] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2023-04-07 03:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-04-07 03:36:44] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 03:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-07 03:36:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 3 ms to minimize.
[2023-04-07 03:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 03:36:44] [INFO ] After 5716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 922 ms.
[2023-04-07 03:36:45] [INFO ] After 7770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 174 ms.
Support contains 35 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 3934/3934 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 598 transition count 3933
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 597 transition count 3933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 3923
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 3923
Applied a total of 4 rules in 221 ms. Remains 596 /598 variables (removed 2) and now considering 3923/3934 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 596/598 places, 3923/3934 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 129811 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129811 steps, saw 93569 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 14 properties.
[2023-04-07 03:36:50] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
// Phase 1: matrix 1053 rows 596 cols
[2023-04-07 03:36:50] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 03:36:50] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 03:36:50] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:36:50] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 03:36:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 03:36:50] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:36:51] [INFO ] After 722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 03:36:51] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-04-07 03:36:52] [INFO ] After 777ms SMT Verify possible using 463 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 03:36:52] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-07 03:36:52] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 0 ms to minimize.
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-07 03:36:53] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1741 ms
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-04-07 03:36:54] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 872 ms
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 0 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2023-04-07 03:36:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2023-04-07 03:36:55] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 1 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 600 ms
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-04-07 03:36:56] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 0 ms to minimize.
[2023-04-07 03:36:57] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 0 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2023-04-07 03:36:58] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2023-04-07 03:36:59] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2023-04-07 03:36:59] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:36:59] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2701 ms
[2023-04-07 03:36:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-04-07 03:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-07 03:36:59] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2023-04-07 03:37:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-04-07 03:37:00] [INFO ] After 9135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 955 ms.
[2023-04-07 03:37:01] [INFO ] After 11145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 137 ms.
Support contains 35 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3923/3923 transitions.
Applied a total of 0 rules in 149 ms. Remains 596 /596 variables (removed 0) and now considering 3923/3923 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 596/596 places, 3923/3923 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3923/3923 transitions.
Applied a total of 0 rules in 149 ms. Remains 596 /596 variables (removed 0) and now considering 3923/3923 (removed 0) transitions.
[2023-04-07 03:37:02] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 03:37:02] [INFO ] Invariant cache hit.
[2023-04-07 03:37:02] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-04-07 03:37:02] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 03:37:02] [INFO ] Invariant cache hit.
[2023-04-07 03:37:03] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-04-07 03:37:06] [INFO ] Implicit Places using invariants and state equation in 3319 ms returned []
Implicit Place search using SMT with State Equation took 3781 ms to find 0 implicit places.
[2023-04-07 03:37:06] [INFO ] Redundant transitions in 235 ms returned []
[2023-04-07 03:37:06] [INFO ] Flow matrix only has 1053 transitions (discarded 2870 similar events)
[2023-04-07 03:37:06] [INFO ] Invariant cache hit.
[2023-04-07 03:37:07] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5300 ms. Remains : 596/596 places, 3923/3923 transitions.
Graph (trivial) has 3367 edges and 596 vertex of which 100 / 596 are part of one of the 10 SCC in 5 ms
Free SCC test removed 90 places
Drop transitions removed 344 transitions
Ensure Unique test removed 2817 transitions
Reduce isomorphic transitions removed 3161 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 506 transition count 654
Reduce places removed 108 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 219 place count 398 transition count 652
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 221 place count 396 transition count 652
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 221 place count 396 transition count 634
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 264 place count 371 transition count 634
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 598 place count 204 transition count 467
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 667 place count 204 transition count 398
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 673 place count 201 transition count 398
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 676 place count 201 transition count 395
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 695 place count 201 transition count 376
Free-agglomeration rule applied 102 times.
Iterating global reduction 5 with 102 rules applied. Total rules applied 797 place count 201 transition count 274
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 899 place count 99 transition count 274
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 909 place count 99 transition count 274
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 910 place count 99 transition count 274
Applied a total of 910 rules in 66 ms. Remains 99 /596 variables (removed 497) and now considering 274/3923 (removed 3649) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 274 rows 99 cols
[2023-04-07 03:37:07] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 03:37:07] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 03:37:07] [INFO ] [Real]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:37:07] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 03:37:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 03:37:07] [INFO ] [Nat]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 03:37:07] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-07 03:37:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 03:37:08] [INFO ] After 129ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 144 ms
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-04-07 03:37:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-04-07 03:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-04-07 03:37:08] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-04-07 03:37:08] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 383 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 03:37:09] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:37:09] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 03:37:09] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-04-07 03:37:09] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:37:09] [INFO ] Invariant cache hit.
[2023-04-07 03:37:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:37:13] [INFO ] Implicit Places using invariants and state equation in 3638 ms returned []
Implicit Place search using SMT with State Equation took 4197 ms to find 0 implicit places.
[2023-04-07 03:37:13] [INFO ] Redundant transitions in 130 ms returned []
[2023-04-07 03:37:13] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:37:13] [INFO ] Invariant cache hit.
[2023-04-07 03:37:14] [INFO ] Dead Transitions using invariants and state equation in 1200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5921 ms. Remains : 591/1004 places, 3891/4340 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 152 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s23 1) (EQ s434 1)), p0:(OR (AND (EQ s33 1) (EQ s260 1)) (AND (EQ s3 1) (EQ s20 1) (EQ s366 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 485 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-00 finished in 6623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 50 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 03:37:15] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 03:37:15] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 03:37:16] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-04-07 03:37:16] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:16] [INFO ] Invariant cache hit.
[2023-04-07 03:37:17] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:37:22] [INFO ] Implicit Places using invariants and state equation in 6265 ms returned []
Implicit Place search using SMT with State Equation took 7087 ms to find 0 implicit places.
[2023-04-07 03:37:22] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:22] [INFO ] Invariant cache hit.
[2023-04-07 03:37:24] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8469 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s764 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-03 finished in 8888 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 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 251 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 03:37:24] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:37:24] [INFO ] Computed 31 invariants in 5 ms
[2023-04-07 03:37:25] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-04-07 03:37:25] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:37:25] [INFO ] Invariant cache hit.
[2023-04-07 03:37:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:37:28] [INFO ] Implicit Places using invariants and state equation in 3664 ms returned []
Implicit Place search using SMT with State Equation took 4260 ms to find 0 implicit places.
[2023-04-07 03:37:29] [INFO ] Redundant transitions in 167 ms returned []
[2023-04-07 03:37:29] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:37:29] [INFO ] Invariant cache hit.
[2023-04-07 03:37:30] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5856 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-04 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 s21 1) (EQ s260 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 350 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-04 finished in 6309 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)&&F(p1))))'
Support contains 3 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 643 place count 681 transition count 3990
Iterating global reduction 2 with 3 rules applied. Total rules applied 646 place count 681 transition count 3990
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 824 place count 592 transition count 3901
Applied a total of 824 rules in 246 ms. Remains 592 /1004 variables (removed 412) and now considering 3901/4340 (removed 439) transitions.
[2023-04-07 03:37:30] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
// Phase 1: matrix 1031 rows 592 cols
[2023-04-07 03:37:30] [INFO ] Computed 31 invariants in 7 ms
[2023-04-07 03:37:31] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-04-07 03:37:31] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2023-04-07 03:37:31] [INFO ] Invariant cache hit.
[2023-04-07 03:37:31] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 03:37:35] [INFO ] Implicit Places using invariants and state equation in 3609 ms returned []
Implicit Place search using SMT with State Equation took 4168 ms to find 0 implicit places.
[2023-04-07 03:37:35] [INFO ] Redundant transitions in 167 ms returned []
[2023-04-07 03:37:35] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2023-04-07 03:37:35] [INFO ] Invariant cache hit.
[2023-04-07 03:37:36] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/1004 places, 3901/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5778 ms. Remains : 592/1004 places, 3901/4340 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s160 1)), p1:(EQ s161 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 332 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-05 finished in 6263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 6 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 45 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 03:37:36] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
// Phase 1: matrix 1430 rows 1000 cols
[2023-04-07 03:37:36] [INFO ] Computed 31 invariants in 14 ms
[2023-04-07 03:37:37] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-04-07 03:37:37] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:37] [INFO ] Invariant cache hit.
[2023-04-07 03:37:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:37:44] [INFO ] Implicit Places using invariants and state equation in 6740 ms returned []
Implicit Place search using SMT with State Equation took 7436 ms to find 0 implicit places.
[2023-04-07 03:37:44] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:44] [INFO ] Invariant cache hit.
[2023-04-07 03:37:45] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8854 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s21 1) (EQ s737 1)), p1:(OR (NEQ s8 1) (NEQ s36 1) (NEQ s754 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 300 ms.
Stack based approach found an accepted trace after 195 steps with 0 reset with depth 196 and stack size 196 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-06 finished in 9384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 47 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 03:37:46] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:46] [INFO ] Invariant cache hit.
[2023-04-07 03:37:47] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-04-07 03:37:47] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:47] [INFO ] Invariant cache hit.
[2023-04-07 03:37:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:37:54] [INFO ] Implicit Places using invariants and state equation in 7239 ms returned []
Implicit Place search using SMT with State Equation took 7924 ms to find 0 implicit places.
[2023-04-07 03:37:54] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:54] [INFO ] Invariant cache hit.
[2023-04-07 03:37:55] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9390 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s17 1) (EQ s842 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-08 finished in 9506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(G(p1)))))'
Support contains 7 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 47 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2023-04-07 03:37:55] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:55] [INFO ] Invariant cache hit.
[2023-04-07 03:37:56] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-04-07 03:37:56] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:37:56] [INFO ] Invariant cache hit.
[2023-04-07 03:37:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:38:03] [INFO ] Implicit Places using invariants and state equation in 6821 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
[2023-04-07 03:38:03] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2023-04-07 03:38:03] [INFO ] Invariant cache hit.
[2023-04-07 03:38:04] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8949 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s34 1) (EQ s557 1)), p0:(OR (AND (EQ s0 1) (EQ s10 1) (EQ s759 1)) (AND (EQ s2 1) (EQ s906 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-09 finished in 9126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1004 transition count 4331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 995 transition count 4331
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 18 place count 995 transition count 4021
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 246 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 03:38:05] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:38:05] [INFO ] Computed 31 invariants in 10 ms
[2023-04-07 03:38:05] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-04-07 03:38:05] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:38:05] [INFO ] Invariant cache hit.
[2023-04-07 03:38:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:38:09] [INFO ] Implicit Places using invariants and state equation in 3510 ms returned []
Implicit Place search using SMT with State Equation took 4107 ms to find 0 implicit places.
[2023-04-07 03:38:09] [INFO ] Redundant transitions in 166 ms returned []
[2023-04-07 03:38:09] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:38:09] [INFO ] Invariant cache hit.
[2023-04-07 03:38:10] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5677 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s34 1) (EQ s414 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-10 finished in 6061 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)&&F(G(p1)))))'
Support contains 6 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 994 transition count 4022
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 686 transition count 4022
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 640 place count 682 transition count 3982
Iterating global reduction 2 with 4 rules applied. Total rules applied 644 place count 682 transition count 3982
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 822 place count 593 transition count 3893
Applied a total of 822 rules in 233 ms. Remains 593 /1004 variables (removed 411) and now considering 3893/4340 (removed 447) transitions.
[2023-04-07 03:38:11] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
// Phase 1: matrix 1023 rows 593 cols
[2023-04-07 03:38:11] [INFO ] Computed 31 invariants in 5 ms
[2023-04-07 03:38:11] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-04-07 03:38:11] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2023-04-07 03:38:11] [INFO ] Invariant cache hit.
[2023-04-07 03:38:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:38:15] [INFO ] Implicit Places using invariants and state equation in 3517 ms returned []
Implicit Place search using SMT with State Equation took 4114 ms to find 0 implicit places.
[2023-04-07 03:38:15] [INFO ] Redundant transitions in 167 ms returned []
[2023-04-07 03:38:15] [INFO ] Flow matrix only has 1023 transitions (discarded 2870 similar events)
[2023-04-07 03:38:15] [INFO ] Invariant cache hit.
[2023-04-07 03:38:16] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 593/1004 places, 3893/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5706 ms. Remains : 593/1004 places, 3893/4340 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s6 1) (NEQ s30 1) (NEQ s397 1)), p1:(OR (NEQ s103 1) (AND (EQ s32 1) (EQ s466 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 294 ms.
Stack based approach found an accepted trace after 612 steps with 0 reset with depth 613 and stack size 559 in 3 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-11 finished in 6159 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||(p1 U p2))))'
Support contains 5 out of 1004 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 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 643 place count 681 transition count 3990
Iterating global reduction 2 with 3 rules applied. Total rules applied 646 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3900
Applied a total of 826 rules in 224 ms. Remains 591 /1004 variables (removed 413) and now considering 3900/4340 (removed 440) transitions.
[2023-04-07 03:38:17] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
// Phase 1: matrix 1030 rows 591 cols
[2023-04-07 03:38:17] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 03:38:17] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-04-07 03:38:17] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2023-04-07 03:38:17] [INFO ] Invariant cache hit.
[2023-04-07 03:38:18] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 03:38:21] [INFO ] Implicit Places using invariants and state equation in 3425 ms returned []
Implicit Place search using SMT with State Equation took 4031 ms to find 0 implicit places.
[2023-04-07 03:38:21] [INFO ] Redundant transitions in 165 ms returned []
[2023-04-07 03:38:21] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2023-04-07 03:38:21] [INFO ] Invariant cache hit.
[2023-04-07 03:38:22] [INFO ] Dead Transitions using invariants and state equation in 1173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3900/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5612 ms. Remains : 591/1004 places, 3900/4340 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s160 1)), p2:(AND (EQ s8 1) (EQ s35 1) (EQ s371 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 290 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-12 finished in 5968 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 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1001 transition count 4310
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1001 transition count 4310
Applied a total of 6 rules in 50 ms. Remains 1001 /1004 variables (removed 3) and now considering 4310/4340 (removed 30) transitions.
[2023-04-07 03:38:23] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
// Phase 1: matrix 1440 rows 1001 cols
[2023-04-07 03:38:23] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 03:38:23] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-04-07 03:38:23] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2023-04-07 03:38:23] [INFO ] Invariant cache hit.
[2023-04-07 03:38:24] [INFO ] State equation strengthened by 445 read => feed constraints.
[2023-04-07 03:38:31] [INFO ] Implicit Places using invariants and state equation in 7316 ms returned []
Implicit Place search using SMT with State Equation took 7981 ms to find 0 implicit places.
[2023-04-07 03:38:31] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2023-04-07 03:38:31] [INFO ] Invariant cache hit.
[2023-04-07 03:38:32] [INFO ] Dead Transitions using invariants and state equation in 1447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1001/1004 places, 4310/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9498 ms. Remains : 1001/1004 places, 4310/4340 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-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 (EQ s3 0) (EQ s21 0) (EQ s675 0) (AND (EQ s3 1) (EQ s250 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 1265 ms.
Product exploration explored 100000 steps with 50000 reset in 1236 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 EisenbergMcGuire-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-14 finished in 12131 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 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 212 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2023-04-07 03:38:35] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:38:35] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 03:38:36] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-04-07 03:38:36] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:38:36] [INFO ] Invariant cache hit.
[2023-04-07 03:38:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:38:39] [INFO ] Implicit Places using invariants and state equation in 3613 ms returned []
Implicit Place search using SMT with State Equation took 4225 ms to find 0 implicit places.
[2023-04-07 03:38:39] [INFO ] Redundant transitions in 168 ms returned []
[2023-04-07 03:38:39] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:38:39] [INFO ] Invariant cache hit.
[2023-04-07 03:38:41] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5830 ms. Remains : 591/1004 places, 3891/4340 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-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 s24 1) (EQ s260 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 275 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-15 finished in 6195 ms.
All properties solved by simple procedures.
Total runtime 164576 ms.
BK_STOP 1680838722711
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r517-tall-167987243600276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 '
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 ;