Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167500331.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 448K May 18 16:42 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 AutonomousCar-PT-08a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717217037364

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:43:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:43:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:43:59] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2024-06-01 04:43:59] [INFO ] Transformed 81 places.
[2024-06-01 04:43:59] [INFO ] Transformed 849 transitions.
[2024-06-01 04:43:59] [INFO ] Found NUPN structural information;
[2024-06-01 04:43:59] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 574/574 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 528
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 528
Applied a total of 12 rules in 58 ms. Remains 75 /81 variables (removed 6) and now considering 528/574 (removed 46) transitions.
// Phase 1: matrix 528 rows 75 cols
[2024-06-01 04:44:00] [INFO ] Computed 12 invariants in 39 ms
[2024-06-01 04:44:01] [INFO ] Implicit Places using invariants in 830 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 932 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/81 places, 528/574 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1038 ms. Remains : 74/81 places, 528/574 transitions.
Support contains 17 out of 74 places after structural reductions.
[2024-06-01 04:44:01] [INFO ] Flatten gal took : 205 ms
[2024-06-01 04:44:01] [INFO ] Flatten gal took : 112 ms
[2024-06-01 04:44:01] [INFO ] Input system was already deterministic with 528 transitions.
RANDOM walk for 40000 steps (2080 resets) in 3562 ms. (11 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (174 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
// Phase 1: matrix 528 rows 74 cols
[2024-06-01 04:44:02] [INFO ] Computed 11 invariants in 10 ms
[2024-06-01 04:44:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/74 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 527/601 variables, 74/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/602 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/602 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 04:44:03] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 57/74 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 04:44:03] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 3 ms to minimize.
[2024-06-01 04:44:04] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 527/601 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/602 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/602 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 221 ms.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 528/528 transitions.
Graph (complete) has 774 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 73 transition count 517
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 65 transition count 516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 64 transition count 516
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 64 transition count 515
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 63 transition count 515
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 26 place count 60 transition count 488
Iterating global reduction 3 with 3 rules applied. Total rules applied 29 place count 60 transition count 488
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 58 transition count 486
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 40 place count 58 transition count 479
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 103 place count 51 transition count 423
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 51 transition count 423
Applied a total of 104 rules in 218 ms. Remains 51 /74 variables (removed 23) and now considering 423/528 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 51/74 places, 423/528 transitions.
RANDOM walk for 40000 steps (30 resets) in 503 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 425127 steps, run visited all 1 properties in 899 ms. (steps per millisecond=472 )
Probabilistic random walk after 425127 steps, saw 58474 distinct states, run finished after 905 ms. (steps per millisecond=469 ) properties seen :1
Computed a total of 2 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 519
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 63 transition count 501
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 63 transition count 501
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 61 transition count 499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 60 transition count 499
Applied a total of 26 rules in 88 ms. Remains 60 /74 variables (removed 14) and now considering 499/528 (removed 29) transitions.
// Phase 1: matrix 499 rows 60 cols
[2024-06-01 04:44:06] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 04:44:06] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 04:44:06] [INFO ] Invariant cache hit.
[2024-06-01 04:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:44:06] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [56, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 651 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/74 places, 499/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 498
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 497
Applied a total of 4 rules in 81 ms. Remains 56 /58 variables (removed 2) and now considering 497/499 (removed 2) transitions.
// Phase 1: matrix 497 rows 56 cols
[2024-06-01 04:44:07] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:44:07] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 04:44:07] [INFO ] Invariant cache hit.
[2024-06-01 04:44:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:44:07] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/74 places, 497/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1403 ms. Remains : 56/74 places, 497/528 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-00
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 4 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-00 finished in 1682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 519
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 62 transition count 492
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 62 transition count 492
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 60 transition count 490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 59 transition count 490
Applied a total of 28 rules in 59 ms. Remains 59 /74 variables (removed 15) and now considering 490/528 (removed 38) transitions.
// Phase 1: matrix 490 rows 59 cols
[2024-06-01 04:44:07] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 04:44:08] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 04:44:08] [INFO ] Invariant cache hit.
[2024-06-01 04:44:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:44:08] [INFO ] Implicit Places using invariants and state equation in 379 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 586 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/74 places, 490/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 57 transition count 489
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 55 transition count 488
Applied a total of 4 rules in 37 ms. Remains 55 /57 variables (removed 2) and now considering 488/490 (removed 2) transitions.
// Phase 1: matrix 488 rows 55 cols
[2024-06-01 04:44:08] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:44:08] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 04:44:08] [INFO ] Invariant cache hit.
[2024-06-01 04:44:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:44:09] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/74 places, 488/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1256 ms. Remains : 55/74 places, 488/528 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-02
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-02 finished in 1346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 72 transition count 510
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 510
Applied a total of 4 rules in 6 ms. Remains 72 /74 variables (removed 2) and now considering 510/528 (removed 18) transitions.
// Phase 1: matrix 510 rows 72 cols
[2024-06-01 04:44:09] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 04:44:09] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 04:44:09] [INFO ] Invariant cache hit.
[2024-06-01 04:44:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:44:09] [INFO ] Implicit Places using invariants and state equation in 384 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 590 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/74 places, 510/528 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 510/510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 601 ms. Remains : 70/74 places, 510/528 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 4805 steps with 599 reset in 85 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-06 finished in 891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(X(p1))||p0)&&(X(X(p1))||F(p2))))))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 71 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 501
Applied a total of 6 rules in 7 ms. Remains 71 /74 variables (removed 3) and now considering 501/528 (removed 27) transitions.
// Phase 1: matrix 501 rows 71 cols
[2024-06-01 04:44:10] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 04:44:10] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 04:44:10] [INFO ] Invariant cache hit.
[2024-06-01 04:44:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:44:10] [INFO ] Implicit Places using invariants and state equation in 388 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 593 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/74 places, 501/528 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 603 ms. Remains : 69/74 places, 501/528 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-11
Product exploration explored 100000 steps with 5610 reset in 863 ms.
Product exploration explored 100000 steps with 5585 reset in 1021 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 203 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
RANDOM walk for 40000 steps (2074 resets) in 728 ms. (54 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (179 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (175 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (165 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (179 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
// Phase 1: matrix 501 rows 69 cols
[2024-06-01 04:44:14] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:44:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/569 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/570 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 79 constraints, problems are : Problem set: 0 solved, 4 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/569 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 04:44:15] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/569 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/570 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 84 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1820 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2284ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1022 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 501/501 transitions.
Graph (complete) has 734 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 68 transition count 492
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 62 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 60 transition count 490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 60 transition count 489
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 59 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 58 transition count 488
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 58 transition count 482
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 83 place count 52 transition count 434
Applied a total of 83 rules in 57 ms. Remains 52 /69 variables (removed 17) and now considering 434/501 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 52/69 places, 434/501 transitions.
RANDOM walk for 40000 steps (576 resets) in 417 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (80 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (38 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (48 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 583896 steps, run visited all 4 properties in 2446 ms. (steps per millisecond=238 )
Probabilistic random walk after 583896 steps, saw 87980 distinct states, run finished after 2446 ms. (steps per millisecond=238 ) properties seen :4
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 472 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-06-01 04:44:21] [INFO ] Invariant cache hit.
[2024-06-01 04:44:21] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 04:44:21] [INFO ] Invariant cache hit.
[2024-06-01 04:44:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:44:21] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-01 04:44:21] [INFO ] Invariant cache hit.
[2024-06-01 04:44:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 500/569 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 04:44:36] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 04:44:40] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 81 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 500/569 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 500/580 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/570 variables, and 580 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
After SMT, in 65507ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 65519ms
Finished structural reductions in LTL mode , in 1 iterations and 66083 ms. Remains : 69/69 places, 501/501 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 165 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
RANDOM walk for 40000 steps (2099 resets) in 634 ms. (62 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (182 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (178 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (168 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (176 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
[2024-06-01 04:45:28] [INFO ] Invariant cache hit.
[2024-06-01 04:45:28] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/569 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/570 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/570 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 79 constraints, problems are : Problem set: 0 solved, 4 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/62 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 496/558 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/568 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/568 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 04:45:29] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/569 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/570 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/570 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 84 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2000ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 652 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 501/501 transitions.
Graph (complete) has 734 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 68 transition count 492
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 62 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 60 transition count 490
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 60 transition count 489
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 59 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 58 transition count 488
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 58 transition count 482
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 83 place count 52 transition count 434
Applied a total of 83 rules in 61 ms. Remains 52 /69 variables (removed 17) and now considering 434/501 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 52/69 places, 434/501 transitions.
RANDOM walk for 40000 steps (635 resets) in 731 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (115 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (55 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 572601 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 4
Probabilistic random walk after 572601 steps, saw 85653 distinct states, run finished after 3008 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 434 rows 52 cols
[2024-06-01 04:45:34] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 434/486 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 62 constraints, problems are : Problem set: 0 solved, 4 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 04:45:35] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 434/486 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/486 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 67 constraints, problems are : Problem set: 0 solved, 4 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1086ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1030 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 434/434 transitions.
Applied a total of 0 rules in 17 ms. Remains 52 /52 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 52/52 places, 434/434 transitions.
RANDOM walk for 40000 steps (657 resets) in 542 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (61 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (54 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 583896 steps, run visited all 2 properties in 2440 ms. (steps per millisecond=239 )
Probabilistic random walk after 583896 steps, saw 87980 distinct states, run finished after 2440 ms. (steps per millisecond=239 ) properties seen :2
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 461 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Product exploration explored 100000 steps with 5618 reset in 692 ms.
Product exploration explored 100000 steps with 5620 reset in 720 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false]
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 69 transition count 501
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 69 transition count 503
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 69 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 69 transition count 503
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 41 ms. Remains 69 /69 variables (removed 0) and now considering 503/501 (removed -2) transitions.
[2024-06-01 04:45:43] [INFO ] Redundant transitions in 37 ms returned []
Running 502 sub problems to find dead transitions.
// Phase 1: matrix 503 rows 69 cols
[2024-06-01 04:45:43] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:45:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 04:45:50] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 04:45:51] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 3 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 04:45:51] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 04:45:51] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 04:45:51] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 04:45:52] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 04:45:52] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 04:45:53] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 8/17 constraints. Problems are: Problem set: 8 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 494 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 4 (OVERLAPS) 502/571 variables, 69/86 constraints. Problems are: Problem set: 12 solved, 490 unsolved
[2024-06-01 04:45:58] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 1 ms to minimize.
[2024-06-01 04:46:01] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 2 ms to minimize.
[2024-06-01 04:46:02] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 3/89 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/89 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 7 (OVERLAPS) 1/572 variables, 1/90 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 9 (OVERLAPS) 0/572 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 490 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 90 constraints, problems are : Problem set: 12 solved, 490 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 12 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 9/67 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 11/20 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 501/568 variables, 67/87 constraints. Problems are: Problem set: 12 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 490/577 constraints. Problems are: Problem set: 12 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 568/572 variables, and 577 constraints, problems are : Problem set: 12 solved, 490 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 490/502 constraints, Known Traps: 11/11 constraints]
After SMT, in 64836ms problems are : Problem set: 12 solved, 490 unsolved
Search for dead transitions found 12 dead transitions in 64843ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 69/69 places, 491/501 transitions.
Graph (complete) has 725 edges and 69 vertex of which 59 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 59 /69 variables (removed 10) and now considering 491/491 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/69 places, 491/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64957 ms. Remains : 59/69 places, 491/501 transitions.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 69 cols
[2024-06-01 04:46:47] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:46:48] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 04:46:48] [INFO ] Invariant cache hit.
[2024-06-01 04:46:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:46:48] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-01 04:46:48] [INFO ] Invariant cache hit.
[2024-06-01 04:46:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (OVERLAPS) 500/569 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 04:47:01] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-01 04:47:05] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (OVERLAPS) 1/570 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/570 variables, and 81 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 500/569 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 500/580 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/570 variables, and 580 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 2/2 constraints]
After SMT, in 64507ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 64514ms
Finished structural reductions in LTL mode , in 1 iterations and 65048 ms. Remains : 69/69 places, 501/501 transitions.
Treatment of property AutonomousCar-PT-08a-LTLCardinality-11 finished in 223021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 519
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 65 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 64 transition count 518
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 63 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 63 transition count 509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 61 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 60 transition count 507
Applied a total of 26 rules in 51 ms. Remains 60 /74 variables (removed 14) and now considering 507/528 (removed 21) transitions.
// Phase 1: matrix 507 rows 60 cols
[2024-06-01 04:47:53] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 04:47:53] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 04:47:53] [INFO ] Invariant cache hit.
[2024-06-01 04:47:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:47:53] [INFO ] Implicit Places using invariants and state equation in 352 ms returned [56, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 546 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/74 places, 507/528 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 58 transition count 506
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 505
Applied a total of 4 rules in 37 ms. Remains 56 /58 variables (removed 2) and now considering 505/507 (removed 2) transitions.
// Phase 1: matrix 505 rows 56 cols
[2024-06-01 04:47:53] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:47:53] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 04:47:53] [INFO ] Invariant cache hit.
[2024-06-01 04:47:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 04:47:54] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/74 places, 505/528 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1200 ms. Remains : 56/74 places, 505/528 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08a-LTLCardinality-15
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08a-LTLCardinality-15 finished in 1256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(X(p1))||p0)&&(X(X(p1))||F(p2))))))'
[2024-06-01 04:47:54] [INFO ] Flatten gal took : 74 ms
[2024-06-01 04:47:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 04:47:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 528 transitions and 6039 arcs took 17 ms.
Total runtime 235611 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-08a-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717217327316

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-08a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1115/ltl_0_
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 74 places, 528 transitions and 6039 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1115/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1115/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1115/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1115/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 75 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 75, there are 746 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~18 levels ~10000 states ~33096 transitions
pnml2lts-mc( 3/ 4): ~19 levels ~20000 states ~68888 transitions
pnml2lts-mc( 3/ 4): ~19 levels ~40000 states ~155240 transitions
pnml2lts-mc( 3/ 4): ~19 levels ~80000 states ~352000 transitions
pnml2lts-mc( 3/ 4): ~19 levels ~160000 states ~719900 transitions
pnml2lts-mc( 3/ 4): ~19 levels ~320000 states ~1549388 transitions
pnml2lts-mc( 3/ 4): ~30 levels ~640000 states ~3188216 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~1280000 states ~6190600 transitions
pnml2lts-mc( 3/ 4): ~112 levels ~2560000 states ~12969816 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~5120000 states ~27451192 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~209!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6190220
pnml2lts-mc( 0/ 4): unique states count: 6396204
pnml2lts-mc( 0/ 4): unique transitions count: 39708811
pnml2lts-mc( 0/ 4): - self-loop count: 1514075
pnml2lts-mc( 0/ 4): - claim dead count: 30806290
pnml2lts-mc( 0/ 4): - claim found count: 981109
pnml2lts-mc( 0/ 4): - claim success count: 6396213
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1719
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6396213 states 39708917 transitions, fanout: 6.208
pnml2lts-mc( 0/ 4): Total exploration time 51.720 sec (51.720 sec minimum, 51.720 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123670, Transitions per second: 767767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 49.4MB, 8.1 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 540 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 49.4MB (~256.0MB paged-in)

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="AutonomousCar-PT-08a"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167500331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;