Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000660.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 22:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 22:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 219K Feb 25 22:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 22:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 22:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.4M Mar 5 18:22 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 CANConstruction-PT-060-LTLFireability-00
FORMULA_NAME CANConstruction-PT-060-LTLFireability-01
FORMULA_NAME CANConstruction-PT-060-LTLFireability-02
FORMULA_NAME CANConstruction-PT-060-LTLFireability-03
FORMULA_NAME CANConstruction-PT-060-LTLFireability-04
FORMULA_NAME CANConstruction-PT-060-LTLFireability-05
FORMULA_NAME CANConstruction-PT-060-LTLFireability-06
FORMULA_NAME CANConstruction-PT-060-LTLFireability-07
FORMULA_NAME CANConstruction-PT-060-LTLFireability-08
FORMULA_NAME CANConstruction-PT-060-LTLFireability-09
FORMULA_NAME CANConstruction-PT-060-LTLFireability-10
FORMULA_NAME CANConstruction-PT-060-LTLFireability-11
FORMULA_NAME CANConstruction-PT-060-LTLFireability-12
FORMULA_NAME CANConstruction-PT-060-LTLFireability-13
FORMULA_NAME CANConstruction-PT-060-LTLFireability-14
FORMULA_NAME CANConstruction-PT-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678654684395

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:58:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 20:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:58:06] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2023-03-12 20:58:06] [INFO ] Transformed 7922 places.
[2023-03-12 20:58:06] [INFO ] Transformed 14880 transitions.
[2023-03-12 20:58:06] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-060-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-060-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 7922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Discarding 3466 places :
Symmetric choice reduction at 0 with 3466 rule applications. Total rules 3466 place count 4456 transition count 7948
Iterating global reduction 0 with 3466 rules applied. Total rules applied 6932 place count 4456 transition count 7948
Applied a total of 6932 rules in 1382 ms. Remains 4456 /7922 variables (removed 3466) and now considering 7948/14880 (removed 6932) transitions.
// Phase 1: matrix 7948 rows 4456 cols
[2023-03-12 20:58:08] [INFO ] Computed 121 place invariants in 142 ms
[2023-03-12 20:58:11] [INFO ] Implicit Places using invariants in 3408 ms returned []
[2023-03-12 20:58:11] [INFO ] Invariant cache hit.
[2023-03-12 20:58:14] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 5832 ms to find 0 implicit places.
[2023-03-12 20:58:14] [INFO ] Invariant cache hit.
[2023-03-12 20:58:18] [INFO ] Dead Transitions using invariants and state equation in 4359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4456/7922 places, 7948/14880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11578 ms. Remains : 4456/7922 places, 7948/14880 transitions.
Support contains 48 out of 4456 places after structural reductions.
[2023-03-12 20:58:19] [INFO ] Flatten gal took : 415 ms
[2023-03-12 20:58:19] [INFO ] Flatten gal took : 257 ms
[2023-03-12 20:58:20] [INFO ] Input system was already deterministic with 7948 transitions.
Support contains 45 out of 4456 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 30) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-12 20:58:21] [INFO ] Invariant cache hit.
[2023-03-12 20:58:22] [INFO ] [Real]Absence check using 61 positive place invariants in 81 ms returned sat
[2023-03-12 20:58:22] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 40 ms returned sat
[2023-03-12 20:58:26] [INFO ] After 3443ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2023-03-12 20:58:26] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 20:58:27] [INFO ] After 997ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 20:58:27] [INFO ] After 6125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-12 20:58:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 182 ms returned sat
[2023-03-12 20:58:28] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 38 ms returned sat
[2023-03-12 20:58:34] [INFO ] After 5702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-12 20:58:40] [INFO ] After 6001ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-12 20:58:46] [INFO ] After 11534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 3638 ms.
[2023-03-12 20:58:49] [INFO ] After 22791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 108 ms.
Support contains 11 out of 4456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 4456 transition count 7529
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 4037 transition count 7529
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 843 place count 4032 transition count 7519
Iterating global reduction 2 with 5 rules applied. Total rules applied 848 place count 4032 transition count 7519
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 968 place count 3972 transition count 7459
Free-agglomeration rule applied 102 times.
Iterating global reduction 2 with 102 rules applied. Total rules applied 1070 place count 3972 transition count 7357
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 1172 place count 3870 transition count 7357
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1173 place count 3870 transition count 7356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1174 place count 3869 transition count 7356
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1192 place count 3869 transition count 7356
Applied a total of 1192 rules in 4369 ms. Remains 3869 /4456 variables (removed 587) and now considering 7356/7948 (removed 592) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4370 ms. Remains : 3869/4456 places, 7356/7948 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7356 rows 3869 cols
[2023-03-12 20:58:54] [INFO ] Computed 121 place invariants in 51 ms
[2023-03-12 20:58:55] [INFO ] [Real]Absence check using 61 positive place invariants in 65 ms returned sat
[2023-03-12 20:58:55] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 33 ms returned sat
[2023-03-12 20:58:58] [INFO ] After 2931ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-12 20:58:58] [INFO ] State equation strengthened by 7209 read => feed constraints.
[2023-03-12 20:59:00] [INFO ] After 1623ms SMT Verify possible using 7209 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 20:59:00] [INFO ] After 5527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 20:59:01] [INFO ] [Nat]Absence check using 61 positive place invariants in 74 ms returned sat
[2023-03-12 20:59:01] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 33 ms returned sat
[2023-03-12 20:59:04] [INFO ] After 3164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 20:59:05] [INFO ] After 1473ms SMT Verify possible using 7209 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 20:59:07] [INFO ] After 3179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1086 ms.
[2023-03-12 20:59:08] [INFO ] After 8280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 19 ms.
Support contains 1 out of 3869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3869/3869 places, 7356/7356 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 3861 transition count 7348
Applied a total of 16 rules in 1213 ms. Remains 3861 /3869 variables (removed 8) and now considering 7348/7356 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1213 ms. Remains : 3861/3869 places, 7348/7356 transitions.
Finished random walk after 735 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=56 )
FORMULA CANConstruction-PT-060-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 241 stabilizing places and 300 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(((p0 U (p1 U p0))||G(!X(X(p1))))) U p1))'
Support contains 3 out of 4456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4443 transition count 7922
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4443 transition count 7922
Applied a total of 26 rules in 1351 ms. Remains 4443 /4456 variables (removed 13) and now considering 7922/7948 (removed 26) transitions.
// Phase 1: matrix 7922 rows 4443 cols
[2023-03-12 20:59:11] [INFO ] Computed 121 place invariants in 72 ms
[2023-03-12 20:59:14] [INFO ] Implicit Places using invariants in 3058 ms returned []
[2023-03-12 20:59:14] [INFO ] Invariant cache hit.
[2023-03-12 20:59:17] [INFO ] Implicit Places using invariants and state equation in 2792 ms returned []
Implicit Place search using SMT with State Equation took 5854 ms to find 0 implicit places.
[2023-03-12 20:59:17] [INFO ] Invariant cache hit.
[2023-03-12 20:59:21] [INFO ] Dead Transitions using invariants and state equation in 4099 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4443/4456 places, 7922/7948 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11313 ms. Remains : 4443/4456 places, 7922/7948 transitions.
Stuttering acceptance computed with spot in 322 ms :[p1, true, (AND p1 p0), p0, (NOT p1), false, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s34 1) (GEQ s95 1)), p0:(GEQ s3635 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2102 ms.
Product exploration explored 100000 steps with 33333 reset in 1998 ms.
Computed a total of 241 stabilizing places and 300 stable transitions
Computed a total of 241 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 12 factoid took 289 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-060-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-060-LTLFireability-01 finished in 16151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 4456 transition count 7529
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 4037 transition count 7529
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 852 place count 4023 transition count 7501
Iterating global reduction 2 with 14 rules applied. Total rules applied 866 place count 4023 transition count 7501
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 986 place count 3963 transition count 7441
Applied a total of 986 rules in 1829 ms. Remains 3963 /4456 variables (removed 493) and now considering 7441/7948 (removed 507) transitions.
// Phase 1: matrix 7441 rows 3963 cols
[2023-03-12 20:59:28] [INFO ] Computed 121 place invariants in 42 ms
[2023-03-12 20:59:31] [INFO ] Implicit Places using invariants in 2700 ms returned []
[2023-03-12 20:59:31] [INFO ] Invariant cache hit.
[2023-03-12 20:59:32] [INFO ] State equation strengthened by 7200 read => feed constraints.
[2023-03-12 20:59:32] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 4513 ms to find 0 implicit places.
[2023-03-12 20:59:33] [INFO ] Redundant transitions in 1048 ms returned []
[2023-03-12 20:59:34] [INFO ] Invariant cache hit.
[2023-03-12 20:59:38] [INFO ] Dead Transitions using invariants and state equation in 4018 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/4456 places, 7441/7948 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11434 ms. Remains : 3963/4456 places, 7441/7948 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s148 1) (GEQ s2807 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]]
Stuttering criterion allowed to conclude after 460 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-060-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-02 finished in 11498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p1))||p0) U p2))'
Support contains 5 out of 4456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 4445 transition count 7926
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 4445 transition count 7926
Applied a total of 22 rules in 1190 ms. Remains 4445 /4456 variables (removed 11) and now considering 7926/7948 (removed 22) transitions.
// Phase 1: matrix 7926 rows 4445 cols
[2023-03-12 20:59:39] [INFO ] Computed 121 place invariants in 45 ms
[2023-03-12 20:59:42] [INFO ] Implicit Places using invariants in 2790 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278, 292, 306, 320, 334, 348, 362, 376, 390, 404, 418, 432, 446, 460, 474, 488, 502, 516, 530, 544, 558, 572, 586, 600, 614, 628, 642, 656, 670, 684, 698, 712, 726, 740, 754, 768, 782, 796, 810, 824, 838]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2810 ms to find 60 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4385/4456 places, 7926/7948 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 4325 transition count 7866
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 4325 transition count 7866
Applied a total of 120 rules in 1136 ms. Remains 4325 /4385 variables (removed 60) and now considering 7866/7926 (removed 60) transitions.
// Phase 1: matrix 7866 rows 4325 cols
[2023-03-12 20:59:43] [INFO ] Computed 61 place invariants in 104 ms
[2023-03-12 20:59:45] [INFO ] Implicit Places using invariants in 2761 ms returned []
[2023-03-12 20:59:46] [INFO ] Invariant cache hit.
[2023-03-12 20:59:50] [INFO ] Implicit Places using invariants and state equation in 4692 ms returned []
Implicit Place search using SMT with State Equation took 7455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4325/4456 places, 7866/7948 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12594 ms. Remains : 4325/4456 places, 7866/7948 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s875 1) (GEQ s1795 1)), p0:(OR (GEQ s1873 1) (AND (GEQ s527 1) (GEQ s558 1))), p1:(GEQ s875 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 CANConstruction-PT-060-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-03 finished in 12713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 4456 transition count 7532
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 4040 transition count 7532
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 832 place count 4040 transition count 7530
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 836 place count 4038 transition count 7530
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 850 place count 4024 transition count 7502
Iterating global reduction 2 with 14 rules applied. Total rules applied 864 place count 4024 transition count 7502
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 980 place count 3966 transition count 7444
Applied a total of 980 rules in 1774 ms. Remains 3966 /4456 variables (removed 490) and now considering 7444/7948 (removed 504) transitions.
// Phase 1: matrix 7444 rows 3966 cols
[2023-03-12 20:59:52] [INFO ] Computed 121 place invariants in 42 ms
[2023-03-12 20:59:55] [INFO ] Implicit Places using invariants in 2721 ms returned [6, 12, 18, 25, 31, 37, 43, 49, 55, 61, 67, 73, 79, 85, 91, 97, 103, 109, 115, 121, 127, 133, 139, 145, 151, 157, 163, 169, 176, 182, 188, 194, 200, 206, 212, 218, 224, 230, 236, 242, 248, 254, 260, 266, 272, 279, 285, 291, 297, 303, 309, 315, 321, 327, 333, 339, 345, 351, 357, 363]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2728 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3906/4456 places, 7444/7948 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 3906 transition count 7326
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 3788 transition count 7326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 238 place count 3786 transition count 7324
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 3786 transition count 7324
Applied a total of 240 rules in 1027 ms. Remains 3786 /3906 variables (removed 120) and now considering 7324/7444 (removed 120) transitions.
// Phase 1: matrix 7324 rows 3786 cols
[2023-03-12 20:59:56] [INFO ] Computed 61 place invariants in 99 ms
[2023-03-12 20:59:58] [INFO ] Implicit Places using invariants in 2469 ms returned []
[2023-03-12 20:59:58] [INFO ] Invariant cache hit.
[2023-03-12 21:00:03] [INFO ] Implicit Places using invariants and state equation in 4313 ms returned []
Implicit Place search using SMT with State Equation took 6785 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3786/4456 places, 7324/7948 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12317 ms. Remains : 3786/4456 places, 7324/7948 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s15 1)), p1:(OR (LT s90 1) (LT s143 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 235 reset in 1623 ms.
Stack based approach found an accepted trace after 1635 steps with 3 reset with depth 449 and stack size 447 in 28 ms.
FORMULA CANConstruction-PT-060-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-04 finished in 14045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((p1&&F(p2)))))))'
Support contains 4 out of 4456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4444 transition count 7924
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4444 transition count 7924
Applied a total of 24 rules in 1381 ms. Remains 4444 /4456 variables (removed 12) and now considering 7924/7948 (removed 24) transitions.
// Phase 1: matrix 7924 rows 4444 cols
[2023-03-12 21:00:06] [INFO ] Computed 121 place invariants in 74 ms
[2023-03-12 21:00:08] [INFO ] Implicit Places using invariants in 2730 ms returned []
[2023-03-12 21:00:08] [INFO ] Invariant cache hit.
[2023-03-12 21:00:11] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 5227 ms to find 0 implicit places.
[2023-03-12 21:00:11] [INFO ] Invariant cache hit.
[2023-03-12 21:00:11] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4444/4456 places, 7924/7948 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7088 ms. Remains : 4444/4456 places, 7924/7948 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1348 1), p1:(OR (LT s39 1) (LT s132 1)), p2:(LT s2257 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 50000 reset in 2651 ms.
Product exploration explored 100000 steps with 50000 reset in 2783 ms.
Computed a total of 241 stabilizing places and 300 stable transitions
Computed a total of 241 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-060-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-060-LTLFireability-06 finished in 12844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 4456 transition count 7528
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 4036 transition count 7528
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 853 place count 4023 transition count 7502
Iterating global reduction 2 with 13 rules applied. Total rules applied 866 place count 4023 transition count 7502
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 986 place count 3963 transition count 7442
Applied a total of 986 rules in 1750 ms. Remains 3963 /4456 variables (removed 493) and now considering 7442/7948 (removed 506) transitions.
// Phase 1: matrix 7442 rows 3963 cols
[2023-03-12 21:00:19] [INFO ] Computed 121 place invariants in 42 ms
[2023-03-12 21:00:22] [INFO ] Implicit Places using invariants in 2697 ms returned []
[2023-03-12 21:00:22] [INFO ] Invariant cache hit.
[2023-03-12 21:00:23] [INFO ] State equation strengthened by 7200 read => feed constraints.
[2023-03-12 21:00:23] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
[2023-03-12 21:00:24] [INFO ] Redundant transitions in 851 ms returned []
[2023-03-12 21:00:24] [INFO ] Invariant cache hit.
[2023-03-12 21:00:28] [INFO ] Dead Transitions using invariants and state equation in 4133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/4456 places, 7442/7948 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11073 ms. Remains : 3963/4456 places, 7442/7948 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3673 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]]
Stuttering criterion allowed to conclude after 484 steps with 0 reset in 7 ms.
FORMULA CANConstruction-PT-060-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-07 finished in 11177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p1||(p2&&G(p3))))||p0)))'
Support contains 6 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 4456 transition count 7532
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 4040 transition count 7532
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 832 place count 4040 transition count 7530
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 836 place count 4038 transition count 7530
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 848 place count 4026 transition count 7506
Iterating global reduction 2 with 12 rules applied. Total rules applied 860 place count 4026 transition count 7506
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 976 place count 3968 transition count 7448
Applied a total of 976 rules in 1696 ms. Remains 3968 /4456 variables (removed 488) and now considering 7448/7948 (removed 500) transitions.
// Phase 1: matrix 7448 rows 3968 cols
[2023-03-12 21:00:30] [INFO ] Computed 121 place invariants in 34 ms
[2023-03-12 21:00:33] [INFO ] Implicit Places using invariants in 2606 ms returned []
[2023-03-12 21:00:33] [INFO ] Invariant cache hit.
[2023-03-12 21:00:34] [INFO ] State equation strengthened by 7198 read => feed constraints.
[2023-03-12 21:00:34] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 4225 ms to find 0 implicit places.
[2023-03-12 21:00:35] [INFO ] Redundant transitions in 598 ms returned []
[2023-03-12 21:00:35] [INFO ] Invariant cache hit.
[2023-03-12 21:00:39] [INFO ] Dead Transitions using invariants and state equation in 4117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3968/4456 places, 7448/7948 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10673 ms. Remains : 3968/4456 places, 7448/7948 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s35 1) (LT s156 1)), p1:(GEQ s1806 1), p2:(GEQ s1554 1), p3:(OR (LT s114 1) (LT s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2831 steps with 4 reset in 54 ms.
FORMULA CANConstruction-PT-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-08 finished in 10904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0||F(p1)))||F(p2))))'
Support contains 5 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 4456 transition count 7531
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 4039 transition count 7531
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 834 place count 4039 transition count 7530
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 836 place count 4038 transition count 7530
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 849 place count 4025 transition count 7504
Iterating global reduction 2 with 13 rules applied. Total rules applied 862 place count 4025 transition count 7504
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 980 place count 3966 transition count 7445
Applied a total of 980 rules in 1812 ms. Remains 3966 /4456 variables (removed 490) and now considering 7445/7948 (removed 503) transitions.
// Phase 1: matrix 7445 rows 3966 cols
[2023-03-12 21:00:41] [INFO ] Computed 121 place invariants in 54 ms
[2023-03-12 21:00:44] [INFO ] Implicit Places using invariants in 2637 ms returned [5, 11, 17, 24, 30, 36, 42, 48, 54, 60, 67, 73, 79, 85, 91, 97, 103, 109, 115, 121, 127, 133, 139, 145, 151, 157, 163, 169, 175, 181, 187, 193, 199, 205, 211, 217, 223, 229, 236, 242, 248, 254, 260, 266, 272, 278, 284, 290, 296, 302, 308, 314, 320, 326, 332, 338, 344, 350, 356, 362]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2650 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3906/4456 places, 7445/7948 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 3906 transition count 7329
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 3790 transition count 7329
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 234 place count 3788 transition count 7327
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 3788 transition count 7327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 240 place count 3786 transition count 7325
Applied a total of 240 rules in 1773 ms. Remains 3786 /3906 variables (removed 120) and now considering 7325/7445 (removed 120) transitions.
// Phase 1: matrix 7325 rows 3786 cols
[2023-03-12 21:00:46] [INFO ] Computed 61 place invariants in 133 ms
[2023-03-12 21:00:48] [INFO ] Implicit Places using invariants in 2669 ms returned []
[2023-03-12 21:00:48] [INFO ] Invariant cache hit.
[2023-03-12 21:00:49] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 21:00:50] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 4219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3786/4456 places, 7325/7948 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10455 ms. Remains : 3786/4456 places, 7325/7948 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s120 1) (GEQ s2288 1)), p1:(AND (GEQ s13 1) (GEQ s36 1)), p2:(GEQ s2404 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]]
Stuttering criterion allowed to conclude after 417 steps with 0 reset in 8 ms.
FORMULA CANConstruction-PT-060-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-09 finished in 10621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U !p1)&&(p0||(F(p2) U p3)))))'
Support contains 7 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 4456 transition count 7533
Reduce places removed 415 places and 0 transitions.
Iterating post reduction 1 with 415 rules applied. Total rules applied 830 place count 4041 transition count 7533
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 830 place count 4041 transition count 7531
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 834 place count 4039 transition count 7531
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 847 place count 4026 transition count 7505
Iterating global reduction 2 with 13 rules applied. Total rules applied 860 place count 4026 transition count 7505
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 976 place count 3968 transition count 7447
Applied a total of 976 rules in 1876 ms. Remains 3968 /4456 variables (removed 488) and now considering 7447/7948 (removed 501) transitions.
// Phase 1: matrix 7447 rows 3968 cols
[2023-03-12 21:00:52] [INFO ] Computed 121 place invariants in 82 ms
[2023-03-12 21:00:54] [INFO ] Implicit Places using invariants in 2703 ms returned []
[2023-03-12 21:00:54] [INFO ] Invariant cache hit.
[2023-03-12 21:00:56] [INFO ] State equation strengthened by 7198 read => feed constraints.
[2023-03-12 21:00:56] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 4333 ms to find 0 implicit places.
[2023-03-12 21:00:57] [INFO ] Redundant transitions in 588 ms returned []
[2023-03-12 21:00:57] [INFO ] Invariant cache hit.
[2023-03-12 21:01:01] [INFO ] Dead Transitions using invariants and state equation in 3823 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3968/4456 places, 7447/7948 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10642 ms. Remains : 3968/4456 places, 7447/7948 transitions.
Stuttering acceptance computed with spot in 387 ms :[(OR p1 (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), p1, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s2421 1), p3:(AND (GEQ s29 1) (GEQ s128 1)), p2:(AND (GEQ s36 1) (GEQ s255 1)), p1:(AND (GEQ s10 1) (GEQ s723 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33436 reset in 2628 ms.
Product exploration explored 100000 steps with 33346 reset in 2992 ms.
Computed a total of 180 stabilizing places and 181 stable transitions
Computed a total of 180 stabilizing places and 181 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1747 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 21:01:09] [INFO ] Invariant cache hit.
[2023-03-12 21:01:11] [INFO ] [Real]Absence check using 61 positive place invariants in 74 ms returned sat
[2023-03-12 21:01:11] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 50 ms returned sat
[2023-03-12 21:01:11] [INFO ] After 1133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 21:01:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 80 ms returned sat
[2023-03-12 21:01:12] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 49 ms returned sat
[2023-03-12 21:01:17] [INFO ] After 4471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 21:01:17] [INFO ] State equation strengthened by 7198 read => feed constraints.
[2023-03-12 21:01:21] [INFO ] After 4017ms SMT Verify possible using 7198 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 21:01:25] [INFO ] After 8671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 3244 ms.
[2023-03-12 21:01:29] [INFO ] After 17869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 80 steps, including 0 resets, run visited all 10 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 10 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 p0 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p3) (NOT p0) p1 (NOT p2))), (F (AND (NOT p3) p0 p1 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0 p1)), (F (AND p3 (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (AND p3 p1 (NOT p2))), (F (AND (NOT p3) p1)), (F (AND (NOT p3) p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 2163 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-12 21:01:31] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 7 out of 3968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3968/3968 places, 7447/7447 transitions.
Applied a total of 0 rules in 474 ms. Remains 3968 /3968 variables (removed 0) and now considering 7447/7447 (removed 0) transitions.
[2023-03-12 21:01:47] [INFO ] Invariant cache hit.
[2023-03-12 21:01:50] [INFO ] Implicit Places using invariants in 2757 ms returned [5, 12, 18, 24, 31, 38, 44, 50, 56, 62, 68, 74, 80, 86, 92, 98, 104, 110, 116, 122, 129, 135, 141, 147, 153, 159, 165, 171, 177, 183, 189, 195, 201, 207, 213, 219, 225, 231, 237, 243, 249, 256, 262, 268, 274, 280, 286, 292, 298, 304, 310, 316, 322, 328, 334, 340, 346, 352, 358, 364]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2763 ms to find 60 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3908/3968 places, 7447/7447 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3905 transition count 7444
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3905 transition count 7444
Applied a total of 6 rules in 932 ms. Remains 3905 /3908 variables (removed 3) and now considering 7444/7447 (removed 3) transitions.
// Phase 1: matrix 7444 rows 3905 cols
[2023-03-12 21:01:51] [INFO ] Computed 61 place invariants in 53 ms
[2023-03-12 21:01:53] [INFO ] Implicit Places using invariants in 2574 ms returned []
[2023-03-12 21:01:53] [INFO ] Invariant cache hit.
[2023-03-12 21:01:57] [INFO ] Implicit Places using invariants and state equation in 3699 ms returned []
Implicit Place search using SMT with State Equation took 6277 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3905/3968 places, 7444/7447 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10447 ms. Remains : 3905/3968 places, 7444/7447 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 822 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 21:01:59] [INFO ] Invariant cache hit.
[2023-03-12 21:02:00] [INFO ] [Real]Absence check using 61 positive place invariants in 67 ms returned sat
[2023-03-12 21:02:00] [INFO ] After 1080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 21:02:01] [INFO ] [Nat]Absence check using 61 positive place invariants in 62 ms returned sat
[2023-03-12 21:02:05] [INFO ] After 4180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 21:02:05] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 21:02:08] [INFO ] After 3039ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 21:02:12] [INFO ] After 6542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2746 ms.
[2023-03-12 21:02:14] [INFO ] After 14662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 7 different solutions.
Finished Parikh walk after 126 steps, including 1 resets, run visited all 10 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 10 properties in 13 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p0) (NOT p2))), (X (NOT (AND p3 p1 (NOT p2)))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND p1 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (AND p1 (NOT p0) (NOT p3))), (F (AND p1 p0 (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) p3)), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) p3)), (F (AND p1 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1259 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-12 21:02:16] [INFO ] Invariant cache hit.
[2023-03-12 21:02:31] [INFO ] [Real]Absence check using 61 positive place invariants in 484 ms returned sat
[2023-03-12 21:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 21:02:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p3))
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 33407 reset in 2540 ms.
Product exploration explored 100000 steps with 33252 reset in 2258 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p2) p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 3905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3905/3905 places, 7444/7444 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 3905 transition count 7444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 117 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 3905 transition count 7444
Deduced a syphon composed of 117 places in 2 ms
Applied a total of 117 rules in 1393 ms. Remains 3905 /3905 variables (removed 0) and now considering 7444/7444 (removed 0) transitions.
[2023-03-12 21:02:39] [INFO ] Redundant transitions in 592 ms returned []
// Phase 1: matrix 7444 rows 3905 cols
[2023-03-12 21:02:39] [INFO ] Computed 61 place invariants in 111 ms
[2023-03-12 21:02:43] [INFO ] Dead Transitions using invariants and state equation in 3948 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3905/3905 places, 7444/7444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5954 ms. Remains : 3905/3905 places, 7444/7444 transitions.
Support contains 7 out of 3905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3905/3905 places, 7444/7444 transitions.
Applied a total of 0 rules in 375 ms. Remains 3905 /3905 variables (removed 0) and now considering 7444/7444 (removed 0) transitions.
// Phase 1: matrix 7444 rows 3905 cols
[2023-03-12 21:02:44] [INFO ] Computed 61 place invariants in 99 ms
[2023-03-12 21:02:46] [INFO ] Implicit Places using invariants in 2680 ms returned []
[2023-03-12 21:02:46] [INFO ] Invariant cache hit.
[2023-03-12 21:02:52] [INFO ] Implicit Places using invariants and state equation in 5849 ms returned []
Implicit Place search using SMT with State Equation took 8535 ms to find 0 implicit places.
[2023-03-12 21:02:52] [INFO ] Invariant cache hit.
[2023-03-12 21:02:56] [INFO ] Dead Transitions using invariants and state equation in 3859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12771 ms. Remains : 3905/3905 places, 7444/7444 transitions.
Treatment of property CANConstruction-PT-060-LTLFireability-10 finished in 126356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 4456 transition count 7530
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 4038 transition count 7530
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 4038 transition count 7529
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 4037 transition count 7529
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 852 place count 4023 transition count 7501
Iterating global reduction 2 with 14 rules applied. Total rules applied 866 place count 4023 transition count 7501
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 984 place count 3964 transition count 7442
Applied a total of 984 rules in 1589 ms. Remains 3964 /4456 variables (removed 492) and now considering 7442/7948 (removed 506) transitions.
// Phase 1: matrix 7442 rows 3964 cols
[2023-03-12 21:02:58] [INFO ] Computed 121 place invariants in 72 ms
[2023-03-12 21:03:01] [INFO ] Implicit Places using invariants in 2777 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 108, 114, 120, 126, 132, 138, 144, 150, 156, 163, 169, 175, 181, 187, 193, 199, 205, 211, 217, 223, 229, 235, 241, 247, 253, 259, 265, 271, 277, 283, 289, 295, 301, 307, 313, 319, 325, 331, 337, 343, 349, 355, 361]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2784 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3904/4456 places, 7442/7948 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 3904 transition count 7323
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 3785 transition count 7323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 239 place count 3784 transition count 7322
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 3784 transition count 7322
Applied a total of 240 rules in 843 ms. Remains 3784 /3904 variables (removed 120) and now considering 7322/7442 (removed 120) transitions.
// Phase 1: matrix 7322 rows 3784 cols
[2023-03-12 21:03:02] [INFO ] Computed 61 place invariants in 135 ms
[2023-03-12 21:03:04] [INFO ] Implicit Places using invariants in 2541 ms returned []
[2023-03-12 21:03:04] [INFO ] Invariant cache hit.
[2023-03-12 21:03:05] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 21:03:06] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 4027 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3784/4456 places, 7322/7948 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9243 ms. Remains : 3784/4456 places, 7322/7948 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s55 1) (LT s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 236 reset in 1213 ms.
Stack based approach found an accepted trace after 9546 steps with 22 reset with depth 365 and stack size 365 in 130 ms.
FORMULA CANConstruction-PT-060-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-060-LTLFireability-13 finished in 10712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||F(((p3 U (p4||G(p3)))&&p2)))))'
Support contains 6 out of 4456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4456/4456 places, 7948/7948 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 4456 transition count 7531
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 4039 transition count 7531
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 834 place count 4039 transition count 7530
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 836 place count 4038 transition count 7530
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 848 place count 4026 transition count 7506
Iterating global reduction 2 with 12 rules applied. Total rules applied 860 place count 4026 transition count 7506
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 3 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 978 place count 3967 transition count 7447
Applied a total of 978 rules in 1689 ms. Remains 3967 /4456 variables (removed 489) and now considering 7447/7948 (removed 501) transitions.
// Phase 1: matrix 7447 rows 3967 cols
[2023-03-12 21:03:09] [INFO ] Computed 121 place invariants in 53 ms
[2023-03-12 21:03:13] [INFO ] Implicit Places using invariants in 4325 ms returned []
[2023-03-12 21:03:13] [INFO ] Invariant cache hit.
[2023-03-12 21:03:14] [INFO ] State equation strengthened by 7199 read => feed constraints.
[2023-03-12 21:03:15] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 6102 ms to find 0 implicit places.
[2023-03-12 21:03:15] [INFO ] Redundant transitions in 566 ms returned []
[2023-03-12 21:03:15] [INFO ] Invariant cache hit.
[2023-03-12 21:03:19] [INFO ] Dead Transitions using invariants and state equation in 4056 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3967/4456 places, 7447/7948 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12437 ms. Remains : 3967/4456 places, 7447/7948 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : CANConstruction-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p4) p3), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s2250 1), p0:(AND (GEQ s179 1) (GEQ s251 1)), p2:(AND (OR (LT s282 1) (LT s3895 1)) (LT s2155 1)), p4:(AND (GEQ s282 1) (GEQ s3895 1) (LT s2155 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 191 reset in 1475 ms.
Product exploration explored 100000 steps with 188 reset in 1396 ms.
Computed a total of 181 stabilizing places and 181 stable transitions
Computed a total of 181 stabilizing places and 181 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3))), (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3))))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))))), (X (AND p2 (NOT p4) p3)), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p4) p3))), (X (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3)))))), (X (X (AND p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1498 ms. Reduced automaton from 5 states, 16 edges and 5 AP (stutter insensitive) to 5 states, 16 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 21:03:25] [INFO ] Invariant cache hit.
[2023-03-12 21:03:26] [INFO ] [Real]Absence check using 61 positive place invariants in 93 ms returned sat
[2023-03-12 21:03:26] [INFO ] [Real]Absence check using 61 positive and 60 generalized place invariants in 43 ms returned sat
[2023-03-12 21:03:29] [INFO ] After 3071ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 21:03:29] [INFO ] State equation strengthened by 7199 read => feed constraints.
[2023-03-12 21:03:30] [INFO ] After 483ms SMT Verify possible using 7199 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 21:03:30] [INFO ] After 4741ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 21:03:30] [INFO ] [Nat]Absence check using 61 positive place invariants in 120 ms returned sat
[2023-03-12 21:03:30] [INFO ] [Nat]Absence check using 61 positive and 60 generalized place invariants in 44 ms returned sat
[2023-03-12 21:03:33] [INFO ] After 2732ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 21:03:34] [INFO ] After 794ms SMT Verify possible using 7199 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 21:03:34] [INFO ] After 1225ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-12 21:03:35] [INFO ] After 5024ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3))), (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3))))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3))))), (X (AND p2 (NOT p4) p3)), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3)), (X (X (NOT (AND (NOT p1) p0 p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p4) p3))), (X (X (NOT (OR (NOT p2) (AND (NOT p4) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) p3)))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p4) (NOT p3)))))), (X (X (AND p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0) p2 (NOT p4) p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p4) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p3) p0 (NOT p4))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4))), (F (NOT (AND p3 (NOT p4)))), (F (NOT (AND p3 (NOT p4) p2))), (F (OR (AND (NOT p3) (NOT p4)) (NOT p2))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) p3 p0 (NOT p4) p2)), (F (OR (AND (NOT p1) (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) p3 (NOT p0) (NOT p4) p2))), (F (OR (AND (NOT p1) (NOT p3) p0 (NOT p4)) (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) p3 p0 (NOT p4))), (F (NOT (AND (NOT p1) p3 (NOT p0) (NOT p4))))]
Knowledge based reduction with 22 factoid took 1472 ms. Reduced automaton from 5 states, 16 edges and 5 AP (stutter insensitive) to 5 states, 15 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Support contains 6 out of 3967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3967/3967 places, 7447/7447 transitions.
Applied a total of 0 rules in 618 ms. Remains 3967 /3967 variables (removed 0) and now considering 7447/7447 (removed 0) transitions.
[2023-03-12 21:03:37] [INFO ] Invariant cache hit.
[2023-03-12 21:03:40] [INFO ] Implicit Places using invariants in 2978 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 180, 186, 192, 198, 204, 210, 216, 222, 228, 234, 240, 246, 253, 259, 265, 271, 277, 284, 290, 296, 302, 308, 314, 320, 326, 332, 338, 344, 350, 356, 362]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2995 ms to find 60 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3907/3967 places, 7447/7447 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 3907 transition count 7333
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 3793 transition count 7333
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 3791 transition count 7331
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 3791 transition count 7331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 3787 transition count 7327
Applied a total of 240 rules in 1398 ms. Remains 3787 /3907 variables (removed 120) and now considering 7327/7447 (removed 120) transitions.
// Phase 1: matrix 7327 rows 3787 cols
[2023-03-12 21:03:42] [INFO ] Computed 61 place invariants in 130 ms
[2023-03-12 21:03:44] [INFO ] Implicit Places using invariants in 2794 ms returned []
[2023-03-12 21:03:45] [INFO ] Invariant cache hit.
[2023-03-12 21:03:50] [INFO ] Implicit Places using invariants and state equation in 5556 ms returned []
Implicit Place search using SMT with State Equation took 8355 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3787/3967 places, 7327/7447 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13367 ms. Remains : 3787/3967 places, 7327/7447 transitions.
Computed a total of 61 stabilizing places and 120 stable transitions
Computed a total of 61 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4))))), (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2)), (X (AND p3 (NOT p4))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2))), (X (AND p3 (NOT p4) p2)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2)))), (X (X (AND p3 (NOT p4) p2))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 941 ms. Reduced automaton from 5 states, 15 edges and 5 AP (stutter insensitive) to 5 states, 15 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Incomplete random walk after 10000 steps, including 24 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 21:03:52] [INFO ] Invariant cache hit.
[2023-03-12 21:03:53] [INFO ] [Real]Absence check using 61 positive place invariants in 70 ms returned sat
[2023-03-12 21:03:53] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 21:03:53] [INFO ] [Nat]Absence check using 61 positive place invariants in 84 ms returned sat
[2023-03-12 21:03:57] [INFO ] After 3253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 21:03:57] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2023-03-12 21:03:59] [INFO ] After 2199ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 21:04:01] [INFO ] After 4173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1356 ms.
[2023-03-12 21:04:02] [INFO ] After 9742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 4 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3 (NOT p4)), (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4))))), (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2)), (X (AND p3 (NOT p4))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2))), (X (AND p3 (NOT p4) p2)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (OR (AND (NOT p3) (NOT p4)) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4) p2))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4) p2)))), (X (X (AND p3 (NOT p4) p2))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4)))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p4)))), (F (AND (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F (NOT (AND p3 (NOT p4) p2))), (F (OR (AND (NOT p3) (NOT p4)) (NOT p2))), (F (AND (NOT p1) p0 p3 (NOT p4) p2)), (F (AND (NOT p1) p0 (NOT p2))), (F (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p0) p3 (NOT p4) p2))), (F (OR (AND (NOT p1) p0 p3 (NOT p2)) (AND (NOT p1) p0 p4 (NOT p2)))), (F (AND (NOT p1) p0 p3 (NOT p4))), (F (NOT (AND (NOT p1) (NOT p0) p3 (NOT p4))))]
Knowledge based reduction with 20 factoid took 1582 ms. Reduced automaton from 5 states, 15 edges and 5 AP (stutter insensitive) to 5 states, 15 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 241 reset in 1701 ms.
Product exploration explored 100000 steps with 243 reset in 1589 ms.
Support contains 6 out of 3787 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3787/3787 places, 7327/7327 transitions.
Applied a total of 0 rules in 563 ms. Remains 3787 /3787 variables (removed 0) and now considering 7327/7327 (removed 0) transitions.
[2023-03-12 21:04:09] [INFO ] Invariant cache hit.
[2023-03-12 21:04:13] [INFO ] Implicit Places using invariants in 4358 ms returned []
[2023-03-12 21:04:13] [INFO ] Invariant cache hit.
[2023-03-12 21:04:19] [INFO ] Implicit Places using invariants and state equation in 5891 ms returned []
Implicit Place search using SMT with State Equation took 10256 ms to find 0 implicit places.
[2023-03-12 21:04:20] [INFO ] Redundant transitions in 570 ms returned []
[2023-03-12 21:04:20] [INFO ] Invariant cache hit.
[2023-03-12 21:04:20] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11870 ms. Remains : 3787/3787 places, 7327/7327 transitions.
Treatment of property CANConstruction-PT-060-LTLFireability-15 finished in 73272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U !p1)&&(p0||(F(p2) U p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||F(((p3 U (p4||G(p3)))&&p2)))))'
[2023-03-12 21:04:21] [INFO ] Flatten gal took : 232 ms
[2023-03-12 21:04:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 21:04:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4456 places, 7948 transitions and 30536 arcs took 59 ms.
Total runtime 375039 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANConstruction-PT-060-LTLFireability-10
Could not compute solution for formula : CANConstruction-PT-060-LTLFireability-15

BK_STOP 1678655070412

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55abebd393f4]
1: pnml2lts-mc(+0xa2496) [0x55abebd39496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f9237a51140]
3: pnml2lts-mc(+0x405be5) [0x55abec09cbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55abebe023f9]
5: pnml2lts-mc(+0x164ac4) [0x55abebdfbac4]
6: pnml2lts-mc(+0x272e0a) [0x55abebf09e0a]
7: pnml2lts-mc(+0xb61f0) [0x55abebd4d1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f92378a44d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f92378a467a]
10: pnml2lts-mc(+0xa1581) [0x55abebd38581]
11: pnml2lts-mc(+0xa1910) [0x55abebd38910]
12: pnml2lts-mc(+0xa32a2) [0x55abebd3a2a2]
13: pnml2lts-mc(+0xa50f4) [0x55abebd3c0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55abec08a4b3]
15: pnml2lts-mc(+0x7c63d) [0x55abebd1363d]
16: pnml2lts-mc(+0x67d86) [0x55abebcfed86]
17: pnml2lts-mc(+0x60a8a) [0x55abebcf7a8a]
18: pnml2lts-mc(+0x5eb15) [0x55abebcf5b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f923788cd0a]
20: pnml2lts-mc(+0x6075e) [0x55abebcf775e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-060, 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 r041-tajo-167813695000660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-060.tgz
mv CANConstruction-PT-060 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;