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-167813694500292.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 BridgeAndVehicles-PT-V80P20N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 25K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 25 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 743K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 25 14:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 261K Feb 25 14:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Feb 25 14:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.5M Feb 25 14:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.1M 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 BridgeAndVehicles-PT-V80P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678622149146

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=BridgeAndVehicles-PT-V80P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:55:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 11:55:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:55:51] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2023-03-12 11:55:51] [INFO ] Transformed 228 places.
[2023-03-12 11:55:51] [INFO ] Transformed 8588 transitions.
[2023-03-12 11:55:51] [INFO ] Parsed PT model containing 228 places and 8588 transitions and 67470 arcs in 535 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 95 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 226 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8588
Applied a total of 2 rules in 108 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:55:53] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 11:55:53] [INFO ] Computed 5 place invariants in 41 ms
[2023-03-12 11:55:56] [INFO ] Dead Transitions using invariants and state equation in 3326 ms found 0 transitions.
[2023-03-12 11:55:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:55:56] [INFO ] Invariant cache hit.
[2023-03-12 11:55:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 11:55:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:55:56] [INFO ] Invariant cache hit.
[2023-03-12 11:55:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:55:57] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-12 11:55:57] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:55:57] [INFO ] Invariant cache hit.
[2023-03-12 11:55:59] [INFO ] Dead Transitions using invariants and state equation in 2948 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/228 places, 8588/8588 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6978 ms. Remains : 226/228 places, 8588/8588 transitions.
Support contains 226 out of 226 places after structural reductions.
[2023-03-12 11:56:02] [INFO ] Flatten gal took : 770 ms
[2023-03-12 11:56:05] [INFO ] Flatten gal took : 859 ms
[2023-03-12 11:56:09] [INFO ] Input system was already deterministic with 8588 transitions.
Incomplete random walk after 10001 steps, including 14 resets, run finished after 919 ms. (steps per millisecond=10 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 11:56:11] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:56:11] [INFO ] Invariant cache hit.
[2023-03-12 11:56:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 11:56:12] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:56:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 11:56:12] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:56:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:56:13] [INFO ] After 717ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:56:14] [INFO ] After 1849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 536 ms.
[2023-03-12 11:56:15] [INFO ] After 2935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 188 ms.
Support contains 11 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 223 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 221 transition count 8584
Applied a total of 9 rules in 3143 ms. Remains 221 /226 variables (removed 5) and now considering 8584/8588 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3145 ms. Remains : 221/226 places, 8584/8588 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63641 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63641 steps, saw 22318 distinct states, run finished after 3006 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 11:56:22] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2023-03-12 11:56:22] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 11:56:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 11:56:23] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:56:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 11:56:23] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:56:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:56:24] [INFO ] After 918ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:56:26] [INFO ] After 2832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1016 ms.
[2023-03-12 11:56:27] [INFO ] After 4388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 140 ms.
Support contains 11 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2585 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2585 ms. Remains : 221/221 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2505 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 11:56:33] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:56:33] [INFO ] Invariant cache hit.
[2023-03-12 11:56:33] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-03-12 11:56:33] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:56:33] [INFO ] Invariant cache hit.
[2023-03-12 11:56:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:56:37] [INFO ] Implicit Places using invariants and state equation in 4255 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4962 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 219/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 3053 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10522 ms. Remains : 219/221 places, 8584/8584 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 65823 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65823 steps, saw 23038 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 11:56:45] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 11:56:45] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 11:56:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 11:56:46] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:56:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 11:56:46] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:56:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:56:47] [INFO ] After 1041ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:56:48] [INFO ] After 2241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 796 ms.
[2023-03-12 11:56:49] [INFO ] After 3603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 119 ms.
Support contains 11 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 3006 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3006 ms. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 3064 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 11:56:55] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:56:55] [INFO ] Invariant cache hit.
[2023-03-12 11:56:56] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-12 11:56:56] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:56:56] [INFO ] Invariant cache hit.
[2023-03-12 11:56:58] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 2140 ms to find 0 implicit places.
[2023-03-12 11:56:59] [INFO ] Redundant transitions in 1308 ms returned []
[2023-03-12 11:56:59] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 11:56:59] [INFO ] Invariant cache hit.
[2023-03-12 11:57:02] [INFO ] Dead Transitions using invariants and state equation in 2821 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9361 ms. Remains : 219/219 places, 8584/8584 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 219 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 219 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 217 transition count 524
Applied a total of 8062 rules in 30 ms. Remains 217 /219 variables (removed 2) and now considering 524/8584 (removed 8060) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 524 rows 217 cols
[2023-03-12 11:57:02] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 11:57:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 11:57:02] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 11:57:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 11:57:03] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 11:57:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 11:57:03] [INFO ] After 88ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 11:57:03] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-12 11:57:03] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 169 stabilizing places and 324 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(F((F(p0)&&X(X((p1||X(G(p2)))))))))'
Support contains 216 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 89 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:57:04] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 11:57:04] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:57:07] [INFO ] Dead Transitions using invariants and state equation in 2709 ms found 0 transitions.
[2023-03-12 11:57:07] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:07] [INFO ] Invariant cache hit.
[2023-03-12 11:57:07] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-12 11:57:07] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:07] [INFO ] Invariant cache hit.
[2023-03-12 11:57:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:57:08] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-12 11:57:08] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:08] [INFO ] Invariant cache hit.
[2023-03-12 11:57:11] [INFO ] Dead Transitions using invariants and state equation in 2617 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6538 ms. Remains : 226/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s171 1), p1:(AND (OR (LT s84 1) (LT s86 1) (LT s94 1) (LT s168 1)) (OR (LT s84 1) (LT s86 1) (LT s133 1) (LT s168 1)) (OR (LT s84 1) (LT s86 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3692 ms.
Product exploration explored 100000 steps with 25000 reset in 3285 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 3332 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 11:57:23] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:23] [INFO ] Invariant cache hit.
[2023-03-12 11:57:30] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2023-03-12 11:57:30] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 831 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 216 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 98 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:57:32] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:32] [INFO ] Invariant cache hit.
[2023-03-12 11:57:34] [INFO ] Dead Transitions using invariants and state equation in 2766 ms found 0 transitions.
[2023-03-12 11:57:34] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:34] [INFO ] Invariant cache hit.
[2023-03-12 11:57:35] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-12 11:57:35] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:35] [INFO ] Invariant cache hit.
[2023-03-12 11:57:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:57:36] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2023-03-12 11:57:36] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:36] [INFO ] Invariant cache hit.
[2023-03-12 11:57:38] [INFO ] Dead Transitions using invariants and state equation in 2520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6782 ms. Remains : 226/226 places, 8588/8588 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 587 steps, including 0 resets, run visited all 5 properties in 69 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p2)), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 3473 ms.
Product exploration explored 100000 steps with 25000 reset in 3383 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 216 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 3705 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:57:51] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:51] [INFO ] Invariant cache hit.
[2023-03-12 11:57:54] [INFO ] Dead Transitions using invariants and state equation in 2556 ms found 0 transitions.
[2023-03-12 11:57:55] [INFO ] Redundant transitions in 941 ms returned []
[2023-03-12 11:57:55] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:55] [INFO ] Invariant cache hit.
[2023-03-12 11:57:57] [INFO ] Dead Transitions using invariants and state equation in 2582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9793 ms. Remains : 226/226 places, 8588/8588 transitions.
Support contains 216 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 37 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:57:57] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:57:57] [INFO ] Invariant cache hit.
[2023-03-12 11:58:00] [INFO ] Dead Transitions using invariants and state equation in 2469 ms found 0 transitions.
[2023-03-12 11:58:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:58:00] [INFO ] Invariant cache hit.
[2023-03-12 11:58:00] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-12 11:58:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:58:00] [INFO ] Invariant cache hit.
[2023-03-12 11:58:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:58:01] [INFO ] Implicit Places using invariants and state equation in 909 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 50 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3682 ms. Remains : 225/226 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-00 finished in 58916 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(!p1))) U ((!p1&&X((!p0||X(!p1))))||X(G((!p0||X(!p1)))))))'
Support contains 135 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 133 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:58:03] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 11:58:03] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 11:58:06] [INFO ] Dead Transitions using invariants and state equation in 2716 ms found 0 transitions.
[2023-03-12 11:58:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:06] [INFO ] Invariant cache hit.
[2023-03-12 11:58:06] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 11:58:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:06] [INFO ] Invariant cache hit.
[2023-03-12 11:58:07] [INFO ] Implicit Places using invariants and state equation in 803 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1169 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 39 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4064 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND p0 p1), (AND p0 p1), p1, true, (AND p0 p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s167 1) (GEQ s222 1)) (AND (GEQ s168 1) (GEQ s222 1))), p1:(OR (AND (GEQ s1 1) (GEQ s84 1) (GEQ s146 1) (GEQ s209 1)) (AND (GEQ s1 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 36320 steps with 18160 reset in 10003 ms.
Product exploration timeout after 35520 steps with 17760 reset in 10001 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-01 finished in 24769 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(X(F(p0))))'
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 117 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:58:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:28] [INFO ] Invariant cache hit.
[2023-03-12 11:58:30] [INFO ] Dead Transitions using invariants and state equation in 2602 ms found 0 transitions.
[2023-03-12 11:58:30] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:30] [INFO ] Invariant cache hit.
[2023-03-12 11:58:31] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-12 11:58:31] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:31] [INFO ] Invariant cache hit.
[2023-03-12 11:58:33] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2670 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 48 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5439 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s83 20) (LT s169 1)) (OR (LT s83 20) (LT s170 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3115 ms.
Product exploration explored 100000 steps with 33333 reset in 2973 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-02 finished in 11891 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 X(p1)))'
Support contains 84 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 53 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 11:58:39] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 11:58:40] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 11:58:42] [INFO ] Dead Transitions using invariants and state equation in 2392 ms found 0 transitions.
[2023-03-12 11:58:42] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:58:42] [INFO ] Invariant cache hit.
[2023-03-12 11:58:43] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-12 11:58:43] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 11:58:43] [INFO ] Invariant cache hit.
[2023-03-12 11:58:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 11:58:45] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 68 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6003 ms. Remains : 225/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s83 1) (LT s85 1) (LT s93 1) (LT s167 1)) (OR (LT s83 1) (LT s85 1) (LT s132 1) (LT s167 1)) (OR (LT s83 1) (LT s85 1) (LT s142 1) (LT s16...], 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 3599 ms.
Product exploration explored 100000 steps with 50000 reset in 3607 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-03 finished in 13710 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((X((!p1 U (!p2||G(!p1))))&&p0))))'
Support contains 215 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 104 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 11:58:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 11:58:53] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 11:58:56] [INFO ] Dead Transitions using invariants and state equation in 2619 ms found 0 transitions.
[2023-03-12 11:58:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:56] [INFO ] Invariant cache hit.
[2023-03-12 11:58:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 11:58:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 11:58:56] [INFO ] Invariant cache hit.
[2023-03-12 11:58:57] [INFO ] Implicit Places using invariants and state equation in 554 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 809 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 44 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3591 ms. Remains : 224/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s85 1) (LT s147 1) (LT s210 1)) (OR (LT s1 1) (LT s85 1) (LT s105 1) (LT s174 1)) (OR (LT s1 1) (LT s85 1) (LT s136 1) (LT s202 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 19370 steps with 5419 reset in 10006 ms.
Product exploration timeout after 19280 steps with 5368 reset in 10017 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 391 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2)]
Incomplete random walk after 10002 steps, including 14 resets, run finished after 4580 ms. (steps per millisecond=2 ) properties (out of 4) seen :2
Interrupted Best-First random walk after 5594 steps, including 3 resets, run timeout after 5002 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 5791 steps, including 3 resets, run timeout after 5002 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 2 properties.
[2023-03-12 11:59:33] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2023-03-12 11:59:33] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:00:00] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 12:00:00] [INFO ] After 2066ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 725 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 215 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 4624 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:00:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:00:06] [INFO ] Invariant cache hit.
[2023-03-12 12:00:10] [INFO ] Dead Transitions using invariants and state equation in 4684 ms found 0 transitions.
[2023-03-12 12:00:10] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:00:10] [INFO ] Invariant cache hit.
[2023-03-12 12:00:10] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-12 12:00:11] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:00:11] [INFO ] Invariant cache hit.
[2023-03-12 12:00:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:00:11] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2023-03-12 12:00:13] [INFO ] Redundant transitions in 1285 ms returned []
[2023-03-12 12:00:13] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:00:13] [INFO ] Invariant cache hit.
[2023-03-12 12:00:17] [INFO ] Dead Transitions using invariants and state equation in 4460 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16141 ms. Remains : 224/224 places, 8587/8587 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (OR (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 2157 ms. (steps per millisecond=4 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 3867 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:00:24] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:00:24] [INFO ] Invariant cache hit.
[2023-03-12 12:00:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:00:31] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (OR (NOT p1) (NOT p2)))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 48150 steps with 110 reset in 10001 ms.
Product exploration timeout after 51840 steps with 119 reset in 10107 ms.
Support contains 133 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 222 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 220 transition count 8584
Applied a total of 7 rules in 5808 ms. Remains 220 /224 variables (removed 4) and now considering 8584/8587 (removed 3) transitions.
[2023-03-12 12:00:57] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 220 cols
[2023-03-12 12:00:57] [INFO ] Computed 4 place invariants in 11 ms
[2023-03-12 12:00:58] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-12 12:00:58] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:00:58] [INFO ] Invariant cache hit.
[2023-03-12 12:00:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:01:00] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2800 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/224 places, 8584/8587 transitions.
Applied a total of 0 rules in 5058 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13677 ms. Remains : 219/224 places, 8584/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-04 finished in 134500 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||X(p1))))||G(!p1)))'
Support contains 83 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 62 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:01:08] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:01:08] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-12 12:01:10] [INFO ] Dead Transitions using invariants and state equation in 2672 ms found 0 transitions.
[2023-03-12 12:01:10] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:01:10] [INFO ] Invariant cache hit.
[2023-03-12 12:01:11] [INFO ] Implicit Places using invariants in 920 ms returned []
[2023-03-12 12:01:11] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:01:11] [INFO ] Invariant cache hit.
[2023-03-12 12:01:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:01:15] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4300 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 78 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7117 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 103 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s161 1) (LT s172 1)) (OR (LT s142 1) (LT s172 1)) (OR (LT s103 1) (LT s172 1)) (OR (LT s122 1) (LT s172 1)) (OR (LT s141 1) (LT s172 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 153 reset in 3041 ms.
Product exploration explored 100000 steps with 153 reset in 2960 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 653 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 258 steps, including 0 resets, run visited all 6 properties in 17 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 15 factoid took 706 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 83 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 8587
Applied a total of 2 rules in 3190 ms. Remains 223 /224 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:01:26] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 12:01:26] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-12 12:01:28] [INFO ] Dead Transitions using invariants and state equation in 2387 ms found 0 transitions.
[2023-03-12 12:01:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:28] [INFO ] Invariant cache hit.
[2023-03-12 12:01:29] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-12 12:01:29] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:29] [INFO ] Invariant cache hit.
[2023-03-12 12:01:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:01:32] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
[2023-03-12 12:01:33] [INFO ] Redundant transitions in 1333 ms returned []
[2023-03-12 12:01:33] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:33] [INFO ] Invariant cache hit.
[2023-03-12 12:01:35] [INFO ] Dead Transitions using invariants and state equation in 2363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/224 places, 8587/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12729 ms. Remains : 223/224 places, 8587/8588 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 453 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 423 steps, including 0 resets, run visited all 6 properties in 33 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 15 factoid took 563 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 175 reset in 2889 ms.
Product exploration explored 100000 steps with 175 reset in 2902 ms.
Support contains 83 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2998 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:01:46] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:46] [INFO ] Invariant cache hit.
[2023-03-12 12:01:49] [INFO ] Dead Transitions using invariants and state equation in 2554 ms found 0 transitions.
[2023-03-12 12:01:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:49] [INFO ] Invariant cache hit.
[2023-03-12 12:01:49] [INFO ] Implicit Places using invariants in 927 ms returned []
[2023-03-12 12:01:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:49] [INFO ] Invariant cache hit.
[2023-03-12 12:01:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:01:53] [INFO ] Implicit Places using invariants and state equation in 3980 ms returned []
Implicit Place search using SMT with State Equation took 4914 ms to find 0 implicit places.
[2023-03-12 12:01:55] [INFO ] Redundant transitions in 1413 ms returned []
[2023-03-12 12:01:55] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:01:55] [INFO ] Invariant cache hit.
[2023-03-12 12:01:57] [INFO ] Dead Transitions using invariants and state equation in 2462 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14403 ms. Remains : 223/223 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-05 finished in 51338 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(X(F((p0||G(p1))))))'
Support contains 83 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 49 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:01:59] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:01:59] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:02:02] [INFO ] Dead Transitions using invariants and state equation in 2566 ms found 0 transitions.
[2023-03-12 12:02:02] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:02] [INFO ] Invariant cache hit.
[2023-03-12 12:02:02] [INFO ] Implicit Places using invariants in 825 ms returned []
[2023-03-12 12:02:02] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:02] [INFO ] Invariant cache hit.
[2023-03-12 12:02:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:02:06] [INFO ] Implicit Places using invariants and state equation in 4000 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4837 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 54 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7515 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LT s82 1), p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s80 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 363 reset in 2220 ms.
Product exploration explored 100000 steps with 366 reset in 2123 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 262 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 83 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Applied a total of 0 rules in 61 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:02:12] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 224 cols
[2023-03-12 12:02:12] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:02:15] [INFO ] Dead Transitions using invariants and state equation in 2711 ms found 0 transitions.
[2023-03-12 12:02:15] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:15] [INFO ] Invariant cache hit.
[2023-03-12 12:02:16] [INFO ] Implicit Places using invariants in 945 ms returned []
[2023-03-12 12:02:16] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:16] [INFO ] Invariant cache hit.
[2023-03-12 12:02:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:02:19] [INFO ] Implicit Places using invariants and state equation in 2906 ms returned []
Implicit Place search using SMT with State Equation took 3875 ms to find 0 implicit places.
[2023-03-12 12:02:19] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:19] [INFO ] Invariant cache hit.
[2023-03-12 12:02:21] [INFO ] Dead Transitions using invariants and state equation in 2627 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9291 ms. Remains : 224/224 places, 8588/8588 transitions.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 364 reset in 2328 ms.
Product exploration explored 100000 steps with 367 reset in 2292 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 83 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 24 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 8588
Deduced a syphon composed of 1 places in 29 ms
Applied a total of 1 rules in 2874 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:02:30] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 224 cols
[2023-03-12 12:02:30] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:02:33] [INFO ] Dead Transitions using invariants and state equation in 2538 ms found 0 transitions.
[2023-03-12 12:02:34] [INFO ] Redundant transitions in 1331 ms returned []
[2023-03-12 12:02:34] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:34] [INFO ] Invariant cache hit.
[2023-03-12 12:02:37] [INFO ] Dead Transitions using invariants and state equation in 2539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/224 places, 8588/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9308 ms. Remains : 224/224 places, 8588/8588 transitions.
Support contains 83 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 8588/8588 transitions.
Applied a total of 0 rules in 43 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:02:37] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 224 cols
[2023-03-12 12:02:37] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:02:39] [INFO ] Dead Transitions using invariants and state equation in 2304 ms found 0 transitions.
[2023-03-12 12:02:39] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:39] [INFO ] Invariant cache hit.
[2023-03-12 12:02:40] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-12 12:02:40] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:40] [INFO ] Invariant cache hit.
[2023-03-12 12:02:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:02:45] [INFO ] Implicit Places using invariants and state equation in 5475 ms returned []
Implicit Place search using SMT with State Equation took 6290 ms to find 0 implicit places.
[2023-03-12 12:02:45] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:45] [INFO ] Invariant cache hit.
[2023-03-12 12:02:48] [INFO ] Dead Transitions using invariants and state equation in 2527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11168 ms. Remains : 224/224 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-06 finished in 50218 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(p0)))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 130 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:02:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:02:49] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:02:52] [INFO ] Dead Transitions using invariants and state equation in 2460 ms found 0 transitions.
[2023-03-12 12:02:52] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:02:52] [INFO ] Invariant cache hit.
[2023-03-12 12:02:53] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-12 12:02:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:02:53] [INFO ] Invariant cache hit.
[2023-03-12 12:02:54] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2433 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 56 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5082 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1) (GEQ s160 1) (GEQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-08 finished in 5255 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(F((F(!p1)&&X(p2)&&p0))))'
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 57 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:02:55] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:02:55] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:02:57] [INFO ] Dead Transitions using invariants and state equation in 2433 ms found 0 transitions.
[2023-03-12 12:02:57] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:57] [INFO ] Invariant cache hit.
[2023-03-12 12:02:58] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2023-03-12 12:02:58] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:02:58] [INFO ] Invariant cache hit.
[2023-03-12 12:02:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:03:03] [INFO ] Implicit Places using invariants and state equation in 4727 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5804 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 120 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8416 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s35 1)), p1:(LT s169 1), p2:(AND (GEQ s0 1) (GEQ s35 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 978 steps with 2 reset in 24 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-10 finished in 8737 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((F(p0)||X(F(p1)))))'
Support contains 7 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 70 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:03:03] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:03:03] [INFO ] Invariant cache hit.
[2023-03-12 12:03:06] [INFO ] Dead Transitions using invariants and state equation in 2742 ms found 0 transitions.
[2023-03-12 12:03:06] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:03:06] [INFO ] Invariant cache hit.
[2023-03-12 12:03:07] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-12 12:03:07] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:03:07] [INFO ] Invariant cache hit.
[2023-03-12 12:03:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:03:12] [INFO ] Implicit Places using invariants and state equation in 5047 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5825 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 65 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8704 ms. Remains : 224/226 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1) (GEQ s123 1) (GEQ s195 1)), p1:(AND (OR (LT s143 1) (LT s172 1)) (LT s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3583 ms.
Product exploration explored 100000 steps with 33333 reset in 3874 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/224 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-11 finished in 16443 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((G(!p0)||(!p0&&G(F(!p1)))))))'
Support contains 8 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 223 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 221 transition count 8584
Applied a total of 9 rules in 4073 ms. Remains 221 /226 variables (removed 5) and now considering 8584/8588 (removed 4) transitions.
[2023-03-12 12:03:24] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2023-03-12 12:03:24] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:03:24] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-12 12:03:24] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:03:24] [INFO ] Invariant cache hit.
[2023-03-12 12:03:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:03:29] [INFO ] Implicit Places using invariants and state equation in 4185 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4885 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/226 places, 8584/8588 transitions.
Applied a total of 0 rules in 3696 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12661 ms. Remains : 219/226 places, 8584/8588 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s83 1) (GEQ s84 1) (GEQ s207 1)), p0:(AND (GEQ s1 1) (GEQ s82 1) (GEQ s94 1) (GEQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 205 reset in 3209 ms.
Product exploration explored 100000 steps with 205 reset in 2838 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[p0, (AND p0 p1), p0]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 66109 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66109 steps, saw 23132 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:03:43] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 12:03:43] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 12:03:44] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 12:03:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 12:03:44] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 12:03:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:03:45] [INFO ] After 672ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 12:03:45] [INFO ] After 1599ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-12 12:03:46] [INFO ] After 2194ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 8 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2991 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2992 ms. Remains : 219/219 places, 8584/8584 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73219 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73219 steps, saw 25640 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 12:03:53] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:03:53] [INFO ] Invariant cache hit.
[2023-03-12 12:03:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:03:53] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 12:03:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 12:03:53] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 12:03:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:03:54] [INFO ] After 680ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 12:03:55] [INFO ] After 1343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-12 12:03:55] [INFO ] After 2123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 8 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2895 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2895 ms. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2846 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 12:04:01] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:01] [INFO ] Invariant cache hit.
[2023-03-12 12:04:01] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-12 12:04:01] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:01] [INFO ] Invariant cache hit.
[2023-03-12 12:04:02] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2023-03-12 12:04:04] [INFO ] Redundant transitions in 1165 ms returned []
[2023-03-12 12:04:04] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:04] [INFO ] Invariant cache hit.
[2023-03-12 12:04:06] [INFO ] Dead Transitions using invariants and state equation in 2612 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8175 ms. Remains : 219/219 places, 8584/8584 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 219 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 219 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 217 transition count 524
Applied a total of 8062 rules in 31 ms. Remains 217 /219 variables (removed 2) and now considering 524/8584 (removed 8060) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 524 rows 217 cols
[2023-03-12 12:04:06] [INFO ] Computed 4 place invariants in 14 ms
[2023-03-12 12:04:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:04:06] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 12:04:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:04:07] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 12:04:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:04:07] [INFO ] After 79ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 12:04:07] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-12 12:04:07] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 235 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0, p0]
Stuttering acceptance computed with spot in 42 ms :[p0, p0]
Support contains 4 out of 219 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 3657 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 12:04:11] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 12:04:11] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 12:04:12] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-12 12:04:12] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:12] [INFO ] Invariant cache hit.
[2023-03-12 12:04:13] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2023-03-12 12:04:14] [INFO ] Redundant transitions in 1188 ms returned []
[2023-03-12 12:04:14] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:14] [INFO ] Invariant cache hit.
[2023-03-12 12:04:16] [INFO ] Dead Transitions using invariants and state equation in 2650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9174 ms. Remains : 219/219 places, 8584/8584 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77201 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77201 steps, saw 26942 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:04:20] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:20] [INFO ] Invariant cache hit.
[2023-03-12 12:04:20] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-12 12:04:20] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:04:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:04:21] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:04:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:04:21] [INFO ] After 167ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:04:21] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 12:04:21] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2685 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2685 ms. Remains : 219/219 places, 8584/8584 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81884 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81884 steps, saw 28483 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:04:27] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:27] [INFO ] Invariant cache hit.
[2023-03-12 12:04:27] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 12:04:28] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:04:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 12:04:28] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:04:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:04:28] [INFO ] After 121ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:04:28] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-12 12:04:28] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2363 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2363 ms. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2476 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 12:04:33] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:33] [INFO ] Invariant cache hit.
[2023-03-12 12:04:34] [INFO ] Implicit Places using invariants in 798 ms returned []
[2023-03-12 12:04:34] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:34] [INFO ] Invariant cache hit.
[2023-03-12 12:04:36] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
[2023-03-12 12:04:36] [INFO ] Redundant transitions in 789 ms returned []
[2023-03-12 12:04:36] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:36] [INFO ] Invariant cache hit.
[2023-03-12 12:04:39] [INFO ] Dead Transitions using invariants and state equation in 2409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8044 ms. Remains : 219/219 places, 8584/8584 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 219 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 219 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 217 transition count 524
Applied a total of 8062 rules in 19 ms. Remains 217 /219 variables (removed 2) and now considering 524/8584 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 524 rows 217 cols
[2023-03-12 12:04:39] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:04:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 12:04:39] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:04:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 12:04:39] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:04:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:04:39] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:04:39] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 12:04:39] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0, p0]
Stuttering acceptance computed with spot in 42 ms :[p0, p0]
Stuttering acceptance computed with spot in 45 ms :[p0, p0]
Product exploration explored 100000 steps with 205 reset in 2330 ms.
Product exploration explored 100000 steps with 205 reset in 2342 ms.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2831 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2023-03-12 12:04:47] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2023-03-12 12:04:47] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 12:04:48] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-12 12:04:48] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:48] [INFO ] Invariant cache hit.
[2023-03-12 12:04:50] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
[2023-03-12 12:04:51] [INFO ] Redundant transitions in 871 ms returned []
[2023-03-12 12:04:51] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:04:51] [INFO ] Invariant cache hit.
[2023-03-12 12:04:53] [INFO ] Dead Transitions using invariants and state equation in 2560 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8933 ms. Remains : 219/219 places, 8584/8584 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-12 finished in 94659 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(p0)&&(X(G(p2))||p1))))'
Support contains 7 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 101 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:04:54] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:04:54] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-12 12:04:57] [INFO ] Dead Transitions using invariants and state equation in 2763 ms found 0 transitions.
[2023-03-12 12:04:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:04:57] [INFO ] Invariant cache hit.
[2023-03-12 12:04:58] [INFO ] Implicit Places using invariants in 858 ms returned []
[2023-03-12 12:04:58] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:04:58] [INFO ] Invariant cache hit.
[2023-03-12 12:05:00] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2667 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 57 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5601 ms. Remains : 224/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s83 1) (GEQ s85 1) (GEQ s139 1) (GEQ s167 1)), p1:(OR (LT s105 1) (LT s172 1)), p2:(OR (LT s83 20) (LT s171 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 651 steps with 0 reset in 20 ms.
FORMULA BridgeAndVehicles-PT-V80P20N50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-13 finished in 5775 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(p0)))'
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 2513 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:05:03] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:05:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:05:05] [INFO ] Dead Transitions using invariants and state equation in 2641 ms found 0 transitions.
[2023-03-12 12:05:05] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:05] [INFO ] Invariant cache hit.
[2023-03-12 12:05:06] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-12 12:05:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:06] [INFO ] Invariant cache hit.
[2023-03-12 12:05:08] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2583 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 2446 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10203 ms. Remains : 223/226 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s168 1) (AND (GEQ s104 1) (GEQ s171 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2168 reset in 1918 ms.
Product exploration explored 100000 steps with 2184 reset in 1756 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:05:15] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 12:05:15] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:05:18] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:05:19] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2023-03-12 12:05:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:05:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:05:22] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2023-03-12 12:05:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:05:25] [INFO ] [Nat]Added 102 Read/Feed constraints in 2895 ms returned sat
[2023-03-12 12:05:26] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 490 ms.
[2023-03-12 12:05:27] [INFO ] Added : 49 causal constraints over 13 iterations in 1143 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2379 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:05:29] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:29] [INFO ] Invariant cache hit.
[2023-03-12 12:05:32] [INFO ] Dead Transitions using invariants and state equation in 2524 ms found 0 transitions.
[2023-03-12 12:05:32] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:32] [INFO ] Invariant cache hit.
[2023-03-12 12:05:32] [INFO ] Implicit Places using invariants in 942 ms returned []
[2023-03-12 12:05:32] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:32] [INFO ] Invariant cache hit.
[2023-03-12 12:05:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:05:37] [INFO ] Implicit Places using invariants and state equation in 4777 ms returned []
Implicit Place search using SMT with State Equation took 5725 ms to find 0 implicit places.
[2023-03-12 12:05:38] [INFO ] Redundant transitions in 890 ms returned []
[2023-03-12 12:05:38] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:38] [INFO ] Invariant cache hit.
[2023-03-12 12:05:41] [INFO ] Dead Transitions using invariants and state equation in 2560 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14097 ms. Remains : 223/223 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2023-03-12 12:05:41] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:41] [INFO ] Invariant cache hit.
[2023-03-12 12:05:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:05:45] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2023-03-12 12:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:05:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 12:05:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:05:49] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2023-03-12 12:05:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:05:51] [INFO ] [Nat]Added 102 Read/Feed constraints in 2646 ms returned sat
[2023-03-12 12:05:52] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 807 ms.
[2023-03-12 12:05:53] [INFO ] Added : 57 causal constraints over 12 iterations in 1566 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2182 reset in 1801 ms.
Product exploration explored 100000 steps with 2202 reset in 1712 ms.
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2351 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:05:59] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:05:59] [INFO ] Invariant cache hit.
[2023-03-12 12:06:02] [INFO ] Dead Transitions using invariants and state equation in 2622 ms found 0 transitions.
[2023-03-12 12:06:02] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:06:02] [INFO ] Invariant cache hit.
[2023-03-12 12:06:03] [INFO ] Implicit Places using invariants in 921 ms returned []
[2023-03-12 12:06:03] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:06:03] [INFO ] Invariant cache hit.
[2023-03-12 12:06:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:06:09] [INFO ] Implicit Places using invariants and state equation in 6224 ms returned []
Implicit Place search using SMT with State Equation took 7150 ms to find 0 implicit places.
[2023-03-12 12:06:10] [INFO ] Redundant transitions in 871 ms returned []
[2023-03-12 12:06:10] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:06:10] [INFO ] Invariant cache hit.
[2023-03-12 12:06:12] [INFO ] Dead Transitions using invariants and state equation in 2579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15610 ms. Remains : 223/223 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-15 finished in 73245 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(F((F(p0)&&X(X((p1||X(G(p2)))))))))'
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((X((!p1 U (!p2||G(!p1))))&&p0))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-04
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2)]
Support contains 215 out of 226 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 107 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:06:14] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:06:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 12:06:16] [INFO ] Dead Transitions using invariants and state equation in 2627 ms found 0 transitions.
[2023-03-12 12:06:16] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:06:16] [INFO ] Invariant cache hit.
[2023-03-12 12:06:17] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-12 12:06:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:06:17] [INFO ] Invariant cache hit.
[2023-03-12 12:06:17] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 686 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 224/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 61 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3483 ms. Remains : 224/226 places, 8587/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s85 1) (LT s147 1) (LT s210 1)) (OR (LT s1 1) (LT s85 1) (LT s105 1) (LT s174 1)) (OR (LT s1 1) (LT s85 1) (LT s136 1) (LT s202 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 19710 steps with 5514 reset in 10009 ms.
Product exploration timeout after 19500 steps with 5530 reset in 10003 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 4637 ms. (steps per millisecond=2 ) properties (out of 4) seen :2
Interrupted Best-First random walk after 5796 steps, including 3 resets, run timeout after 5004 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6248 steps, including 3 resets, run timeout after 5002 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 2 properties.
[2023-03-12 12:06:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2023-03-12 12:06:53] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 12:07:25] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-12 12:07:25] [INFO ] After 1787ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 959 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Support contains 215 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 3695 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:07:30] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:07:30] [INFO ] Invariant cache hit.
[2023-03-12 12:07:35] [INFO ] Dead Transitions using invariants and state equation in 4618 ms found 0 transitions.
[2023-03-12 12:07:35] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:07:35] [INFO ] Invariant cache hit.
[2023-03-12 12:07:35] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-12 12:07:35] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:07:35] [INFO ] Invariant cache hit.
[2023-03-12 12:07:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:07:36] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-12 12:07:37] [INFO ] Redundant transitions in 909 ms returned []
[2023-03-12 12:07:37] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:07:37] [INFO ] Invariant cache hit.
[2023-03-12 12:07:41] [INFO ] Dead Transitions using invariants and state equation in 4363 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14565 ms. Remains : 224/224 places, 8587/8587 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (OR (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 2167 ms. (steps per millisecond=4 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 3820 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:07:48] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:07:48] [INFO ] Invariant cache hit.
[2023-03-12 12:07:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 12:07:54] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p0), (X (OR (NOT p1) (NOT p2))), (X (X (OR (NOT p1) (NOT p2)))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 53450 steps with 130 reset in 10001 ms.
Product exploration timeout after 51170 steps with 130 reset in 10001 ms.
Support contains 133 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 31 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 222 transition count 8586
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 31 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 220 transition count 8584
Applied a total of 7 rules in 3644 ms. Remains 220 /224 variables (removed 4) and now considering 8584/8587 (removed 3) transitions.
[2023-03-12 12:08:18] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 220 cols
[2023-03-12 12:08:18] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 12:08:18] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-12 12:08:18] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:08:18] [INFO ] Invariant cache hit.
[2023-03-12 12:08:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:08:20] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2480 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 219/224 places, 8584/8587 transitions.
Applied a total of 0 rules in 3420 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9547 ms. Remains : 219/224 places, 8584/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-04 finished in 131505 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||X(p1))))||G(!p1)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-05
Stuttering acceptance computed with spot in 129 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 83 out of 226 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 44 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 163 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:08:25] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:08:25] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-12 12:08:28] [INFO ] Dead Transitions using invariants and state equation in 2371 ms found 0 transitions.
[2023-03-12 12:08:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:08:28] [INFO ] Invariant cache hit.
[2023-03-12 12:08:28] [INFO ] Implicit Places using invariants in 716 ms returned []
[2023-03-12 12:08:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:08:28] [INFO ] Invariant cache hit.
[2023-03-12 12:08:30] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1972 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 74 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4582 ms. Remains : 223/226 places, 8587/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s161 1) (LT s171 1)) (OR (LT s142 1) (LT s171 1)) (OR (LT s103 1) (LT s171 1)) (OR (LT s122 1) (LT s171 1)) (OR (LT s141 1) (LT s171 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 175 reset in 2693 ms.
Product exploration explored 100000 steps with 175 reset in 2878 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 706 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 269 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 15 factoid took 771 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 83 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 3058 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:08:40] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 12:08:40] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:08:43] [INFO ] Dead Transitions using invariants and state equation in 2616 ms found 0 transitions.
[2023-03-12 12:08:43] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:08:43] [INFO ] Invariant cache hit.
[2023-03-12 12:08:44] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-12 12:08:44] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:08:44] [INFO ] Invariant cache hit.
[2023-03-12 12:08:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:08:48] [INFO ] Implicit Places using invariants and state equation in 4089 ms returned []
Implicit Place search using SMT with State Equation took 4824 ms to find 0 implicit places.
[2023-03-12 12:08:49] [INFO ] Redundant transitions in 970 ms returned []
[2023-03-12 12:08:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:08:49] [INFO ] Invariant cache hit.
[2023-03-12 12:08:51] [INFO ] Dead Transitions using invariants and state equation in 2450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13974 ms. Remains : 223/223 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 396 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 270 steps, including 0 resets, run visited all 6 properties in 9 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 15 factoid took 629 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 175 reset in 3129 ms.
Product exploration explored 100000 steps with 175 reset in 2961 ms.
Support contains 83 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 3376 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:09:02] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:02] [INFO ] Invariant cache hit.
[2023-03-12 12:09:05] [INFO ] Dead Transitions using invariants and state equation in 2654 ms found 0 transitions.
[2023-03-12 12:09:05] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:05] [INFO ] Invariant cache hit.
[2023-03-12 12:09:06] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-12 12:09:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:06] [INFO ] Invariant cache hit.
[2023-03-12 12:09:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:09:09] [INFO ] Implicit Places using invariants and state equation in 2729 ms returned []
Implicit Place search using SMT with State Equation took 3509 ms to find 0 implicit places.
[2023-03-12 12:09:10] [INFO ] Redundant transitions in 996 ms returned []
[2023-03-12 12:09:10] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:10] [INFO ] Invariant cache hit.
[2023-03-12 12:09:12] [INFO ] Dead Transitions using invariants and state equation in 2605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13152 ms. Remains : 223/223 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-05 finished in 48957 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(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-06
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 83 out of 226 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 225 transition count 8587
Applied a total of 2 rules in 272 ms. Remains 225 /226 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:09:14] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:09:14] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:09:17] [INFO ] Dead Transitions using invariants and state equation in 2747 ms found 0 transitions.
[2023-03-12 12:09:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:17] [INFO ] Invariant cache hit.
[2023-03-12 12:09:18] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-12 12:09:18] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:18] [INFO ] Invariant cache hit.
[2023-03-12 12:09:19] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2135 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 223/226 places, 8587/8588 transitions.
Applied a total of 0 rules in 111 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5267 ms. Remains : 223/226 places, 8587/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LT s82 1), p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s80 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 379 reset in 2046 ms.
Product exploration explored 100000 steps with 380 reset in 1944 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 83 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 53 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:09:24] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2023-03-12 12:09:24] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:09:27] [INFO ] Dead Transitions using invariants and state equation in 2354 ms found 0 transitions.
[2023-03-12 12:09:27] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:27] [INFO ] Invariant cache hit.
[2023-03-12 12:09:28] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-12 12:09:28] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:28] [INFO ] Invariant cache hit.
[2023-03-12 12:09:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:09:31] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 3955 ms to find 0 implicit places.
[2023-03-12 12:09:31] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:31] [INFO ] Invariant cache hit.
[2023-03-12 12:09:33] [INFO ] Dead Transitions using invariants and state equation in 2691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9054 ms. Remains : 223/223 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 381 reset in 2259 ms.
Product exploration explored 100000 steps with 380 reset in 2313 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 83 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 3391 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:09:43] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:43] [INFO ] Invariant cache hit.
[2023-03-12 12:09:46] [INFO ] Dead Transitions using invariants and state equation in 2641 ms found 0 transitions.
[2023-03-12 12:09:47] [INFO ] Redundant transitions in 956 ms returned []
[2023-03-12 12:09:47] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:47] [INFO ] Invariant cache hit.
[2023-03-12 12:09:49] [INFO ] Dead Transitions using invariants and state equation in 2679 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9676 ms. Remains : 223/223 places, 8587/8587 transitions.
Support contains 83 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 44 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:09:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:49] [INFO ] Invariant cache hit.
[2023-03-12 12:09:52] [INFO ] Dead Transitions using invariants and state equation in 2648 ms found 0 transitions.
[2023-03-12 12:09:52] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:52] [INFO ] Invariant cache hit.
[2023-03-12 12:09:53] [INFO ] Implicit Places using invariants in 843 ms returned []
[2023-03-12 12:09:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:53] [INFO ] Invariant cache hit.
[2023-03-12 12:09:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:09:56] [INFO ] Implicit Places using invariants and state equation in 3462 ms returned []
Implicit Place search using SMT with State Equation took 4324 ms to find 0 implicit places.
[2023-03-12 12:09:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:09:56] [INFO ] Invariant cache hit.
[2023-03-12 12:09:59] [INFO ] Dead Transitions using invariants and state equation in 2468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9502 ms. Remains : 223/223 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P20N50-LTLFireability-06 finished in 46617 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((G(!p0)||(!p0&&G(F(!p1)))))))'
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(p0)))'
[2023-03-12 12:10:02] [INFO ] Flatten gal took : 774 ms
[2023-03-12 12:10:02] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 133 ms.
[2023-03-12 12:10:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 226 places, 8588 transitions and 67468 arcs took 68 ms.
Total runtime 851559 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393340 kB
MemFree: 11638576 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16058748 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLFireability-05
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLFireability-06
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLFireability-12
Could not compute solution for formula : BridgeAndVehicles-PT-V80P20N50-LTLFireability-15

BK_STOP 1678623611650

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 BridgeAndVehicles-PT-V80P20N50-LTLFireability-00
ltl formula formula --ltl=/tmp/3301/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 226 places, 8588 transitions and 67468 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.930 real 0.410 user 0.400 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_0_
Killing (15) : 3307 3308 3309 3310 3311
Killing (9) : 3307 3308 3309 3310 3311
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLFireability-04
ltl formula formula --ltl=/tmp/3301/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 226 places, 8588 transitions and 67468 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.920 real 0.350 user 0.390 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: stack overflow
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLFireability-05
ltl formula formula --ltl=/tmp/3301/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.880 real 0.410 user 0.390 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_2_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLFireability-06
ltl formula formula --ltl=/tmp/3301/ltl_3_
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 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.770 real 0.380 user 0.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLFireability-12
ltl formula formula --ltl=/tmp/3301/ltl_4_
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 226 places, 8588 transitions and 67468 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.620 real 0.380 user 0.340 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V80P20N50-LTLFireability-15
ltl formula formula --ltl=/tmp/3301/ltl_5_
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 226 places, 8588 transitions and 67468 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.700 real 0.420 user 0.370 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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) [0x558c8d90f3f4]
1: pnml2lts-mc(+0xa2496) [0x558c8d90f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5eb9bca140]
3: pnml2lts-mc(+0x405b30) [0x558c8dc72b30]
4: pnml2lts-mc(+0x16b3f9) [0x558c8d9d83f9]
5: pnml2lts-mc(+0x164ac4) [0x558c8d9d1ac4]
6: pnml2lts-mc(+0x272e0a) [0x558c8dadfe0a]
7: pnml2lts-mc(+0xb61f0) [0x558c8d9231f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f5eb9a1d4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f5eb9a1d67a]
10: pnml2lts-mc(+0xa1581) [0x558c8d90e581]
11: pnml2lts-mc(+0xa1910) [0x558c8d90e910]
12: pnml2lts-mc(+0xa32a2) [0x558c8d9102a2]
13: pnml2lts-mc(+0xa50f4) [0x558c8d9120f4]
14: pnml2lts-mc(+0xa516b) [0x558c8d91216b]
15: pnml2lts-mc(+0x3f34b3) [0x558c8dc604b3]
16: pnml2lts-mc(+0x7c63d) [0x558c8d8e963d]
17: pnml2lts-mc(+0x67d86) [0x558c8d8d4d86]
18: pnml2lts-mc(+0x60a8a) [0x558c8d8cda8a]
19: pnml2lts-mc(+0x5eb15) [0x558c8d8cbb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5eb9a05d0a]
21: pnml2lts-mc(+0x6075e) [0x558c8d8cd75e]

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="BridgeAndVehicles-PT-V80P20N50"
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 BridgeAndVehicles-PT-V80P20N50, 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-167813694500292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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